Grid DAG scheduling algorithm based on fuzzy clustering

Ruan Jian Xue Bao/Journal of Software

Volumn 17, Issue 11, 2006, Pages 2277-2288

  Du, Xiao Li ^a,b   Jiang, Chang Jun ^a,b   Xu, Guo Rong ^a,b   Ding, Zhi Jun ^a,b  

^a TONGJI UNIVERSITY   (China)

^b National Engineering and Technology Center of High Performance Computer   (China)

Author keywords

DAG (direct acyclic graph); Fuzzy clustering; Grid; Heterogeneous computing environment; Task scheduling

Indexed keywords

HEURISTIC METHODS; SCHEDULING;

DIRECT ACYCLIC GRAPH (DAG); FUZZY CLUSTERING; GRID; HETEROGENEOUS COMPUTING ENVIRONMENT; SCHEDULING ALGORITHM; TASK SCHEDULING;

ALGORITHMS;

EID: 33845863448     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos172277     Document Type: Article

References (12)

1. Qiao WG, Zeng GS, Hua A, Zhang F. Scheduling and executing heterogeneous task graph in grid computing environment. In: Zhuge Hai, Fox G, eds. Proc. of the 4th Int'l Workshop on Grid and Cooperative Computing (GCC 2005). LNCS 3795, Beijing: Springer-Verlag, 2005. 474-479.
2. Sih GC, Lee EA. A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures. IEEE Trans. on Parallel and Distributed Systems, 1993, 4(2): 75-87.
3. Hou ESH, Ansari N, Ren H. A genetic algorithm for multiprocessor scheduling. IEEE Trans. on Parallel and Distributed Systems, 1994, 5(2): 113-120.
4. Iverson M, Ozguner F, Follen G. Parallelizing existing applications in a distributed heterogeneous environment. In: Proc. of the Heterogeneous Computing Workshop. Santa Barbara: IEEE Computer Society Press, 1995. 93-100.
5. Maheswaran M, Siegel HJ. A dynamic matching and scheduling algorithm for heterogeneous computing systems. In: Antonio JK, ed. Proc. of the Heterogeneous Computing Workshop. Orlando: IEEE Computer Society Press, 1998. 57-69.
6. Kwok YK, Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs onto multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 1996, 7(5): 506-521.
7. Adam TL, Chandy KM, Dickson J. A comparison of list scheduling for parallel processing systems. Communications of the ACM, 1974, 17(12): 685-690.
8. Wu M, Gajski D. Hypertool: A programming aid for message passing systems. IEEE Trans. on Parallel and Distributed Systems, 1990, 1(3): 330-343.
9. Chung YC, Ranka S. Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. In: Werner R, ed. Proc. of the Supercomputing'92. Minneapolis: IEEE Computer Society Press, 1992. 512-521.
10. Ahmad I, Kwok YK. On exploiting task duplication in parallel programs scheduling. IEEE Trans. on Parallel and Distributed Systems, 1998, 9(9): 872-892.
11. Yang T, Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. on Parallel and Distributed Systems, 1994, 5(9): 951-967.
12. Kwok YK, Ahmad I. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 1999, 31(4): 406-471.