New approach to fault-tolerant scheduling using task duplication in multiprocessor systems

Journal of Systems and Software

Volumn 53, Issue 2, 2000, Pages 159-171

  Hashimoto, Koji ^a   Tsuchiya, Tatsuhiro ^a   Kikuno, Tohru ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; DATA COMMUNICATION SYSTEMS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

FAULT TOLERANT SCHEDULING; INTERPROCESSOR COMMUNICATION; PARALLEL PROGRAMS; SCHEDULING ALGORITHM; TASK DUPLICATION; TASK GRAPH;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0034248910     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(99)00105-3     Document Type: Article

References (21)

1. Ahmad, I., Kwok, Y.-K., 1994. A new approach to scheduling parallel programs using task duplication. In: Proceedings of International Conference on Parallel Processing. pp. 247-251.
2. Chabridon, S., Gelenbe, E., 1995. Failure detection algorithms for a reliable execution of parallel programs. In: Proceedings of 14th International Symposium on Reliable Distributed Systems. pp. 229-238.
3. Cherkassky V., Chen C.-I.H. Redundant task-allocation in multicomputer systems. IEEE Transactions on Reliability. 41(3):1992;336-342.
4. Chung, Y.C., Ranka, S., 1992. Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors. In: Proceedings of Supercomputing'92. pp. 512-521.
5. Darbha, S., Agrawal, D.P., 1994. A task duplication based optimal scheduling algorithm for variable execution time tasks. In: Proceedings of International Conference on Parallel Processing. pp. 252-256.
6. Darbha S., Agrawal D.P. Optimal scheduling algorithm for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems. 9(1):1998;87-95.
7. DeMeer H., Trivedi K.S., Cin M.D. Guarded repair of dependable systems. Journal of Theoretical Computer Science. 128(1-2):1994;179-210.
8. Ghosh S., Melhem R., Mosse D. fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems. 8(3):1997;272-284.
9. Gong C., Melhem R., Gupta R. Loop transformations for fault detection in regular loops on massively parallel systems. IEEE Transactions on Parallel and Distributed Systems. 7(12):1996;1238-1249.
10. Gu, D., Rosenkrantz, D.J., Ravi, S.S., 1991. Construction and analysis of fault-secure multiprocessor schedules. In: Proceedings of 21th International Symposium on Fault-Tolerant Computing. pp. 120-127.
11. Hashimoto, K., Tsuchiya, T., Kakuda, Y., Kikuno, T., 1996. Realizing fault-tolerant scheduling using replicated tasks in multiprocessor systems. In: Proceedings of International Workshop on Dependability in Advanced Computing Paradigms. pp. 87-92.
12. Hou C.-J., Shin K.G. Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. IEEE Transactions on Computers. 46(12):1997;1338-1355.
13. Kruatrachue, B., 1987. Static task scheduling and grain packing in parallel processing systems, Ph.D. Thesis. Electrical and Computer Engineering Department, Oregon State University, Corvallis.
14. Kruatrachue B., Lewis T. Grain size determination for parallel processing. IEEE Software. 5(1):1988;23-32.
15. Kwok Y.-K., Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems. 7(5):1996;506-521.
16. Lord R.E., Kowalik J.S., Kumar S.P. Solving linear algebraic equations on an MIMD computer. Journal of ACM. 30(1):1983;103-117.
17. Papadimitriou C.H., Yannakakis M. Toward an architecture-independent analysis of parallel algorithms. SIAM Journal of Computing. 19(2):1990;322-328.
18. El-Rewini, H., Lewis, T., Ali, H., 1994. In: Task Scheduling in Parallel and Distributed Systems. Prentice-Hall, Englewood Cliffs, New Jersey.
19. Schlichting R.D., Schneider F.B. fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems. 1(3):1983;222-238.
20. Ullman J. NP-Complete Scheduling Problems. Journal of Computer and System Sciences. 10:1975;384-393.
21. Wu M.Y., Gajski D.D. Hypertool: A programming aid for message passing systems. IEEE Transactions on Parallel and Distributed Systems. 1(3):1990;330-343.