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
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Dynamic Scheduling Methods for Computational Grid Environments
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
A Fast Evolutionary Algorithm for Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
Balanced Job Assignment Based on Ant Algorithm for Computing Grids
APSCC '07 Proceedings of the The 2nd IEEE Asia-Pacific Service Computing Conference
Towards a general model of the multi-criteria workflow scheduling on the grid
Future Generation Computer Systems
Deadline division-based heuristic for cost optimization in workflow scheduling
Information Sciences: an International Journal
Communications of the ACM
PIVOT: An adaptive information discovery framework for computational grids
Information Sciences: an International Journal
Cloud Computing Principles and Paradigms
Cloud Computing Principles and Paradigms
Operating System Concepts
Information Sciences: an International Journal
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Future Generation Computer Systems
Scalable service-oriented replication with flexible consistency guarantee in the cloud
Information Sciences: an International Journal
Hi-index | 0.07 |
When human culture advances, current problems in science and engineering become more complicated and need more computing power to tackle and analyze. A supercomputer is not the only choice for solving complex problems any more as a result of the speed-up of personal computers and networks. Grid technology, which connects a number of personal computer clusters with high speed networks, can achieve the same computing power as a supercomputer does, also with a lower cost. However, grid is a heterogeneous system. Scheduling independent tasks on it is more complicated. In order to utilize the power of grid completely, we need an efficient job scheduling algorithm to assign jobs to resources in a grid. In this paper, we propose an Adaptive Scoring Job Scheduling algorithm (ASJS) for the grid environment. Compared to other methods, it can decrease the completion time of submitted jobs, which may compose of computing-intensive jobs and data-intensive jobs.