Abstract
The problem of the parallel linear search is a nice little paradigm that was first communicated to us in the mid 1980s by Ernst-Rüdiger Olderog. The problem can be used to illustrate a variety of phenomena that come with parallelism, and in this capacity it is one of the running examples in [AO91]. In [Kna92] we can find a first formal derivation of the algorithm, a derivation that is carried out in the UNITY formalism [CM88].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Feijen, W.H.J., van Gasteren, A.J.M. (1999). The Parallel Linear Search. In: On a Method of Multiprogramming. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3126-2_18
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3126-2_18
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3179-5
Online ISBN: 978-1-4757-3126-2
eBook Packages: Springer Book Archive