Distributed control of computer systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Nearest-neighbor mapping of finite element graphs onto processor meshes
IEEE Transactions on Computers
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Task Allocation Using Processor Load Prediction on Multiprocessors Cluster
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
A Game-Theoretic Model and Algorithm for Load Balancing in Distributed Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A New Approach for Load Balancing Using Differential Load Measurement
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
IEEE Transactions on Parallel and Distributed Systems
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
Noncooperative load balancing in distributed systems
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Load Redistribution Under Failure in Distributed Systems
IEEE Transactions on Computers
Game-Theoretic Approach for Load Balancing in Computational Grids
IEEE Transactions on Parallel and Distributed Systems
Load balancing in processor sharing systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
Price of anarchy in non-cooperative load balancing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cooperative load balancing for a network of heterogeneous computers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Game-theoretic static load balancing for distributed systems
Journal of Parallel and Distributed Computing
Price of anarchy in non-cooperative load balancing games
Performance Evaluation
Tasks mapping with quality of service for coarse grain parallel applications
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Case study: Evaluation of loadsharing algorithms for heterogeneous distributed systems
Computer Communications
| Hi-index | 14.99 |
Queueing models for a simple heterogeneous multiple processor system are presented, analyzed, and compared. Each model is distinguished by a job routing strategy which is designed to reduce the average job turnaround time by balancing the total load among the processors. In each case an arriving job is routed by a job dispatcher to one of m parallel processors. The job routing strategies are divided into two classes: deterministic and nondeterministic. The nondeterministic policies are described by state independent branching probabilities. For the deterministic policies, the next processor is chosen to minimize or maximize the expected value of a performance related criterion function.