Abstract
In this paper we present efficient and practical extensions of the randomized Parallel Priority Queue (PPQ) algorithms of Ranade et al., and efficient randomized and deterministic algorithms for the problem of list contraction on the Bulk-Synchronous Parallel (BSP) model. We also present an experimental study of their performance. We show that our algorithms are communication efficient and achieve small multiplicative constant factors for a wide range of parallel machines.
The first author was supported in part by EPSRC(UK) under grant GR/K16999, the second author was supported in part by a Bodossaki Foundation Graduate Scholarship and the third author was supported in part by ESPRIT Basic Research Project 9072 (GEPPCOM).
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
R. J. Anderson and G. L. Miller. A simple randomized parallel algorithm for list ranking. Information Processing Letters, 33(5):269–273, 1990.
A. Baumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping. Realistic parallel algorithms: Priority queue operations and selection for the BSP model. In Proceedings of Euro-Par'96, LNCS 1124, Springer Verlag, August 1996.
R. Cole and U. Vishkin. Deterministic coin tossing with application to optimal list ranking. Information and Control, 70(1):32–53, 1986.
H. Gazit, G. L. Miller, and Shang-Hua Teng. Optimal tree contraction in an EREW model. In S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz, eds., Concurrent Computations: Algorithms, Architecture and Technology, pp. 139–156, 1988.
A. V. Gerbessiotis and C. J. Siniolakis. Concurrent heaps on the BSP model. Tech. Report PRG-TR-1496, Comp. Laboratory, Oxford University, June 1996.
A. V. Gerbessiotis and C. J. Siniolakis. Selection on the bulk-synchronous parallel model with applications to priority queues. In Proc. of the 1996 Int'l Conf. on Parallel and Distrib. Proc. Techniques and Applications, USA, August 9–11, 1996.
A. V. Gerbessiotis and C. J. Siniolakis. Primitive operations on the BSP model. Tech. Report PRG-TR-23-96, Comp. Laboratory, Oxford University, October 1996.
J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
R. M. Karp and Y. Zhang. Parallel algorithms for backtrack search and-branch and bound. Journal of the ACM, 40(3):765–789, 1993.
C. E. Leiserson and B. M. Maggs. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica, 3:53–77, 1988.
W. F. McColl, 1996. Private communication.
C. J. H. McDiarmid. On the method of bounded differences. Surveys in Combinatorics, (J. Siemons, ed.), Volume 141, pp. 148–188, CUP 1989.
G. L. Miller and J. F. Reif. Parallel tree contraction and its applications. In 26th IEEE FOCS, pages 478–489, October 1985.
M. Reid-Miller. List ranking and list scan on the Cray C-90. In Sixth Annual Symposium on Parallel Algorithms and Architectures, pages 104–113, 1994.
M. Reid-Miller, G. L. Miller, and F. Modugno. List ranking and parallel tree contraction. In J. H. Reif, ed., Synthesis of Parallel Algorithms, chapter 3, pages 115–194. Morgan Kaufmann, 1993. 16. R. Motwani and P. Raghavan. Randomized Algorithms. CUP, 1996.
M. C. Pinotti and G. Pucci. Parallel priority queues. IPL, 40:33–40, 1990.
A. Ranade, S. Cheng, E. Deprit; J. Jones, and S. Shih. Parallelism and locality in priority queues. In Proceedings of the 6-th IEEE SPDP, pp. 97–103. 1994.
R. E. Tarjan. Data structures and network algorithms. SIAM, 1983.
L. G. Valiant. A bridging model for parallel computation. CACM, 33:103–111,1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gerbessiotis, A.V., Siniolakis, C.J., Tiskin, A. (1997). Parallel priority Queue and list contraction: The BSP approach. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002764
Download citation
DOI: https://doi.org/10.1007/BFb0002764
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive