On process assignment in parallel computing

DOI10.1016/0020-0190(88)90128-7MaRDI QIDQ1115176zbMATH OpenOpenAlexFDO

Authors F. Warren Burton, G. P. McKeown, V. J. Rayward-Smith

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90128-7

zbMATH Keywords

dynamic allocationMIMDparallel programsparallelismprocess assignmentscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Review text

An asynchronous MIMD parallel computer, in which a number of identical processors run independently and communicate by sending messages periodically via a communication network, is a frequently assumed computational model. The authors are interested in parallel programs for running on such machines. The program exhibits a greater or lesser degree of parallelism depending on the sparsity of the partial order on the set of actions generated during a typical execution of the program. It is the purpose of this paper to illustrate that list scheduling, generated to cover the restriction that all the actions comprising a single process should be assigned to the same processor, can lead to a schedule whose length is approximately m times greater than the length of the ordinary list schedule for an m processor system.

Recommendations

• Processor Scheduling for Linearly Connected Parallel Processors
• A Model for Asynchronous Shared Memory Parallel Computation
• scientific article; zbMATH DE number 4058853
• scientific article; zbMATH DE number 719225
• Allocating Independent Subtasks on Parallel Processors

Cited in

(11)

• Processors selection and traffic splitting in a parallel processors system
• Neural computing on a system of parallel organized transputers: Software implementation and hardware configuration
• Reasoning about data-parallel array assignment
• Parallel processes with implicit computational capital
• A dispatching algorithm for parallel machines with rework processes
• Parallel partitioning for distributed systems using sequential assignment
• Allocating Independent Subtasks on Parallel Processors
• Processor Scheduling for Linearly Connected Parallel Processors
• Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
• scientific article; zbMATH DE number 515940 (Why is no real title available?)
• scientific article; zbMATH DE number 2087775 (Why is no real title available?)

This page was built for publication: On process assignment in parallel computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115176)