Task Scheduling on the PASM Parallel Processing System

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.

[1]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[2]  Howard Jay Siegel,et al.  Distributed operating system for PASM , 1984 .

[3]  David Lee Tuomenoksa.  Design of the operating system for the pasm parallel processing system , 1983 .

[4]  Tse-Yun Feng.  Data Manipulating Functions in Parallel Processors and Their Implementations , 1974, IEEE Transactions on Computers.

[5]  Howard Jay Siegel,et al.  The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems , 1982, IEEE Transactions on Computers.

[6]  Gary J. Nutt.  A Parallel Processor Operating System Comparison , 1977, IEEE Transactions on Software Engineering.

[7]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[8]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[9]  Robert J. McMillen,et al.  Routing Schemes for the Augmented Data Manipulator Network in an MIMD System , 1982, IEEE Transactions on Computers.

[10]  Howard Jay Siegel,et al.  Parallel algorithm for contour extraction: advantages and architectural implications , 1983 .

[11]  Howard Jay Siegel,et al.  Task Preloading Schemes for Reconfigurable Parallel Processing Systems , 1984, IEEE Transactions on Computers.

[12]  A. Retrospective,et al.  The UNIX Time-sharing System , 1977 .

[13]  Kai Hwang,et al.  Resource Optimization of a Parallel Computer for Multiple Vector Processing , 1980, IEEE Transactions on Computers.

[14]  Mohamed G. Gouda,et al.  MULTIPLE PROCESSOR SCHEDULING POLICIES. , 1979 .

[15]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[16]  Richard M. Brown,et al.  The ILLIAC IV Computer , 1968, IEEE Transactions on Computers.

[17]  Salvatore J. Stolfo,et al.  DADO: A Parallel Processor for Expert Systems , 1984 .

[18]  F. de P. Hanika,et al.  Introduction to Operating System Design , 1976 .

[19]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[20]  M. Malik,et al.  Operating Systems , 1992, Lecture Notes in Computer Science.

[21]  G. Jack Lipovski,et al.  An overview of the Texas reconfigurable array computer , 1899, AFIPS '80.

[22]  Howard Jay Siegel,et al.  PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.

[23]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[24]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[25]  Cauligi S. Raghavendra,et al.  The Gamma network: A multiprocessor interconnection network with redundant paths , 1982, ISCA.

[26]  Gary J. Nut.  Microprocessor Implementation of a Parallel Processor , 1977, ISCA.