Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Computer Networks and ISDN Systems
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Fine grain concurrent computations
Fine grain concurrent computations
Load balancing and fault tolerance in applicative systems
Load balancing and fault tolerance in applicative systems
Performance prediction of distributed load balancing on multicomputer systems
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Unstructured tree search on SIMD parallel computers: a summary of results
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Scalable scheduling on a network of workstations
ACM SIGOPS Operating Systems Review
Topology preserving dynamic load balancing for parallel molecular simulations
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Unstructured Tree Search on SIMD Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Dual and multiple token based approaches for load balancing
Journal of Systems Architecture: the EUROMICRO Journal
A physical particle and plane framework for load balancing in multiprocessors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Periodic hierarchical load balancing for large supercomputers
International Journal of High Performance Computing Applications
A hybrid policy for fault tolerant load balancing in grid computing environments
Journal of Network and Computer Applications
A-FAST: autonomous flow approach to scheduling tasks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Dynamic distributed scheduling algorithm for state space search
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
One of the challenges in programming distributed memory parallel machines is deciding how to allocate work to processors. This problem is particularly acute for computations with unpredictable dynamic behavior or irregular structure. We present a scheme for dynamic scheduling of medium-grained processes that is useful in this context. The Adaptive Contracting Within Neighborhood (ACWN), is a dynamic, distributed, self-adaptive, and scalable scheme. The basic scheme and its adaptive extensions are described, and contrasted with other schemes that have been proposed in this context. The performance of all the three schemes on an iPSC/2 hypercube is presented and analyzed. The experimental results show that ACWN algorithm achieves better performance in most cases than randomized allocation. Its agility in spreading the work helps it outperform the gradient model in performance and scalability.