Journal ArticleDOI
Synchronization of asynchronous processes in CSP
TLDR
A simple algorithm is proposed to implement the generalized alternative command for CSP and it is shown that it uses fewer messages than existing algorithms.Abstract:
Many concurrent programming languages including CSP and Ada use synchronous message-passing to define communication between a pair of asynchronous processes. Suggested primitives like the generalized alternative command for CSP and the symmetric select statement for Ada allow a process to nondeterministically select one of several communication statements for execution. The communication statement may be either an input or an output statement. We propose a simple algorithm to implement the generalized alternative command and show that it uses fewer messages than existing algorithms.read more
Citations
More filters
Book
Distributed Algorithms for Message-Passing Systems
TL;DR: This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduateStudents in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications.
Higher-order concurrency
TL;DR: This dissertation presents an approach to concurrent language design that provides a new form of linguistic support for constructing concurrent applications that treats synchronous operations as first-class values in a way that is analogous to the treatment of functions in languages such as ML.
Journal ArticleDOI
Efficient fault-tolerant algorithms for distributed resource allocation
Manhoi Choy,Ambuj K. Singh +1 more
TL;DR: An algorithm for the resource allocation problem is presented that achieves a constant failure locality of four along with a quadratic response time and aquadratic message complexity and applications to other process synchronization problems in distributed systems are demonstrated.
Journal ArticleDOI
Coordinating first-order multiparty interactions
Yuh-Jzer Joung,Scott A. Smolka +1 more
TL;DR: This work presents a fully distributed and message-efficient algorithm for the enrolement guard-scheduling problem, the first such solution of which it is aware, and describes several extensions of the algorithm, including: generic roles; dynamically changing environments, where processes can be created and destroyed at run time; and nested-enrolement, which allows interactions to be nested.
Journal ArticleDOI
Logically instantaneous message passing in asynchronous distributed systems
T. Soneoka,Toshihide Ibaraki +1 more
TL;DR: An interprocess (point-to-point) communication mechanism that has the characteristic of instantaneous message passing is proposed and two modified algorithms are proposed: one for reducing the number of control messages required for an application message, and the other for attaining a shorter average response time by using a randomization technique.
References
More filters
Journal ArticleDOI
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Journal ArticleDOI
Guarded commands, nondeterminacy and formal derivation of programs
TL;DR: So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state.
Book
Parallel Program Design: A Foundation
TL;DR: One that the authors will refer to break the boredom in reading is choosing parallel program design a foundation as the reading material.
Book
Reference Manual for the ADA Programming Language
TL;DR: This grammar of the Ada follows the Ada 95 Reference Manual, consisting of the international standard (ISO/IEC 8652:2012): Information Technology -Programming Languages -Ada.
Journal ArticleDOI
Distributed cooperation with action systems
Ralph-Johan Back,F. Kurki-Suonio +1 more
TL;DR: It is shown that for fairly serializable systems, properties that hold for any concurrent execution of the system can be established by temporal proofs that are conducted entirely within the simpler sequential execution model.