Reliability and scheduling on systems subject to failures

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2007, Pages 38-

  Hakem, Mourad ^a   Butelle, Franck ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

Clustering; DAGs; Directed acyclic graphs; Distributed computing; Heterogeneous systems; Multicriteria scheduling; Precedence task graphs; Reliability; Scheduling

Indexed keywords

DIRECTED GRAPHS; DISTRIBUTED COMPUTER SYSTEMS; RELIABILITY;

CLUSTERING; DAGS; DIRECTED ACYCLIC GRAPH (DAG); HETEROGENEOUS SYSTEMS; MULTI CRITERIA SCHEDULING; TASK GRAPH;

SCHEDULING;

EID: 47249137011     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2007.72     Document Type: Conference Paper

References (17)

1. I. Assayad, A. Girault, and H. Kalla. A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints. In Proc. of the International Conference on Dependable Systems and Networks (DSN'04), pages 347-356, 2004.
2. A. Dogan and F. Ozguner. Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(03):308-323, 2002.
3. A. Gerasoulis and T. Yang. Dsc: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951-967, 1994.
4. M. Hakem and F. Butelle. Efficient critical task scheduling parallel programs on a bounded number of processors. In Actapress, editor, Proc. of the 17th International Conference on Parallel and Distributed Computing and Systems. (PDCS'05 - IASTED), pages 139-144, 2005.
5. M. Hakem and F. Butelle. Critical path scheduling parallel programs on unbounded number of processors. International Journal of Foundations of Computer Science, 17(2):287-301, 2006.
6. C.-J. Hou and K. G. Shin. Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. IEEE Transactions on Parallel and Distributed Systems, 46(12):1338-1356, 1997.
7. J.-J. Hwang, Y.-C. Chow, F. D. Anger, and C.-Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing, 18(2):244-257, 1989.
8. S. S. N. K. Jha. Safety and reliability driven task allocation in distributed systems. IEE Trans. on Parallel and Dist. Syst., 10(03):238-251, 1999.
9. Y.-K. Kwok and I. Ahmad. Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures. In Proc. 7th IEEE Symp. on Parallel and Distr. Processing, pages 36-43, 1995.
10. Y.-K. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 7(5):506-521, 1996.
11. S. K. C. S. R. Murthy. Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Trans. on Computers, 41(06):719-724, 1997.
12. X. Qin and H. Jiang. A dynamic and reliability driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters. Journal of Parallel and Distributed Computing, 65(08):885-900, 2005.
13. V. Sarkar. Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, 1989.
14. G. Sih and E. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. on Parallel and Dist. Systems, 4(2):75-87, 1993.
15. J. P. W. Sol M. Shatz and M. Goto. Task allocation for maximizing reliability of distributed computer systems. IEEE Trans. on Computers, 41(09):1156-1168, 1992.
16. Y. Sorel. Massively parallel computing systems with real-time constraints: the "algorithm architecture adequation". In Proc. of Massively Parallel Comput. Syst., MPCS, 1994.
17. M. Y. Wu and D. Gajski. Hypertool: Aprogramming aid for message-passing systems. IEEE Trans. on Parallel and Dist. Syst., 1(3):330-343, 1990.