Skip to main content
SpringerLink
Log in

Enhancing fault-tolerance in rate-monotonic scheduling

  • Concise Paper
  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

In this paper, we address the problem of supporting timeliness and dependability at the level of task scheduling. We consider the problem of scheduling a set of tasks, each of which, for fault-tolerance purposes, has multiple versions, onto the minimum number of processors. On each individual processor, the tasks are guaranteed their deadlines by the Rate-Monotonic algorithm. A simple online allocation heuristic is proposed. It is proven thatN≤2.33N 0+κ, whereN is the number of processors required to feasibly schedule a set of tasks by the heuristic,N 0 is the minimum number of processors required to feasibly schedule the same set of tasks, and κ is the maximum redundancy degree a task can have. The bound is also shown to be a tight upper bound. The average-case performance of the heuristic is studied through simulation. It is shown that the heuristic performs surprisingly well on the average.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • A. Avizienis. TheN-version approach to fault-tolerant software.IEEE Trans. on Software Engineering, 11:1491–1501, 1985.

    Google Scholar 

  • J. A. Bannister and K. S. Trivedi. Task allocation in fault-tolerant distributed systems.Acta Informatica, 20:261–281, 1983.

    Google Scholar 

  • E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. Approximate algorithms for bin packing—An updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors,Algorithm Design for Computer System Design, pp. 49–106. Springer-Verlag, 1985.

  • S. Davari and S. K. Dhall. An on line algorithm for real-time tasks allocation.IEEE RTSS, 194–200, 1986a.

  • S. Davari and S. K. Dhall. On a periodic real-time task allocation problem.Proc. of 19th Annual International Conference on System Sciences, 133–141, 1986b.

  • B. L. Di Vito and R. W. Butler. Provable transient recovery for frame-based, fault-tolerant computing systems.IEEE RTSS, 275–279, 1992.

  • S. K. Dhall and C. L. Liu. On a real-time scheduling problem.Operations Research, 26:127–140, 1978.

    Google Scholar 

  • M. R. Garey and D. S. Johnson.Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, 1978.

  • J. D. Gafford. Rate-monotonic scheduling.IEEE Micro, 34–39, 1991.

  • A. L. Hopkins et al. FTMP—A highly reliable fault-tolerant multiprocessor for aircraft.Proc. of the IEEE, 66(10), 1978.

  • B. W. Johnson.Design and Analysis of Fault Tolerant Digital Systems. Addison-Wesley, 1989.

  • R. M. Kieckhafer, C. J. Walter, A. M. Finn, and P. M. Thambidurai. The MAFT architecture for distributed fault tolerance.IEEE Trans. on Computers, 37(4), 398–405, 1988.

    Google Scholar 

  • J. C. Knight and P. E. Ammann. Design fault tolerance.Reliability Engineering and System Safety, 32:25–49, 1991.

    Google Scholar 

  • C. M. Krishna and K. C. Shin. On scheduling tasks with a quick recovery from failure.IEEE Trans. on Computers, C-35(5):448–454, 1986.

    Google Scholar 

  • J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior.IEEE RTSS, 166–171, 1989.

  • C. L. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment.JACM, 10(1):46–61, 1973.

    Google Scholar 

  • Y. Oh and S. H. Son. Preemptive scheduling of periodic tasks on multiprocessor: Dynamic algorithms and their performance. TR-CS-93-26, University of Virginia, May 1993.

  • D. K. Pradhan.Fault-Tolerant Computing—Theory and Techniques, Volumes I and II, Prentice-Hall, 1986.

  • S. Ramos-Thuel and J. K. Strosnider. The transient server approach to scheduling time-critical recovery operations.IEEE RTSS, 286–295, 1991.

  • O. Serlin. Scheduling of time critical processes.Proceedings of the Spring Joint Computers Conference, 40:925–932, 1972.

    Google Scholar 

  • L. Sha, J. P. Lehoczky, and R. Rajkumar. Solution for some practical problems in prioritized preemptive scheduling.IEEE RTSS, 181–191, 1986.

  • L. Sha and J. B. Goodenough. Real-time scheduling theory and Ada.Computer, 53–65, 1990.

  • B. Sprunt, J. P. Lehoczky, and L. Sha. Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm.IEEE RTSS, 251–258, 1988.

  • Wensley, et al. SIFT: Design and analysis of a fault-tolerant computer for aircraft control.Proc. of the IEEE, 66(10):1240–1255, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Virginia, 22903, Charlottesville, VA

    Yingfeng Oh & Sang H. Son

Authors
  1. Yingfeng Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sang H. Son
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oh, Y., Son, S.H. Enhancing fault-tolerance in rate-monotonic scheduling. Real-Time Syst 7, 315–329 (1994). https://doi.org/10.1007/BF01088524

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01088524

Keywords

Search

Navigation