Features
- Cover Type: Paperback with 160 pages
- Published by: The MIT Press March 20, 1989
- Written in: English
- ISBN 10 Number: 0262691302
- ISBN 13 Number: 978-0262691307
-
Book Dimensions:
9.5 x 6.5 x 0.5 inches
- Weighs: 1 pounds
Product Description
This book is one of the first to address the problem of forming useful parallelism from potential parallelism and to provide a general solution.
The book presents two approaches to automatic partitioning and scheduling so that the same parallel program can be made to execute efficiently on widely different multiprocessors. The first approach is based on a macro dataflow model in which the program is partitioned into tasks at compile time and the tasks are scheduled on processors at run time. The second approach is based on a compile time scheduling model, where both the partitioning and scheduling are performed at compile time.
Both approaches have been implemented in partition programs written in the single assignment language SISAL. The inputs to the partitioning and scheduling algorithms are a graphical representation of the parallel program and a list of parameters describing the target multiprocessor. Execution profile information is used to derive compile-time estimates of execution times and data sizes in the program. Both the macro dataflow and compile-time scheduling problems are expressed as optimization problems and are shown to be NP complete in the strong sense. Efficient approximation algorithms for these problems are presented. Finally, the effectiveness of the partitioning and scheduling algorithms is studied by multiprocessor simulations of various SISAL benchmark programs for different target multiprocessor parameters.
Vivek Sarkar is a Member of Research Staff at the IBM T. J. Watson Research Center.
Partitioning and Scheduling Parallel Programs for Multiprocessing is included in the series Research Monographs in Parallel and Distributed Computing. Copublished with Pitman Publishing.
Search for books at
