The use of a synchronizer yields the maximum computation rate in distributed networks

Theory of Computing Systems

Volumn 30, Issue 5, 1997, Pages 447-474

  Even, S ^a   Rajsbaum, S ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

SYNCHRONIZATION; WAKES;

DISTRIBUTED NETWORKS; FIXED-DELAY; FULL-SPEED; GLOBAL CLOCKS; STEADY STATE; TRANSMISSION DELAYS; WAKE UP;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031215285     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679457     Document Type: Article

References (19)

1. B. Awerbuch, Complexity of Network Synchronization, J. Assoc. Comput. Mach., Vol. 32, No. 4, Oct. 1985, pp. 804-823.
2. B. Awerbuch, Reducing Complexities of Distributed Maximum Flow and Breadth-First Search Algorithms by Means of Network Synchronization, Networks, Vol. 15, No. 4, Winter 1985, pp. 425-437.
3. B. Awerbuch, M. Sipser, Dynamic Networks are as Fast as Static Networks, in Proc. 29th IEEE Symp. on Foundations of Computer Science, Oct. 1988, pp. 206-220.
4. A. Brauer, On a Problem of Partitions, Amer. J. Math., Vol. 64, 1942, pp. 299-312.
5. V.C. Barbosa, E. Gafni, Concurrency in Heavily Loaded Neighborhood-Constrained Systems, ACM Trans. Programming Languages and Systems, Vol. 11, No. 4, Oct. 1989, pp. 562-584.
6. C.T. Chou, I.S. Gopal, S. Zaks, Synchronizing Asynchronous Bounded-Delay Networks, Research Report RC-12274, IBM, Yorktown Heights, NY, Oct. 1986.
7. F. Commoner, A.W. Holt, S. Even, A. Pnueli, Marked Directed Graphs, J. Comput. System Sci., Vol. 5, No. 5, Oct. 1971, pp. 511-523.
8. K.M. Chandy and L. Lamport, Distributed Snapshots: Determining Global States of Distributed Systems, ACM Trans. Comput. Systems, Vol. 3, No. 1, Feb. 1985, pp. 63-75.
9. S. Even, S. Rajsbaum, Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer, Math. Systems Theory, Vol. 28, No. 5, 1995, pp. 421-435.
10. A. Fekete, N. Lynch, L. Shrira, A Modular Proof of Correctness for a Network Synchronizer, Proc. 2nd Workshop on Distributed Algorithms, CWI, July 1987, pp. 219-256.
11. H.J. Genrich, Einfache Nicht-Sequentielle Prozesse, Gesellschaft fur Mathematik und Datenverarbeitung, Birlinghoven, 1970.
12. G.H. Hardy, E.M. Wright, An Introduction to the Theory of Numbers, 4th edn., 1968, Oxford University Press, Oxford.
13. R.M. Karp, A Characterization of the Minimum Cycle Mean in a Digraph, Discrete Math., Vol. 23, 1978, pp. 309-311.
14. E.F. Moore, The Firing Squad Synchronization Problem, in Sequential Machines, Selected Papers, Addison-Wesley, Reading, MA, 1964, pp. 213-214.
15. Y. Malka, S. Moran, S. Zaks, A Lower Bound on the Period Length of a Distributed Scheduler, Algorithmica, Vol. 10, 1994, pp. 383-398.
16. Y. Malka, S. Rajsbaum, Analysis of Distributed Algorithms Based on Recurrence Relations, in Proc. 5th Internat. Workshop on Distributed Algorithms, Delphi, Oct. 7-9, S. Toueg et al. (eds.), LNCS, Vol. 579, Springer-Verlag, Berlin, 1991, pp. 242-253.
17. D. Peleg, J. Ullman, An Optimal Synchronizer for the Hypercube, SIAM J. Comput., Vol. 18, No. 2, 1989, pp. 740-747.
18. R. Reiter, Scheduling Parallel Computations, J. Assoc. Comput. Mach., Vol. 15, No. 4, Oct. 1968, pp. 590-599.
19. S. Rajsbaum, M. Sidi, On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays, IEEE Trans. Parallel Distrib. Systems, Vol. 5, No. 9, Sept. 1994, pp. 939-950.