Abstract
In this chapter, we develop algorithms for implementing Seuss programs on multiprocessor architectures in which the processors communicate using messages. The implementation strategy is to partition the boxes over a set of processors and have a scheduler that instructs each processor which action to execute next. The scheduler can be centralized or distributed among the processors. In the next section, we describe the scheduler in abstract terms that permits either type of implementation; specific implementations are described in section 11.5.
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
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Misra, J. (2001). Distributed Implementation. In: A Discipline of Multiprogramming. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8528-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8528-6_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6427-9
Online ISBN: 978-1-4419-8528-6
eBook Packages: Springer Book Archive