A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
The limited performance benefits of migrating active processes for load sharing
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
IEEE Transactions on Software Engineering
A Dynamic Load-Balancing Policy with a Central Job Dispatcher (LBC)
IEEE Transactions on Software Engineering
An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems
IEEE Transactions on Computers
Exploiting process lifetime distributions for dynamic load balancing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Migration impact on load balancing—an experience on Amoeba
ACM SIGOPS Operating Systems Review
The MOSIX multicomputer operating system for high performance cluster computing
Future Generation Computer Systems - Special issue on HPCN '97
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Analysis of nearest neighbor load balancing algorithms for random loads
Parallel Computing
Future Generation Computer Systems - Special issue on metacomputing
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Adaptive Location Policies for Global Scheduling
IEEE Transactions on Software Engineering
Clustering Hosts in P2P and Global Computing Platforms
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Pace--A Toolset for the Performance Prediction of Parallel and Distributed Systems
International Journal of High Performance Computing Applications
A performance study of job management systems: Research Articles
Concurrency and Computation: Practice & Experience - Systems Performance Evaluation
Game-Theoretic Approach for Load Balancing in Computational Grids
IEEE Transactions on Parallel and Distributed Systems
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
An adaptive load balancing management technique for RFID middleware systems
Software—Practice & Experience
Prospects of collaboration between compute providers by means of job interchange
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
An adaptive load balancing algorithm with use of cellular automata for computational grid systems
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Hi-index | 0.00 |
Load balancing has been a key concern for locally distributed multiprocessor systems. The emergence of computational grid extends this problem, such as scalability, heterogeneity of computing resources and considerable communication delay. In this paper, we study the problem of scheduling a large number of CPU-intensive jobs on such systems. The time spent by a job in the system is considered as the main issue that needs to be minimized. The proposed dynamic algorithm of scheduling jobs consists of two policies: Instantaneous Distribution Policy (IDP) and Load Adjustment Policy (LAP). Our algorithm does not address directly the load balancing problem since it is completely unrealistic in such large environments, but we will show that even a non-perfectly load balanced system can behave reasonably well by taking into account the jobs' time demands. The proposed algorithm is evaluated by a series of simulations.