Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Scheduling Real-Time Tasks for Dependability

Y. Oh and S. H. Son
The Journal of the Operational Research Society
Vol. 48, No. 6 (Jun., 1997), pp. 629-639
DOI: 10.2307/3010227
Stable URL: http://www.jstor.org/stable/3010227
Page Count: 11
  • Subscribe ($19.50)
  • Cite this Item
Scheduling Real-Time Tasks for Dependability
Preview not available

Abstract

Real-time systems are increasingly used in applications whose failure may result in large economic and human costs. Since many such systems operate in environments that are non-deterministic, and possibly hazardous, it is extremely important that the systems be dependable, namely the deadlines of tasks must be met even in the presence of particular failures. In order to enhance the dependability of a real-time system, we study the problem of scheduling a set of real-time tasks to meet their deadlines in the presence of processor failures. We first prove that the problem of scheduling a set of non-preemptive tasks on more than two processors to tolerate one arbitrary processor failure is NP-complete even when the tasks share a common deadline. Heuristic algorithms are then proposed to solve this problem. The schedules generated by the heuristic algorithms can tolerate one arbitrary processor failure in the worst case. The analysis and experimental data show that the performance of the algorithms is near-optimal.

Page Thumbnails

  • Thumbnail: Page 
[629]
    [629]
  • Thumbnail: Page 
630
    630
  • Thumbnail: Page 
631
    631
  • Thumbnail: Page 
632
    632
  • Thumbnail: Page 
633
    633
  • Thumbnail: Page 
634
    634
  • Thumbnail: Page 
635
    635
  • Thumbnail: Page 
636
    636
  • Thumbnail: Page 
637
    637
  • Thumbnail: Page 
638
    638
  • Thumbnail: Page 
639
    639