Supporting Fault-Tolerant Real-Time Applications using the RED-Linux General Scheduling Framework

  • Kwei-Jay Lin
  • Yi-Chung Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)

Abstract

In this paper, we study the fault-tolerant support for real-time applications. In particular, we study the scheduling issues and kernel support for fault monitors and the primary-backup task model. Using the powerful scheduling framework in RED-Linux, we can support a jitter-less fault monitoring. We can also provide the task execution isolation so that an erroneous runaway task will not take away additional CPU budget from other concurrently running tasks. Finally, we provide a group mechanism to allow the primary and backup jobs of a fault-tolerant task to share both the CPU budget as well as other resources. All these mechanisms make the implementation of fault-tolerant real-time systems easier.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Abeni and G.C. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proc. IEEE Real-Time Systems Symposium, Dec 1998.Google Scholar
  2. 2.
    J.C.R. Bennett and H. Zhang. WF2Q: Worst-case fair weighted fair queueing. In Proc. of IEEE INFOCOMM’96, San Francisco, CA, pp. 120–128, March 1996.Google Scholar
  3. 3.
    S. Punnekkat and A. Burns. Analysis of checkpointing for schedulability of real-time systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 198–205, San Francisco, December 1997.Google Scholar
  4. 4.
    M. Caccamo and G. Buttazzo. Optimal Scheduling for Fault-Tolerant and Firm Real-Time Systems. Proceedings of IEEE Conference on Real-Time Computing Systems and Applications, Hiroshima, Japan, Oct 1998.Google Scholar
  5. 5.
    H. Chetto and M. Chetto. An adaptive scheduling algorithm for fault-tolerant real-time systems. Software Engineering Journal, May 1991.Google Scholar
  6. 6.
    A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a Fair Queueing Algorithm. In Journal of Internetworking Research and Experience, pp.3–26, October 1990.Google Scholar
  7. 7.
    Ching-Chih Han, Kwei-Jay Lin and Chao-Ju Hou. Distance-constrained scheduling and its applications to real-time systems. In IEEE Trans. Computers, Vol. 45, No. 7, pp. 814–826, December 1996.MATHCrossRefGoogle Scholar
  8. 8.
    Chih-wen Hsueh and Kwei-Jay Lin. An optimal Pinwheel Scheduler Using the Single-Number Reduction Techniques. In Proc. of IEEE Real-Time Systems Symposium, December 1996, pp.196–205.Google Scholar
  9. 9.
    Chih-wen Hsueh and Kwei-Jay Lin. On-line Schedulers for Pinwheel Tasks Using the Time-Driven Approach. In Proc. of the 10th Euromicro Workshop on Real-Time Systems, Berlin, Germany, June 1998, pp. 180–187.Google Scholar
  10. 10.
    K. Jeffay et al. Proportional Share Scheduling of Operating System Service for Real-Time Applications. In Proc. IEEE Real-Time Systems Symposium, Madrid, Spain, pp. 480–491, Dec 1998.Google Scholar
  11. 11.
    A. L. Liestman and R. H. Campbell. A fault-tolerant scheduling problem. IEEE Transactions on Software Engineering, 12(11):1089–95, November 1986.MATHGoogle Scholar
  12. 12.
    C.L. Liu and J. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20(1):46–61, 1973.MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    J.W.-S. Liu, K.J. Lin, W.-K. Shih, A.C. Yu, J.Y. Chung and W. Zhao. Imprecise Computation. In Proc. of IEEE 82:83–94, 1994CrossRefGoogle Scholar
  14. 14.
    A. K. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. In IEEE/ACM Trans. Networking, Vol. 1, No. 3, pp. 344–357, June 1993.CrossRefGoogle Scholar
  15. 15.
    L. Sha. Dependable system upgrade. In Proc. IEEE Real-Time Systems Symposium, pp. 440–448, Dec 1998.Google Scholar
  16. 16.
    M. Spuri and G.C. Buttazzo. Efficient aperiodic service under the earliest deadline scheduling. In Proc. IEEE Real-Time Systems Symposium, Dec 1994.Google Scholar
  17. 17.
    I. Stoica, H. Zhang, and T.S.E. Ng. A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services. In Proc. of ACM SIGCOMM’97, Cannes, France, 1997.Google Scholar
  18. 18.
    Y.C. Wang and K.J. Lin. Enhancing the real-time capability of the Linux kernel. In Proc. of 5th RTCSA’ 98, Hiroshima, Japan, Oct 1998.Google Scholar
  19. 19.
    Y.C. Wang and K.J. Lin. Implementing a general real-time framework in the RED-Linux real-time kernel. In Proc. of RTSS’99, Phoenix, Arizona, Dec 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Kwei-Jay Lin
    • 1
  • Yi-Chung Wang
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of CaliforniaIrvine

Personalised recommendations