Distributed algorithms for synchronizing interprocess communication within real time

No abstract is available for this paper.

• Publication year

  1981

• Venue

  Symposium on the Theory of Computing

• Publication date

  1981-05-11

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/800076.802467
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Theories of Programming Languages: Communicating Sequential Processes

  1998cited by this paper
• A Scheme for Fast Parallel Communication

  1982cited by this paper
• A difference in efficiency between synchronous and asynchronous systems

  1981cited by this paper
• On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

  1981cited by this paper
• Fast allocation of nearby resources in a distributed system

  1980influential reference
• N-process synchronization by 4.log2N-valued shared variable

  1980cited by this paper
• Local and global properties in networks of processors (Extended Abstract)

  1980cited by this paper
• Deadlock- and livelock-free packet switching networks

  1980cited by this paper
• Output Guards and Nondeterminism in “Communicating Sequential Processes”

  1980cited by this paper
• A distributed abstract data type implemented by a probabilistic communication scheme

  1980cited by this paper

• Probabilistic Bidding Gives Optimal Distributed Resource Allocation

  2018cites this paper
• A Glimpse at Paul G. Spirakis

  2015cites this paper
• about the Internet and Networking : 2010 – 2019

  2003cites this paper
• Data flow analysis of distributed communicating processes

  1990cites this paper
• The complexity of reachability in distributed communicating processes

  1988cites this paper
• Concurrent Probabilistic Programs, Or: How to Schedule if You Must

  1985cites this paper
• Real-Time Synchronization of Interprocess Communications

  1984cites this paper
• Distributed algorithms for ensuring fair interprocess communicatons

  1984cites this paper
• Theoretical issues in the design and verification of distributed systems

  1983cites this paper
• Termination of Probabilistic Concurrent Program

  1983cites this paper
• Concurrent Probabilistic Program, or: How to Schedule if You Must

  1983cites this paper
• Termination of Probabilistic Programs

  1983cites this paper
• Termination of probabilistic concurrent programs: (extended abstract)

  1982cites this paper
• Real time resource allocation in distributed systems

  1982cites this paper
• Unbounded speed variability in distributed communication systems

  1982cites this paper
• On the Power of Probabilistic Choice in Synchronous Parallel Computations

  1982cites this paper
• Symmetry breaking in distributive networks

  1981cites this paper
• Critical Remarks on MAX Model of Concurrency

  1981cites this paper
• Parallel Computations with Probabilistic Choice

  year unknowncites this paper