Abstract
In this paper a solution is given for the problem to determine the duration of a parallel asynchronous multi-step process in a homogeneous system of combinational logic. In such a system the problem arises if the processors have different speeds and input data. If so each processor “knows” its own data and the type of the process but in general has no information about the speed of the other processors and their input data.
This work has been supported by the Deutsche Forschungsgemeinschaft (DFG) under grants 436-WER-113-1-0 (438 113/117/0) and Ma 1150/8-1
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Borrill P.L.: Futurebus+: A Tutorial. VMEbus Applications 4 (1990) 25–34
Makhaniok M., Cherniavsky V., Marte C., Männer R.: Data Representation for Median Search Operation. Proc. 6th Int'l Symp. on Comp. & Inform. Sci., Antalya, Turkey 2 (1991) 1011–1017
Taub D.M.: Improved Control Acquisition Time for the IEEE 896 Futurebus. IEEE Micro 7 (1987) 52–62
Makhaniok M., Cherniavsky V., Männer R., Stucky O.: Reduced Bus Acquisition Time in Distributed Arbitration Systems. Electron. Lett. 25 (1989) 1593–1594
Makhaniok M., Cherniavsky V., Männer R., Stucky O.: Massively Parallel Realization of Logical Operations in Distributed Parallel Systems. Proc. Joint Int'l Conf. on Vector and Parallel Processing, Lecture Notes in Comp. Sci. 457, Springer, Heidelberg (1990) 796–805
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makhaniok, M., Männer, R. (1992). Synchronization of parallel processes in distributed systems. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_410
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_410
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive