A New Strategy for Scheduling a Directed Acyclic Graph in Heterogeneous Parallel Environments


Abstract in English

The work aims to make benefit from existence multi-CPU and multi-GPU, exploiting the calculation processes which do multi-GPU, which aims to form mechanism to scheduling a directed acyclic graph(DAG), it aims to reduce communication between resources and inter linked task scheduling in the best form.

References used

Jiannong Cao, Alvin T. S. Chan, Yudong Sun , Sajal K. Das and Minyi Guo , 2006, A taxonomy of application scheduling tools for high performance cluster computing, Cluster Comput 9:355–371
Fangpeng Dong and Selim G. Akl, 2006, Scheduling Algorithms for Grid Computing: State of the Art and Open Problems, Technical Report No. 2006-504
Jia Yu, Rajkumar Buyya, and Kotagiri Ramamohanarao, 2008, Workflow Scheduling Algorithms for Grid Computing, Metaheuristics for Scheduling in Distributed Computing Environments

Download