Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures
Journal of Parallel and Distributed Computing
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
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
QoS guided min-min heuristic for grid task scheduling
Journal of Computer Science and Technology - Grid computing
Dynamic Scheduling Methods for Computational Grid Environments
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Job scheduling and data replication on data grids
Future Generation Computer Systems
Practical Algorithms for Image Analysis with CD-ROM
Practical Algorithms for Image Analysis with CD-ROM
On the asymptotic complexity of matrix multiplication
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
An ant algorithm for balanced job scheduling in grids
Future Generation Computer Systems
A decentralized model for scheduling independent tasks in Federated Grids
Future Generation Computer Systems
Visual modeler for grid modeling and simulation (GridSim) toolkit
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Flexible service selection with user-specific QoS support in service-oriented architecture
Journal of Network and Computer Applications
| Hi-index | 0.00 |
In the computing grid, task scheduling, in order to discover resources for user's requirements, is important. In general, the task scheduler assigns tasks to a proper resource node for execution, and the resource nodes with better performance would be assigned first. When task loading is heavy and all resource nodes with better performance are assigned, other tasks have to be assigned to the resource nodes with inferior performance. Therefore, if a task is assigned to a resource node without considering the performance factor, the overall execution time will increase obviously. To solve this problem, a task scheduling algorithm that searches for the proper resource for task execution is proposed in this paper. Simulation results show that the proposed algorithm works well in dynamic environments.