This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Timing Constraint Remapping to Achieve Time Equi-Continuity in Distributed Real-Time Systems
December 2001 (vol. 50 no. 12)
pp. 1310-1320

Discretely synchronized, distributed real-time systems may suffer from a time discontinuity problem in that local clocks observe the disappearance or reappearance of time intervals. This problem occurs since traditional discrete clock synchronization algorithms adjust local clocks instantaneously. Such time discontinuities may lead to runtime faults due to the loss or gain of critical time points such as task release times and deadlines. In this paper, we propose a dynamic constraint transformation technique we call a constraint transformation for equi-continuity (CTEC) to correctly enforce timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much runtime overhead to be implemented in software. The proposed CTEC technique can solve the time discontinuity problem without modifying discrete clock synchronization algorithms. The CTEC, working as an added component of discrete clock synchronization, moves timing constraints out of discontinuous time intervals. In doing so, it makes use of a mapping derived from continuous clock synchronization in order to exploit its continuity property. We formally prove the correctness of CTEC by showing that the CTEC with discrete clock synchronization generates the same task schedule as continuous clock synchronization. In order to show the effectiveness of CTEC, we have implemented it on a distributed platform based on the CAN bus and performed extensive experiments. The experimental results indicate that time discontinuities present a consistency problem to real-world systems. They also show that CTEC is an effective solution to the problem while incurring little run-tine overhead.

[1] S.K. Baruah, D. Chen, and A.K. Mok, “Jitter Concerns in Periodic Task Systems,” Proc. IEEE Real-Time Systems Symp., pp. 68-77, Dec. 1997.
[2] R.E. Best, Phase-Locked Loops: Theory, Design, and Applications. McGraw-Hill, 1993.
[3] J.L.W. Kessels, “Two Designs of a Fault-Tolerant Clocking System,” IEEE Trans. Computers, vol. 33, no. 10, pp. 912-919, Oct. 1984.
[4] H. Kopetz, Real-Time Systems Design Principles for Distributed Embedded Applications, Kluwer Academic, Boston, 1997.
[5] H. Kopetz and W. Ochsenreiter, “Clock Synchronization in Distributed Real-Time Systems,” IEEE Trans. Computers, vol. 36, no. 8, pp. 933–940, Aug. 1987
[6] C. M. Krishna, K. G. Shin, and R. W. Butler,“Ensuring fault tolerance of phase-locked clocks,”IEEE Trans. Comput., vol. C-34, pp. 752–756, Aug. 1985.
[7] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[8] L. Lamport and P.M. Melliar-Smith, “Synchronizing Clocks in the Presence of Faults,” J. ACM, vol. 32, no. 1, pp. 52–78, Jan. 1985.
[9] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.
[10] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. IEEE Real-Time Systems Symp., Dec. 1990.
[11] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[12] P. Ramanathan, D.D. Kandlur, and K.G. Shin, “Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems,” IEEE Trans. Computers, vol. 39, no. 4, pp. 514-524, Apr. 1990.
[13] M. Ryu and S. Hong, “End-to-End Design of Distributed Real-Time Systems,” Control Eng. Practice, vol. 6, no. 1, pp. 93-102, Jan. 1998.
[14] M. Ryu and S. Hong, “Revisiting Clock Synchronization Problems: Static and Dynamic Constraint Transformations for Correct Timing Enforcement,” Technical Report SNU-EE-TR-1998-3, School of Electrical Eng., Seoul Nat'l Univ., Aug. 1998.
[15] Y. Seo, J. Park, and S. Hong, “Efficient User-Level I/O in the Arx Real-Time Operating Systems,” Proc. ACM SIGPLAN Workshop Languages, Compilers, and Tools for Embedded Systems, pp. 80-86, June 1998.
[16] Y. Seo, J. Park, G. Jeon, and S. Hong, “Supporting User-Level Multithreading in the Arx Real-Time Operating System,” Proc. IEEE Region Ten Conf., Sept. 1999.
[17] K.G. Shin and P. Ramanathan, “Synchronization of a Large Clock Network in the Presence of Malicious Faults,” IEEE Trans. Computers, vol. 36, no. 1, pp. 2-12, Jan. 1987.
[18] T. K. Srikanth and S. Toueg,“Optimal clock synchronization,”J. ACM, pp. 626–645, July 1987.
[19] K. Tindell, H. Hansson, and A. Wellings, “Analysing Real-Time Communications: Controller Area Network (CAN),” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[20] K.M. Zuberi and K.G. Shin, “Non-Preemptive Scheduling of Messages on Controller Area Network for Real-Time Control Applications,” Proc. Real-Time Technology and Applications Symp., pp. 240–249, May 1995.

Index Terms:
Distributed real-time system, timing constraint transformation, clock synchronization, real-time scheduling
Citation:
M. Ryu, J. Park, S. Hong, "Timing Constraint Remapping to Achieve Time Equi-Continuity in Distributed Real-Time Systems," IEEE Transactions on Computers, vol. 50, no. 12, pp. 1310-1320, Dec. 2001, doi:10.1109/TC.2001.970570
Usage of this product signifies your acceptance of the Terms of Use.