Abstract
A subset I of {1,…,n} may be represented either as a bit vector of length n or as a linked list of length |I|. We investigate the parallel complexity of converting subsets of size at most k from the bit vector representation to the representation as linked lists. This has applications to the rapid retrieval of small sets of data scattered over large tables. We show that if k is small, a significant speedup is possible relative to algorithms that do not adapt to the value of k.
Supported by the Deutsche Forschungsgemeinschaft, SFB 124, TP B2, VLSI Entwurfsmethoden und Parallelität.
Preview
Unable to display preview. Download preview PDF.
References
H. Alt, T. Hagerup, K. Mehlhorn and F. P. Preparata, Deterministic simulation of idealized parallel computers on more realistic ones, SIAM J. Comput. 16 (1987), 808–835.
R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Preprint, 1987.
S. Cook, C. Dwork and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15 (1986), 87–97.
D. Eppstein and Z. Galil, Parallel algorithmic techniques for combinatorial computation, Ann. Rev. Comput. Sci. 3 (1988), 233–283.
T. Hagerup, Towards optimal parallel bucket sorting, Inform. and Comput. 75 (1987), 39–51.
I. Parberry, Parallel Complexity Theory, Pitman, London, 1987.
P. G. Spirakis, Optimal parallel randomized algorithms for sparse addition and identification, Inform. and Comput. 76 (1988), 1–12.
C. Stanfill and B. Kahle, Parallel free-text search on the connection machine system, Comm. Assoc. Comput. Mach. 29 (1986), 1229–1239.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagerup, T., Nowak, M. (1989). Parallel retrieval of scattered information. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035775
Download citation
DOI: https://doi.org/10.1007/BFb0035775
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive