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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Agibalov, G.P.: Parallel computations and finite automata on semilattices. Lect. Notes in Comp. Sci. 964 (1995), 7–15.
Fichelberger, E.B.: Hazard detection in combinational and sequential switching circuits. IBM Res. and Dev., 9 (1985), N 2, 90–99.
Agibalov, G.P.: Discrete automata on semilattices. Tomsk, Tomsk State University (1993)-in Russian.
Atchasova, S.M., Bandman, O.L.: Correctness of parallel computing processes. Novosibirsk, Nauka (1990)-in Russian.
Christofides, N.: Graph theory. An algorithmic approach. Academic Press (1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agibalov, G.P. (1997). Parallel computations on finite partially ordered sets. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive