Parallel Computations on Finite Partially Ordered Sets
by Gennady P. Agibalov
Abstract:
Parallel computing system is defined on a finite partially ordered set; properties of existence, generality and invariance of convergent computational processes in it are stated, and a minimization procedure preserving results of computations is given.
Keywords: theory
Source:
G.P. Agibalov, Parallel Computations on Finite Partially Ordered Sets. In V. Malyshkin (ed.),
Parallel Computing Technologies: Proceedings of the 4th International Conference,
Lect. Notes in Comp. Sci., Vol. 1277, Springer, 1997, pp. 1-6
