A dynamic scheduling strategy for the Chare-Kernel system
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
A scalable loading balancing system for NOWs
ACM SIGOPS Operating Systems Review
The “worm” programs—early experience with a distributed computation
Communications of the ACM
Adaptive Parallelism and Piranha
Computer
ICHU model for processor allocation in distributed operating systems
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
This paper presents an adaptive scalable scheduling model ASCS based on NOWs, which provides a dynamic load sharing facility by allowing tasks to scale up to utilize desired excess computing capacity depending upon available workstations on a NOW, and also scale down to maintain workstation autonomy. In this paper, a hierarchical scheduling policy is described: the inter-cluster scheduling provides a simple, fast and less-overhead load sharing among clusters in the system; and the intra-cluster scheduling provides a high performance scheduling in a cluster, and an adaptive coscheduling is implemented, some scalable algorithms are introduced to schedule those parallel/distributed applications to adapt to system changes. The simulation results show that the ASCS Model has better performance with less overhead, and it can well adapt to different system structures, and also well adapt to large scale systems.