Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-modular-approach-to-real-time-synchronization-UDzjsvRGXO
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1996 by ACM Inc.
- ISSN
- 1055-6400
- DOI
- 10.1145/227986.227990
- Publisher site
- See Article on Publisher Site
Abstract
In this paper, we discuss real-time barrier synchronization as an example of timing constraints on synchronization. Real-time barrier synchronization is constrained by two timing values: earliest release time and release time skew. Earliest release time is the delay from the time when the last object participating in barrier synchronization issues a barrier operation, till when one of the participating objects resumes its method. Release time skew is the delay between the first and the last resumption times of objects. The implementation of real-time barrier synchronization consists of a negotiation phase and a scheduling phase. In the negotiation phase, all the participating objects communicate with one another and agree on the time when they are going to resume their method execution. Local scheduling at individual nodes must then ensure that the agreement is implemented. Thus, earliest release time and release time skew are defined by the procedures of the negotiation and the scheduling phase, respectively. We describe an architecture which enables the implementation of real-time barrier synchronization in a distributed system with unreliable channels.
Journal
ACM SIGPLAN OOPS Messenger – Association for Computing Machinery
Published: Jan 1, 1996