Abstract
The assignment problems discussed so far in this book have involved the placement of the modules of a serial or parallel program on the processors of a multiple computer system. The objective when making these assignments is to minimize some measure of resource usage. Most often the objective is to minimize the total run time of a program by minimizing the sum of execution and interprocessor communication times. The modules of the distributed program could be collections of procedures, possibly individual procedures, or could be data files.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
Bokhari, S.H. (1997). Mapping for Parallel Processing. In: Assignment Problems in Parallel and Distributed Computing. The Kluwer International Series in Engineering and Computer Science, vol 32. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2003-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2003-6_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9195-4
Online ISBN: 978-1-4613-2003-6
eBook Packages: Springer Book Archive