Fault tolerant real-time global scheduling on multiprocessors

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 1999, Pages 252-259

  Liberato, F ^a   Lauzac, S ^a   Melhem, R ^a   Mosse D ^a  

^a University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APERIODIC TASK; CRITICAL SYSTEMS; FAULT-TOLERANT; GLOBAL MULTIPROCESSOR SCHEDULING; GLOBAL SCHEDULING; MULTI PROCESSOR SCHEDULING; PERIODIC MODELS; REAL-TIME TASKS;

SCHEDULING;

REAL TIME SYSTEMS;

EID: 19744380849     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.1999.777472     Document Type: Conference Paper

References (19)

1. S. K. Baruah, N. Cohen, C. Plaxton, and D. Varvel. Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica, 15:600-625, 1996. (Pubitemid 126422534)
2. S. K. Baruah, J. E. Gehrke, and G. Plaxton. Fast Scheduling of Periodic Tasks on Multiple Resources. In International Parallel Processing Symposium, pages 280-288, 1995.
3. A. Bertossi, A. Fusiello, and L. Mancini. Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks. In International Parallel Processing Symposium, pages 133-138, 1997.
4. A. Burchard, J. Liebeherr, Y. Oh, and S. H. Son. New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems. IEEE Trans. on Computers, 44(12):1429-1442, 1995.
5. A. Burns, R. Davis, and S. Punnekkat. Feasiblity Analysis of Fault-Tolerant Real-Time Task Sets. In Euromicro Workshop on Real-Time Systems, pages 29-33, 1996.
6. H. Chetto and M. Chetto. An Adaptive Scheduling Algorithm for Fault-Tolerant Real-Time Systems. Software Engineering Journal, pages 93-100, 1991. (Pubitemid 21697865)
7. S. K. Dhall and C. L. Liu. On a Real-Time Scheduling Problem. Operations Research, 26(1):127-140, 1978.
8. S. Ghosh, R. Melhem, D. Mossé, and J. S. Sarma. Fault-Tolerant Rate-Monotonic Scheduling. Journal of Real-Time Systems, 1998.
9. W. A. Horn. Some Simple Scheduling Algorithms. Naval Research Logistics Quarterly, 21:177-185, 1974.
10. B. W. Johnson. Design and Analysis of Fault Tolerant Digital Systems. Addison Wesley Pub. Co., 1989.
11. M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, 1986. (Pubitemid 17463568)
12. S. Lauzac, R. Melhem, and D. Mossé. Comparison of Global and Partitioning Schemes for Scheduling Rate Monotonic Tasks on a Multiprocessor. In Euromicro Workshop on Real-Time Systems, pages 188-195, 1998.
13. J. Y.-T. Leung. A New Algorithm for Scheduling Periodic Real-Time Tasks. Algorithmica, 4:209-219, 1989.
14. J. Y.-T. Leung and J. Whitehead. On The Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks. Performance Evaluation, 2:237-250, 1982. (Pubitemid 13487696)
15. C. L. Liu and J. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20(1):47-61, 1973.
16. Y. Oh and S. Son. Enhancing Fault-Tolerance in Rate-Monotonic Scheduling. The Journal of Real-Time Systems, 7(3):315-329, Nov 1994.
17. M. Pandya and M. Malek. Minimum Achievable Utilization for Fault-tolerant Processing of Periodic Tasks. IEEE Trans. on Computers, 47(10):1102-1112, 1998. (Pubitemid 128737499)
18. S. Ramos-Thuel and J. Strosnider. Scheduling Fault Recovery Operations for Time-Critical Applications. In 4th IFIP Conference on Dependable Computing for Critical Applications, Jan 1995.
19. K. Shin and P. Ramanathan. Real-Time Computing: A New Discipline of Computer Science and Engineering. Proc. IEEE, 82(1):6-24, 1994.