Communications of the ACM
Journal of Parallel and Distributed Computing - Special issue on heterogeneous processing
Dynamic scheduling on parallel machines
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Communications of the ACM
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Evaluation of Job-Scheduling Strategies for Grid Computing
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Scheduling a Metacomputer with Uncooperative Sub-schedulers
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
The NRW-Metacomputer-Building Blocks for A Worldwide Computational Grid
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
On Advantages of Grid Computing for Parallel Job Scheduling
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Job Scheduling for Grid Computing on Metacomputers
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05
A game-theoretic method of fair resource allocation for cloud computing services
The Journal of Supercomputing
RR based grid scheduling algorithm
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Integrating trust into grid economic model scheduling algorithm
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
A family of heuristics for agent-based elastic Cloud bag-of-tasks concurrent scheduling
Future Generation Computer Systems
TLA: Temporal look-ahead processor allocation method for heterogeneous multi-cluster systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Scheduling is a fundamental issue in achieving high performance on metacomputers and computational grids. For the first time, the job scheduling problem for grid computing on metacomputers is studied as a combinatorial optimization problem. A cost model is proposed for modeling communication heterogeneity on computational grids. A processor allocation algorithm is developed which always finds an optimal processor allocation that minimizes the effective execution time of a job when the job is being scheduled. It is proven that the list scheduling (LS) algorithm can achieve reasonable worst-case performance bound in grid environments supporting distributed supercomputing with large applications. We compare the performance of various job scheduling and processor allocation algorithms for grid computing on metacomputers. We evaluate the performance of 128 combinations of two job scheduling algorithms, four initial job ordering strategies, four processor allocation algorithms, and four metacomputers by extensive simulation. It is found that the combination of largest job first (LJF) initial job ordering and minimum effective execution time (MEET) or largest machine first (LMF) processor allocation algorithm yields the best average-case performance, and the choice of FCFS and LS depends on the range of job sizes. It is also observed that communication heterogeneity does have significant impact on schedule lengths.