Scheduling Strategy of Subtask Decomposed

The scheduling strategy of subtask decomposed (sub- DC) is presented in this article, which includes two parts. The first part is layered transaction of DAG (directed acyclic graph), which all subtasks are divided into different layers according to precedence relation; The second part is task assignation, in the first, min-min scheduling strategy is used to assign subtasks of one layer to each computer of system; after subtasks of one layer are assigned, load balancing strategy is used to dynamically adjusted system load, which makes use of character of subtasks decomposed and makes one layer subtasks are assigned better reason; then layer-by-layer subtasks are assigned using the same method. The Sub-DC not only makes subtasks of each layer be executed as quickly as possible, but also makes the application be executed in shorter time. The implement result shows that the Sub-DC is better than the level-by-level scheduling strategy (sub-Lev).

[1]  Füsun Özgüner,et al.  Dynamic, competitive scheduling of multiple DAGs in a distributed heterogeneous environment , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[2]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[3]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

[4]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[5]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[6]  Anthony A. Maciejewski,et al.  Static mapping of subtasks in a heterogeneous ad hoc grid environment , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[7]  Viktor K. Prasanna,et al.  A unified resource scheduling framework for heterogeneous computing environments , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[8]  Rizos Sakellariou,et al.  A hybrid heuristic for DAG scheduling on heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[9]  John D. Evans,et al.  A communication-ordered task graph allocation algorithm , 1992 .

[10]  Dharma P. Agrawal,et al.  S3MP: a task duplication based scalable scheduling algorithm for symmetric multiprocessors , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[11]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[12]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[13]  Rizos Sakellariou,et al.  An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm , 2003, Euro-Par.

[14]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[15]  Horst Reiner,et al.  Introduction to Global Optimization. Second Edition , 2000 .