Abstract
The implementation of data structures on distributed memory models, like the Bulk-Synchronous Parallel (BSP), rather than shared memory ones, like the PRAM, offers a serious challenge. In this paper we undertake the architecture independent study of the communication and synchronization requirements of searching “ordered h-level graphs”, which include most of the standard data structures. We propose n-way search as a general tool for the design, analysis, and implementation of BSP algorithms. This technique allows elegant high-level design and analysis of algorithms, using data structures similar to that of sequential models. Our methods are within a 1 + o(1) factor of the respective sequential methods. An application to computational geometry is also presented.
The work of the first author was supported in part by EPSRC(UK) under grant GR/K16999, and the second author was supported in part by a Bodossaki Foundation Graduate Scholarship.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Baumker, W. Dittrich, and F. Meyer auf der Heide. Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model. Annual European Symposium on Algorithms, 1995.
F. Dehne and A. Rau-Chaplin. Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry. Journal of Parallel and Distributed Computing, 8:367–375, 1990.
A. V. Gerbessiotis and L. G. Valiant. Direct bulk synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251–267, 1994.
A. V. Gerbessiotis and C. J. Siniolakis. Communication Efficient Data Structures on the BSP model with Applications. Technical Report, Computing Laboratory, Oxford University, May 1996.
W. F. McColl. General purpose parallel computing. In Lectures on parallel computation, (Gibbons, A. and Spyrakis, P., eds.), Cambridge University Press, 1993.
L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gerbessiotis, A.V., Siniolakis, C.J. (1996). Communication efficient data structures on the BSP model with applications in computational geometry. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024722
Download citation
DOI: https://doi.org/10.1007/BFb0024722
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive