ACM Home Page
Please provide us with feedback. Feedback
A modular approach to real-time synchronization
Full text PdfPdf (704 KB)
Source ACM SIGPLAN OOPS Messenger archive
Volume 7 ,  Issue 1  (January 1996) table of contents
Special issue: object-oriented real-time systems
Pages: 13 - 20  
Year of Publication: 1996
ISSN:1055-6400
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/227986.227990
What is a DOI?

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.


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
2
 
3
[3] K. Arvind. A New Probabilistic Algorithm for Clock Synchronization. Proc. IEEE Real-Time Systems Symp., pp. 330-339, December 1989.
 
4
 
5
 
6
 
7
[7] R. Gerber et al. Guaranteeing End-to-End Timing Constraints by Calibrating Intermediate Processes. Proc. IEEE Real-Time Systems Symp., December 1994.
8
 
9
 
10
[10] K. Kim and H. Kopetz. A Real-Time Object Model RTO.k and an Experimental Investigation of Its Potentials. Proc. IEEE Computer Society's Computer Software and Applications Conf. (COMPSAC), November 1994.
 
11
 
12
[12] H. Kopetz and K. Kim. Temporal Uncertainties in Interactions among Real-Time Objects. Proc. IEEE 9th Symp. on Reliable Distributed Systems, pp. 165- 174, October 1990.
 
13
[13] H. Kopetz and K. Kim. Consistency Constraints in Distributed Real-Time Systems, in Distributed Computer Control Systems 1988, M.G. Rodd and T.L. d'Epinay ed., Pergamon Press, pp. 29-34, 1989.
 
14
[14] E. L. Lawler and C. U. Martel. Scheduling Periodically Occurring Tasks on Multiple Processors. Information Processing Letters, Vol. 12, No. 1, February 1981.
 
15
[15] J. Lehoczky et al. Enhancing A periodic Responsiveness in a Hard Real-Time Environment. Proc. IEEE Real-Time Systems Symp., December 1987.
16
 
17
[17] J. W. S. Liu et al. Imprecise Computations. Proc. IEEE, Vol. 82, No. 1, pp. 83-94, January 1994.
18
 
19
[19] A. K. Mok and M. L. Dertouzos. Multiprocessor Scheduling in a Hard Real-Time Environment. Proc. 7th Texas Conf. on Computer Systems, November 1978.
 
20
[20] A. K. Mok. The Design of Real-Time Programming Systems Based on Process Models. Proc. IEEE Real-Time System Symp., December 1984.
 
21
 
22
23
24

Collaborative Colleagues:
Masahiko Saito: colleagues
Gul A. Agha: colleagues