Abstract
Finding a vast array of applications, the list ranking problem has emerged as one of the fundamental techniques in parallel algorithm design. Surprisingly, the best previously-known algorithm to rank a list of n items on a reconfigurable mesh of size n × n was running in O(log n) time. It was open for more than eight years to obtain a faster algorithm for this important problem.
Our main contribution is to provide the first breakthrough: we propose a deterministic list-ranking algorithm that runs in O(log* n) time as well as a randomized one running in O(1) expected time, both on a reconfigurable mesh of size n × n. Our results open the door to an entire slew of efficient list-ranking-based algorithms on reconfigurable meshes.
Work supported in part by NSF grant CCR-9522093, by ONR grant N00014-95-1-0779, and by Grant-in-Aid for Encouragement of Young Scientists (08780265) from Ministry of Education, Science, Sports, and Culture of Japan
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. J. Anderson and G. L. Miller, A simple randomized algorithm for list-ranking, Information Processing Letters, 33, (1990), 269–273.
R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, 70, (1986), 32–53.
J. JáJá, An introduction to parallel algorithms, Addison-Wesley, Reading, Massachusetts, 1991.
H. Li and M. Maresca, Polymorphic-torus network, IEEE Transactions on Computers, 38, (1989), 1345–1351.
R. Miller, V. K. P. Kumar, D. Reisis, and Q. F. Stout, Parallel computations on reconfigurable meshes, IEEE Transactions on Computers, 42, (1993), 678–692.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
K. Nakano, A bibliography of published papers on dynamically reconfigurable architectures, Parallel Processing Letters, 5, (1995), 111–124.
K. Nakano and K. Wada, Integer summing algorithms on reconfigurable meshes, Proc. First IEEE International Conference on Algorithms And Architectures for Parallel Processing, vol. 1, 187–196, 1995.
S. Olariu, J. L. Schwing, and J. Zhang, Fundamental algorithms on reconfigurable meshes, Proc. 29-th Annual Allerton Conf. on Communication, Control, and Computing, 1991, 811–820.
S. Olariu, J. L. Schwing, and J. Zhang, Integer problems on reconfigurable meshes, with applications, Journal of Computer and Software Engineering, 1, (1993), 33–46.
R. E. Tarjan and U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, SIAM Journal of Computing, 14, (1985) 862–874.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hayashi, T., Nakano, K., Olariu, S. (1996). Efficient list ranking on the reconfigurable mesh, with applications. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009509
Download citation
DOI: https://doi.org/10.1007/BFb0009509
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive