This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1984 (vol. 33 no. 9)
pp. 835-844
A.M. Van Tilborg, Computer and Microelectronics Sciences, Honey-well Systems and Research Center
Decentralized operating systems that control large multicomputers need techniques to schedule competing parallel programs called task forces. Wave scheduling is a probabilistic technique that uses a hierarchical distributed virtual machine to schedule task forces by recursively subdividing and issuing wavefront-like commands to processing elements capable of executing individual tasks. Wave scheduling is highly resistant to processing element failures because it uses many distributed schedulers that dynamically assign scheduling responsibilities among themselves. The scheduling technique is trivially extensible as more processing elements join the host multicomputer. A simple model of scheduling cost is used by every scheduler node to distribute scheduling activity and minimize wasted processing capacity by using perceived workload to vary decentralized scheduling rules. At low to moderate levels of network activity, wave scheduling is only slightly less efficient than a central scheduler in its ability to direct processing elements to accomplish useful work.
Index Terms:
task forces, Decentralized scheduling, distributed operating system, multicomputer, parallel scheduling
Citation:
A.M. Van Tilborg, L.D. Wittie, "Wave Scheduling?Decentralized Scheduling of Task Forces in Multicomputers," IEEE Transactions on Computers, vol. 33, no. 9, pp. 835-844, Sept. 1984, doi:10.1109/TC.1984.1676500
Usage of this product signifies your acceptance of the Terms of Use.