To Schedule or to Execute: Decision Support and PerformanceImplications
Real-Time Systems
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Journal of Parallel and Distributed Computing
SETI@home: an experiment in public-resource computing
Communications of the ACM
A High-Performance Mapping Algorithm for Heterogeneous Computing Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System
ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
Joint congestion control and processor allocation for task scheduling in grid over OBS networks
Expert Systems with Applications: An International Journal
Smart scheduling for saving energy in grid computing
Expert Systems with Applications: An International Journal
A queuing network model for minimizing the total makespan of computational grids
Computers and Electrical Engineering
Evaluating decision-making performance in a grid-computing environment using DEA
Expert Systems with Applications: An International Journal
Energy-efficient deadline scheduling for heterogeneous systems
Journal of Parallel and Distributed Computing
A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids
International Journal of Grid and High Performance Computing
An Adaptable Job Submission System Based on Moderate Price-Adjusting Policy in Market-Based Grids
Wireless Personal Communications: An International Journal
Hi-index | 12.06 |
Most scheduling heuristics applied to Heterogeneous Computing (HC) focus on the search of a minimum makespan, instead of the reduction of cost. However, relevant studies presume that HC is based on high-speed bandwidth and communication time has ignored. Furthermore, in response to the appeal for a user-pay policy, when a user submits a job to a Grid environment for computation each implementation of a job would be charged. Therefore, the Apparent Tardiness Cost Setups-Minimum Completion Time (ATCS-MCT) scheduling heuristic considers both makespan and cost, and it composes of execution time, communication time, weight and deadline factors. This study simulates experiments in a dynamic environment, due to the nature of Grid computing being dynamic. The ATCS-MCT is compared to frequent solutions by five scheduling heuristics. This study indicates that the ATCS-MCT achieves a similarly smaller makespan, and lower cost than Minimum Completion Time (MCT) scheduling heuristic, which is the benchmark of on-line mapping.