Abstract
Parallel list ranking is a hard problem due to its extreme degree of irregularity. Also because of its linear sequential complexity, it requires considerable effort to just reach speed-up one (break even). In this paper, we address the question of how to solve the list-ranking problem for lists of length up to 2·108 in practice: we consider implementations on the Intel Paragon, whose PUs are laid-out as a grid.
It turns out that pointer jumping, independent-set removal and sparse ruling sets, all have practical importance for current systems. For the sparse-ruling-set algorithm the speed-up strongly increases with the number k of nodes per PU, to finally reach 27 with 100 PUs, for k=2·106.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R.J., G.L. Miller, ‘Deterministic Par. List Ranking,’ Algorithmica, 6, pp. 859–868, 1991.
Atallah, M.J., S.E. Hambrusch, ‘Solving Tree Problems on a Mesh-Connected Processor Array,’ Information and Control, 69, pp. 168–187, 1986.
Cole, R., U. Vishkin, ‘Deterministic Coin Tossing and Accelerated Cascades: Micro and Macro Techniques for Designing Parallel Algorithms,’ Proc. 18th Symp. on Theory of Computing, pp. 206–219, ACM, 1986.
Gibbons, A.M., Y.N. Srikant, ‘A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation,’ IPL, 32, pp. 305–311, 1989.
Hagerup, T., C. Rüb, ‘A Guided Tour of Chemoff Bounds,’ IPL, 33, 305–308, 1990.
JáJá, J., An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company. Inc., 1992.
Juurlink, B., P.S. Rao, J.F. Sibeyn, ‘Gossiping on Meshes and Tori,’ Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 361–369, Springer-Verlag, 1996.
McCalpin, J.D., ‘Memory Bandwidth and Machine Balance in Current High Performance Computers,’ IEEE Technical Committee on Computer Architecture Newsletter, pp. 19–25, 12-1995.
Reid-Miller, M., ‘List Ranking and List Scan on the Cray C-90,’ Proc. 6th Symposium on Parallel Algorithms and Architectures, pp. 104–113, ACM, 1994.
Reid-Miller, M., G.L. Miller, F. Modugno, ‘List-Ranking and Parallel Tree Contraction,’ in Synthesis of Parallel Algorithms, J. Reif (ed), pp. 115–194, Morgan Kaufmann, 1993.
Ryu, K.W., J. JáJá, ‘Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube,’ IEEE Trans. on Parallel and Distributed Systems, Vol. 1, No. 1, pp. 83–90, 1990.
Sibeyn, J.F., ‘List Ranking on Interconnection Networks,’ Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 799–808, Springer-Verlag, 1996. Full version in Technical Report 11/1995, SFB 124-D6, Universität Saarbrücken, Saarbrücken, Germany, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sibeyn, J.F., Guillaume, F., Seidel, T. (1997). Practical parallel list ranking. In: Bilardi, G., Ferreira, A., Lüling, R., Rolim, J. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1997. Lecture Notes in Computer Science, vol 1253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_3
Download citation
DOI: https://doi.org/10.1007/3-540-63138-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63138-5
Online ISBN: 978-3-540-69157-0
eBook Packages: Springer Book Archive