Real-time task replication for fault tolerance in identical multiprocessor systems

Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

Volumn , Issue , 2007, Pages 249-258

  Chen, Jian Jia ^a,c   Yang, Chuan Yue ^a   Kuo, Tei Wei ^a   Tseng, Shau Yin ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INDUSTRIAL TECHNOLOGY RESEARCH INSTITUTE   (Taiwan)

^c FISHERIES RESEARCH INSTITUTE   (Taiwan)

Author keywords

Fault tolerance; Multiprocessor systems; Real time task scheduling; Task replication

Indexed keywords

FAULT TOLERANCE; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; REAL TIME SYSTEMS; SCHEDULING ALGORITHMS; SERVERS;

REAL-TIME TASK SCHEDULING; SERVER SYSTEMS; TASK REPLICATION; USER-DETERMINED INTEGERS;

INTERCONNECTION NETWORKS;

EID: 34548140083     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2007.30     Document Type: Conference Paper

References (24)

1. B. Andersson and J. Jonsson. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In ECRTS, pages 33-40. IEEE Computer Society, 2003.
2. H. Aydin. On fault-sensitive feasibility analysis of real-time task sets. In RTSS, pages 426 434. IEEE Computer Society, 2004.
3. T. P. Baker. Multiprocessor edf and deadline monotonie schedulability analysis. In RTSS, pages 120-129. IEEE Computer Society, 2003.
4. S. K. Baruah. Partitioning real-time tasks among heterogeneous multiprocessors. In ICPP, pages 467-474. IEEE Computer Society, 2004.
5. S. K. Baruah. Task partitioning upon heterogeneous multiprocessor platforms. In IEEE Real-Time and Embedded Technology and Applications Symposium, pages 536-543. IEEE Computer Society, 2004.
6. A. A. Bertossi, L. V. Mancini, and F. Rossini. Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems. IEEE Trans. Parallel Distrib. Syst., 10(9):934-945, 1999.
7. P. Chevochot and I. Puaut. An approach for fault-tolerance in hard real-time distributed systems. In Symposium on Reliable Distributed Systems, pages 292-293, 1999.
8. P. Chevochot and I. Puaut. Scheduling fault-tolerant distributed hard real-time tasks independently of the replication strategies. In RTCSA, pages 356 363. IEEE Computer Society, 1999.
9. W. F. de la Vega and G. S. Lueker. Bin packing can be solved within 1+epsilon in linear time. Combinatorica, 1(4):349355, 1981.
10. S. Funk and S. K. Baruah. Task assignment on uniform heterogeneous multiprocessors. In ECRTS, pages 219-226. IEEE Computer Society, 2005.
11. T. F. Gonzalez, O. H. Ibarra, and S. Sahni. Bounds for lpt schedules on uniform processors. SIAM J. Comput., 6(1):155-166, 1977.
12. S. Gopalakrishnan and M. Caccamo. Task partitioning with replication upon heterogeneous multiprocessor systems. In Proceedings of the 12th IEEE Real-time and Embedded Technology and Applications Symposium (RTAS'06), pages 199-207, 2006.
13. R. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17:263-269, 1969.
14. D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput., 17(3):539-551, 1988.
15. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM, 23(2):317-327, 1976.
16. N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In FOCS, pages 312-320, 1982.
17. J. K. Lenstra, D. B. Shmoys, and. É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Program., 46:259-271, 1990.
18. F. Liberato, S. Lauzac, R. Melhem, and D. Mosse. Fault tolerant real-time global scheduling on multiprocessors. In Proceedings of Euromicro Conference on Real-Time Systems, pages 252-259, 1999.
19. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973.
20. J. W. Liu. Real-Time Systems. Prentice Hall, Englewood, Cliffs, NJ., 2000.
21. R. Lyions and W. Vanderkulk. The use of triple modular redundancy to improve computer reliability. IBM Journal of Research, 6(2):200-209, 1962.
22. D.-I. Oh and T. P. Baker. Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-Time Systems, 15(2):183-192, 1998.
23. X. Qin, H. Jiang, and D. R. Swanson. An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems. In ICPP, pages 360-. IEEE Computer Society, 2002.
24. V. V. Vazirani. Approximation Algorithms. Springer, 2001.