Fault-secure scheduling of arbitrary task graphs to multiprocessor systems

Proceedings of the 2002 International Conference on Dependable Systems and Networks

Volumn , Issue , 2000, Pages 203-212

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

^a HITACHI LTD   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY TASK GRAPHS; DISTRIBUTED MEMORY ARCHITECTURE; FAULT-SECURE SCHEDULING;

ALGORITHMS; COMPUTER SIMULATION; COST EFFECTIVENESS; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; RELIABILITY; RESOURCE ALLOCATION;

MULTIPROCESSING SYSTEMS;

EID: 0034590617     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDSN.2000.857536     Document Type: Conference Paper

References (14)

1. P. Banerjee and J. A. Abraham, "Fault-secure algorithms for multiple processor systems," Proc. of 11th Int'l Symp. on Computer Architecture, pp. 270-287, 1984.
2. H. El-Rewini, H. H. Ali, and T. Lewis, "Tast scheduling in multiprocessing systems," IEEE Computer, vol. 28, no. 12, pp. 27-37, 1995.
3. D. Gu, D. J. Rosenkrantz, and S. S. Ravi, "Construction and analysis of fault-secure multiprocessor schedules," Proc. of 21th IEEE Int'l Symp. on Fault-Tolerant Computing, pp. 120-127, 1991.
4. D. Gu, D. J. Rosenkrantz, and S. S. Ravi, "Fault/error models and their impact on reliable multiprocessor schedules," Proc. of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, pp. 176-184, 1992.
5. K. Hashimoto, "Multiprocessor scheduling algorithms for high reliability," PhD dissertation, Dept. of Informatics and Mathematical Science, Osaka University, 2000.
6. K. Hashimoto, T. Tsuchiya, and T. Kikuno, "A multi-processor scheduling algorithm for low overhead fault-tolerance," Proc. of 17th IEEE Int'l Symp. on Reliable Distributed Systems, pp. 186-194, 1998.
7. B. W. Johnson, "Design and Analysis of Fault-Tolerant Digital Systems," Addison-Wesley, 1989.
8. S. Kartik and C. Siva Ram Murthy, "Task allocation algorithms for maximizing reliability of distributed computing systems," IEEE Trans. Computers, vol. 46, no. 6, pp. 719-724, 1997.
9. B. Kruatrachue, "Static task scheduling and grain packing in parallel processing systems," PhD dissertation, Electrical and Computer Eng. Dept., Oregon State Univ., Corvallis, 1987.
10. Y.-K. Kwok and I. Ahmad, "Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 506-521, 1996.
11. R. E. Lord, J. S. Kowalik, and S. P. Kumar, "Solving linear algebraic equations on an MIMD computer," J. ACM, vol. 30, no. 1, pp. 103-117, 1983.
12. K. R. Pattipati, T. Kurien, R.-T. Lee, and P. B. Luh, "On mapping a tracking algorithm onto parallel processors," IEEE Trans. Aerospace and Electronic Systems, vol. 26, no. 5, pp. 774-791, 1990.
13. S. Tridandapani, A. K. Somanti, and U. R. Sandadi, "Low overhead multiprocessor allocation strategies exploiting system spare capacity for fault-detection and location," IEEE Trans. Computers, vol. 44, no. 7, pp. 865-877, 1995.
14. J. Wu, E. B. Fernandez, and D. Dai, "Optimal fault-secure scheduling," Computer Journal, vol. 41, no. 4, pp. 208-222, 1998.