Abstract
We present a simple and elegant model of computation particularly well-suited to irregularly structured applications in which it is difficult to map the algorithms and data onto a parallel architecture. Unlike other parallel processing paradigms, there is no need to map the application onto the parallel architecture. Nevertheless, an efficient implementation, the Intersecting Broadcast Machine, exists for this model of computation in which the data are mapped entirely at random onto the array of processors. Simulation results for this architecture for a parallel term-matching algorithm indicate high processor and bus utilizations and excellent load balancing characteristics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Das, L. E. Moser and P. M. Melliar-Smith, “A parallel sorting algorithm for a novel model of computation,” International Journal of Parallel Programming, vol. 20, no. 5, October 1991, pp. 403–419.
P. M. Melliar-Smith, L. E. Moser, A. Das and C. Ye, “The Intersecting Broadcast Machine: A regular architecture for irregular applications,” Journal of Computer and Software Engineering, vol. 2, no. 4, December 1994, pp. 349–376.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, A., Moser, L.E., Melliar-Smith, P.M. (1995). A parallel processing paradigm for irregular applications. In: Ferreira, A., Rolim, J. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1995. Lecture Notes in Computer Science, vol 980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60321-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-60321-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60321-4
Online ISBN: 978-3-540-44915-7
eBook Packages: Springer Book Archive