J. L. A. Van de Snepscheut. Synchronous communication between asynchronouscomponents. Information Processing Letters, 13(3):127--130, Dec. 1981.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Protocols for Non-Deterministic Communication over Synchronous.. - Demaine (1998) (Correct)
....is in fact as general as needed, since it can easily be used to implement such high level communication operations as Reppy s higher order concurrency [17] Unfortunately, it is difficult to support send operations in a non deterministic choice construct. Silberschatz [21] and Van de Snepscheut [22] examined cases where the construct is easy to implement if only certain processes use it. Inefficient implementations of the general construct include those that use global information (e.g. a central coordinator) 18] require an unbounded amount of time [10] or use an unbounded amount of ....
J. L. A. Van de Snepscheut. Synchronous communication between asynchronouscomponents. Information Processing Letters, 13(3):127--130, Dec. 1981.
Adaptive Protocols for Negotiating Non-Deterministic Choice over.. - Demaine (1997) (Correct)
....is in fact as general as needed, since it can easily be used to implement such high level communication operations as Reppy s higher order concurrency [18] Unfortunately, it is difficult to support send operations in a non deterministicchoice construct. Silberschatz [22] and Van de Snepscheut [23] examined cases where the construct is easy to implement if only certain processes use it. Inefficient implementations of the general construct include those that use global information (e.g. a central coordinator) 19] require an unbounded amount of time [9] or use an unbounded amount of ....
J. L. A. Van de Snepscheut. Synchronous communicationbetween asynchronous components. Information Processing Letters, 13(3):127--130, December 1981.
An Efficient Algorithm for Multi-Process Shared Events - Vijay Garg (Correct)
....effective implementation of the CSP I O construct. These conditions are minimality of the processes involved, minimality of system information at each process, low number of messages required and the selection of a ready interaction in a bounded amount of time. They showed that [Silberschatz 79, Snepscheut 81] did not satisfy one or more of these conditions. Back 84] improved upon this result by providing an implementation that satisfied two more conditions: weak fairness and bounded time for a process to determine if it can communicate with some process. Ramesh 87] provided an improved ....
J.L.A. Van de Snepscheut, "Synchronous Communication between asynchronous components", Information Processing Letters, 13, 3 Dec. 1981, pp 127-130.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC