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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (652 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-second annual ACM symposium on Theory of computing table of contents

Baltimore, Maryland, United States

Pages: 95 - 105

Year of Publication: 1990

ISBN:0-89791-361-2

Authors

S. Even	Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel 32000 and Computer Science Program, University of Texas at Dallas, Richardson, TX
S. Rajsbaum	Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel 32000 and Computer Science Program, University of Texas at Dallas, Richardson, TX

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 12, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/100216.100227 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	A	Baruch Awerbuch, Complexity of network synchronization, Journal of the ACM (JACM), v.32 n.4, p.804-823, Oct. 1985 [doi>10.1145/4221.4227]
	B	A. Brauer, "On a Problem of Partitions", American J. Math., Vol. 64, 1942, pp. 299- 312.
	CL	K. Mani Chandy , Leslie Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.1, p.63-75, Feb. 1985 [doi>10.1145/214451.214456]
	CHEP	F. Commoner, A.W. Holt, S. Even, A. Pnueli, "Marked Directed Graphs", J. of Computer and System Sciences, Vol. 5, No. 5, Oct. 1971.
	ER	S. Even , S. Rajsbaum, Unison in distributed networks, Sequences: combinatorics, compression, security, and transmission, Springer-Verlag New York, Inc., New York, NY, 1990
	HW	G.H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 4-th edition, 1960, Oxford University Press.
	GE	H.J. Genrich, "Einfache Nicht-Sequentielle Prozesse", Gesellschaft fur Mathematik und Datenverarbeitung, Birlinghoven, West Germany, 1970.
	K	R.M. Karp, "A Characterization of the Minimum Cycle Mean in a Digraph", Discrete Mathematics, Vol. 23, 1978, pp. 309-311.
	M	E.F. Moore, "The Firing Squad Synchronization Problem", in Sequential Machines, Selected Papers, Addison-Wesley, 1964, pp. 213-214.
	R	Raymond Reiter, Scheduling Parallel Computations, Journal of the ACM (JACM), v.15 n.4, p.590-599, Oct. 1968 [doi>10.1145/321479.321485]
	RS	S. Rajsbaum, M. Sidi, "On the Average Performance of Distributed Networks", Technion, Haifa, Israel, In preparation.

CITED BY 6

	Wolfgang Backes , Uwe Schwiegelshohn , Lothar Thiele, Analysis of free schedule in periodic graphs, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.333-342, June 29-July 01, 1992, San Diego, California, United States
	Baruch Awerbuch , Alan Baratz , David Peleg, Cost-sensitive analysis of communication protocols, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.177-187, August 22-24, 1990, Quebec City, Quebec, Canada
	Baruch Awerbuch , Boaz Patt-Shamir , David Peleg , Michael Saks, Adapting to asynchronous dynamic networks (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.557-570, May 04-06, 1992, Victoria, British Columbia, Canada
	S. Rajsbaum , M. Sidi, On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays, IEEE Transactions on Parallel and Distributed Systems, v.5 n.9, p.939-950, September 1994
	Amos Israeli , Evangelos Kranakis , Danny Krizanc , Nicola Santoro, Time-message trade-offs for the weak unison problem, Nordic Journal of Computing, v.4 n.4, p.317-329, Winter 1997
	Uwe Schwiegelshohn , Lothar Thiele, Dynamic Min-Max Problems, Discrete Event Dynamic Systems, v.9 n.2, p.111-134, May 1999