Skip to main content
SpringerLink
Log in

Communication efficient parallel searching

  • Systems and Applications
  • Conference paper
  • First Online:
Solving Irregularly Structured Problems in Parallel (IRREGULAR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1253))

Abstract

Searching is one of the most important algorithmic problems, used as a subroutine in many applications. Accordingly, designing search algorithms is in the center of research on data structures since decades. In this paper we aim to survey recent developments in designing parallel search algorithms where parallel machines are used to answer many search queries in parallel, so called multisearch algorithms. We briefly describe the current state of multisearch algorithms based on hashing and binary search, as they are developed for abstract parallel models like the PRAM. The main part of the paper describes deterministic and randomized multisearch algorithms that are very communication efficient. As a computation and cost model we employ Valiant's BSP model and its variant BSP* due to Bäumker et al.

This research was supported by the EC Esprit Long Term Research Project 20244 (ALCOM-IT) and by DFG-Sonderforschungsbereich 376 “Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.M. Adel'son-Velskii and Y.M. Landis, An Algorithm for the organization of information, Soviet Math. Dokl., 3 (1962) 1259–1262.

    Google Scholar 

  2. A. Aggarwal, A.K. Chandra and M. Snir, On communication latency in PRAM computations, in: Proc. ACM Symp. on Parallel Algorithms and Architectures (1989) 11–21.

    Google Scholar 

  3. M.J. Atallah, F. Dehne, R. Miller, A. Rau-Chaplin and J.-J. Tsay, Multisearch techniques for implementing data structures on a mesh-connected computer, in: Proc. ACM Symp. on Parallel Algorithms and Architectures (1991) 204–214.

    Google Scholar 

  4. M.J. Atallah and A. Fabri, On the multisearching problem for hypercubes, in: Parallel Architectures and Languages Europe (1994).

    Google Scholar 

  5. A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model, in: Proc. European Symposium on Algorithms (1995) 17–30.

    Google Scholar 

  6. A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model, Technical Report No. tr-rsfb-96-008, Universität-Gesamthochschule Paderborn (1996), accepted for Theoretical Computer Science.

    Google Scholar 

  7. A. Bäumker, W. Dittrich, A. Pietracaprina, The deterministic complexity of parallel multisearch, in: Proc. 5th SWAT (1996).

    Google Scholar 

  8. A. Bäumker and W. Dittrich, Fully dynamic search trees for an extension of the BSP model, in: Proc. 8th SPAA (1996) 233–242.

    Google Scholar 

  9. A. Bäumker, W. Dittrich, F. Meyer auf der Heide and I. Rieping, Realistic parallel algorithms: Priority queue operations and selection for the BSP* model, in: Proc. of 2nd Euro-Par (1996).

    Google Scholar 

  10. J.L. Carter and M.N. Wegman, Universal classes of hash functions, J. Comput. Syst. Sci., 18 (1979) 143–154.

    Google Scholar 

  11. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Massachusetts, 1990).

    Google Scholar 

  12. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian and T. von Eicken, LogP: Towards a realistic model of parallel computation, in: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (1993).

    Google Scholar 

  13. F. Dehne, A. Fabri and A. Rau-Chaplin, Scalable parallel computational geometry for coarse grained multicomputers, in: Proc. ACM Conference on Comp. Geometry (1993).

    Google Scholar 

  14. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert and R.E. Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds, SIAM J. Comput, Vol. 23, No. 4 (1994) 738–761.

    Google Scholar 

  15. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, in: Proc. 17th ICALP (1990) 6–19. Final version in: J. Buchmann, H. Ganzinger and W.J. Paul, eds., Informatik Festschrift zum 60. Geburtstag von Günter Hotz (Teubner, Stuttgart, 1992) 95–119.

    Google Scholar 

  16. M.L. Fredman, J. Komlós, E. Szemeredi, Storing a sparse table with O(1) worst case time, in: Proc. 23nd. FOCS, (1982), 165–169.

    Google Scholar 

  17. A.V. Gerbessiotis and L. Valiant, Direct Bulk-Synchronous Parallel Algorithms, Journal of Parallel and Distributed Computing (1994).

    Google Scholar 

  18. M.T. Goodrich, Randomized fully-scalable BSP techniques for multi-searching and convex hull construction, in: 8th SODA (1997).

    Google Scholar 

  19. W. Hoeffding, Probability inequalities for sums of bounded random variables, American Statistical Association Journal (1963) 13–30.

    Google Scholar 

  20. J. JáJá, An Introduction to Parallel Algorithms (Addison-Wesley, 1992).

    Google Scholar 

  21. B.H.H. Juurlink, P.S. Rao and J.F. Sibeyn, Worm-hole gossiping on meshes, in: Proc. Euro-Par'96, Lecture Notes in Computer Science, Vol. I (Springer, Berlin, 1996) 361–369.

    Google Scholar 

  22. D.E. Knuth, The Art of computer Programming, Vol. 1: Fundamental Algorithms (Addison-Wesley, 1968).

    Google Scholar 

  23. C.P. Kruskal, L. Rudolph and M. Snir, A complexity theory of efficient parallel algorithms, in: Proc. 15th Int. Coll. on Automata, Languages, and Programming (1988) 333–346.

    Google Scholar 

  24. W.F. McColl, The BSP approach to architecture independent parallel programming, Technical Report, Oxford University Computing Laboratory, 1S94.

    Google Scholar 

  25. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching (Springer, Berlin, 1984).

    Google Scholar 

  26. F. Meyer auf der Heide, C. Scheideier and V. Stemann, Exploiting storage redundancy to speed up randomized shared memory simulations, Theoretical Computer Science 162 (1996) 245–281.

    Google Scholar 

  27. A. Czumaj, F. Meyer auf der Heide and V. Stemann, Shared Memory Simulations with Triple-Logarithmic Delay, in: in: Proc. European Symposium on Algorithms (1995).

    Google Scholar 

  28. W. Paul, U. Vishkin and H. Wagener, Parallel dictionaries on 2–3 trees, in: Proc. of the 10th ICALP (1983) 597–609.

    Google Scholar 

  29. A. Pietracaprina and G. Pucci, Tight bounds on deterministic PRAM emulations with constant redundancy, in: Proc. 2nd European Symposium on algorithms (1994) 319–400.

    Google Scholar 

  30. Abhiram Ranade, Maintaining dynamic ordered sets on processor networks, in: Proc. 4th ACM Symp. on Parallel Algorithms and Architectures (1992) 127–137.

    Google Scholar 

  31. J.H. Reif and S. Sen, Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications, SIAM J. Comput., Vol. 23, No. 3 (1994) 633–651.

    Google Scholar 

  32. R. Tamassia and J.S. Vitter, Optimal cooperative search in fractional cascaded data structures, in: Proc. ACM Symp. Computational Geometry (1990) 307–315.

    Google Scholar 

  33. L. Valiant, A Bridging Model for parallel Computation, Communications of the-ACM, Vol. 33, No. 8 (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany

    Armin Bäumker & Friedhelm Meyer auf der Heide

Authors
  1. Armin Bäumker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gianfranco Bilardi Afonso Ferreira Reinhard Lüling José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bäumker, A., auf der Heide, F.M. (1997). Communication efficient parallel searching. 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_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-63138-0_21

  • 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

Publish with us

Policies and ethics

Search

Navigation