This Article 
 Bibliographic References 
 Add to: 
Task Scheduling on the PASM Parallel Processing System
February 1985 (vol. 11 no. 2)
pp. 145-157
D.L. Tuomenoksa, AT&T Information Systems
PASM is a proposed large-scale distributed/parallel processing system which can be partitioned into independent SIMD/MIMD machines of various sizes. One design problem for systems such as PASM is task scheduling. The use of multiple FIFO queues for nonpreemptive task scheduling is described. Four multiple-queue scheduling algorithms with different placement policies are presented and applied to the PASM parallel processing system. Simulation of a queueing network model is used to compare the performance of the algorithms. Their performance is also considered in the case where there are faulty control units and processors. The multiple-queue scheduling algorithms can be adapted for inclusion in other multiple-SIMD and partitionable SIMD/MIMD systems that use similar types of interconnection networks to those being considered for PASM.
Index Terms:
scheduling, Distributed processing, multimicroprocessor systems, multiple-SIMD systems, parallel processing, partitionable SIMD/MIMD systems, PASM, performance evaluation, reconfigurable computer systems
D.L. Tuomenoksa, H.J. Siegel, "Task Scheduling on the PASM Parallel Processing System," IEEE Transactions on Software Engineering, vol. 11, no. 2, pp. 145-157, Feb. 1985, doi:10.1109/TSE.1985.232189
Usage of this product signifies your acceptance of the Terms of Use.