Real-Time Synchronization of Interprocess Communications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Real-Time Synchronization of Interprocess Communications

Full text

Pdf (1.37 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 6 , Issue 2 (April 1984) table of contents

Pages: 215 - 238

Year of Publication: 1984

ISSN:0164-0925

Authors

John H. Reif	Aiken Computation Laboratory, Harvard University, Cambridge, MA
Paul G. Spirakis	Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 35, Citation Count: 8

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/2993.357244 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.

	1	Dana Angluin, Local and global properties in networks of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.82-93, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804655]
	2	Eshrat Arjomandi , Michael J. Fischer , Nancy A. Lynch, A difference in efficiency between synchronous and asynchronous systems, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.128-132, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802466]
	3	Arthur Bernstein, Output Guards and Nondeterminism in “Communicating Sequential Processes”, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.2, p.234-238, April 1980 [doi>10.1145/357094.357101]
	4	FRANCEZ, N., AND RODEH, A distributed data type implemented by a probabilistic communication scheme. In Proceedings of 21st Annual Symposium on Foundations of Computer Science (Syracuse, N.Y., Oct.) 1980, pp. 373-379.
	5	C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
	6	Daniel Lehmann , Michael O. Rabin, On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.133-138, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567547]
	7	LIPTON, R., AND SAYWARD, F.G. Response time of parallel programs. Res. Rep. 108. Dept. of Computer Science, Yale Univ., New Haven, Conn., June 1977.
	8	Nancy A. Lynch, Fast allocation of nearby resources in a distributed system, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.70-81, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804654]
	9	RAmN, M. The choice coordination problem. Mere. UCB/ERL M80/38. Electronics Research Lab., Univ. of California, Berkeley, Aug. 1980.
	10	RABIN, M. N-Process synchronization by a 4 log2N-valued shared variable. In Proceedings o{ 21st Annual Symposium on Foundations o{ Computer Science (Syracuse, N.Y., Oct.) 1980, pp. 407-410.
	11	John Reif , Paul Spirakis, Distributed algorithms for synchronizing interprocess communication within real time, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.133-145, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802467]
	12	John Reif , Paul Spirakis, Unbounded speed variability in distributed communication systems, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.46-56, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582159]
	13	John Reif , Paul Spirakis, Real time resource allocation in distributed systems, Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.84-94, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806685]
	14	SCHWARZ, J. Distributed synchronization of communicating sequential processes. DAI Res. Rep. 56, Univ. of Edinburgh, Scotland, 1980.
	15	VALIANT, L.G. A scheme for fast parallel communication. Tech. Rep., Computer Science Dept., Univ. of Edinburgh, Scotland, July 1980.

CITED BY 8

	L. M. Kirousis , P. Spirakis , P. Tsigas, Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity, IEEE Transactions on Parallel and Distributed Systems, v.5 n.7, p.688-696, July 1994
	Albert G. Greenberg , Boris D. Lubachevsky , Andrew M. Odlyzko, Simple, efficient, asynchronous parallel algorithms for maximization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.2, p.313-337, April 1988
	Rajiv Gupta , Scott A. Smolka , Shaji Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), v.26 n.1, p.7-86, March 1994
	Albert G. Greenberg , Boris D. Lubachevsky , Andrew M. Odlyzko, Simple, efficient asynchronous parallel algorithms for maximization, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.300-308, August 1985, Minaki, Ontario, Canada
	Y. K. Tsay , R. L. Bagrodia, Fault-Tolerant Algorithms for Fair Interprocess Synchronization, IEEE Transactions on Parallel and Distributed Systems, v.5 n.7, p.737-748, July 1994
	Andrew S. Tanenbaum , Robbert Van Renesse, Distributed operating systems, ACM Computing Surveys (CSUR), v.17 n.4, p.419-470, Dec. 1985
	Yuh-Jzer Joung , Scott A. Smolka, Strong Interaction Fairness Via Randomization, IEEE Transactions on Parallel and Distributed Systems, v.9 n.2, p.137-149, February 1998
	Catuscia Palamidessi , Oltea Mihaela Herescu, A randomized encoding of the π-calculus with mixed choice, Theoretical Computer Science, v.335 n.2-3, p.373-404, 23 May 2005