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 Baumker et al. 1
|
6058
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
1497
|
The Art of Computer Programming
– Knuth
- 1973
|
|
994
|
A Bridging Model for Parallel Computation
– Valiant
- 1990
|
|
749
|
Probability inequalities for sums of bounded random variables
– HOEFFDING
- 1963
|
|
490
|
Universal Classes of Hash Functions
– Carter, Wegman
- 1979
|
|
188
|
Direct bulk-synchronous parallel algorithms
– Gerbessiotis, Valiant
- 1994
|
|
141
|
An algorithm for the organization of information
– Adelson-Velskii, Landis
- 1962
|
|
137
|
Data Structures and Algorithms 1: Sorting and Searching
– Mehlhorn
- 1984
|
|
83
|
von Eicken, LogP: towards a realistic model of parallel computation
– Culler, Karp, et al.
- 1993
|
|
79
|
A complexity theory of efficient parallel algorithms
– Kruskal, Rudolph, et al.
- 1990
|
|
77
|
Scalable parallel computational geometry for coarse grained multicomputers
– Dehne, Fabri, et al.
- 1996
|
|
58
|
auf der Heide. Truly efficient parallel algorithms: -optimal multisearch for an extension of the bsp model
– Bäumker, Dittrich, et al.
- 1995
|
|
36
|
Fully dynamic search trees for an extension of the BSP model
– Baumker, Dittrich
- 1996
|
|
35
|
auf der Heide. A new universal class of hash functions and dynamic hashing in real time
– Dietzfelbinger, Meyer
- 1990
|
|
33
|
Exploiting storage redundancy to speed up randomized shared memory simulations
– Heide, Scheideler, et al.
- 1996
|
|
31
|
Parallel dictionaries on 2-3 trees
– Paul, Vishkin, et al.
- 1983
|
|
28
|
Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications
– Reif, Sen
- 1991
|
|
27
|
On Communication Latency
– Aggarwal, Chandra, et al.
- 1989
|
|
20
|
An Introduction to Parallel Algorithms, Addison-Wesley Pub CO
– Jájá
- 1992
|
|
16
|
Multisearch techniques for implementing data structures on a mesh-connected computer
– Atallah, Dehne, et al.
- 1991
|
|
14
|
The BSP Approach to Architecture Independent Parallel Programming", in
– McColl
- 1994
|
|
11
|
Maintaining Dynamic Ordered Sets on Processor Networks
– Ranade
- 1992
|
|
10
|
The Deterministic Complexity of Parallel Multisearch
– Baumker, Dittrich, et al.
- 1996
|
|
8
|
On the multisearch problem for hypercubes
– Atallah, Fabri
- 1994
|
|
8
|
Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction
– Goodrich
- 1997
|
|
7
|
Tight bounds on deterministic PRAM emulations with constant redundancy
– Pietracaprina, Pucci
- 1994
|
|
7
|
Optimal cooperative search in fractional cascaded data structures
– Tamassia, Vitter
- 1990
|
|
6
|
Worm-Hole Gossiping on Meshes
– Juurlink, Rao, et al.
- 1996
|
|
4
|
auf der Heide and I. Rieping. Realistic parallel algorithms: Priority queue pperations and selection for the BSP model
– Baumker, Dittrich, et al.
- 1996
|
|
4
|
Dynamic Perfect Hashing
– Dietzfelbinger, Karlin, et al.
- 1994
|
|
3
|
Storing a sparse table with o(1) worst case time
– Fredman, Komlós, et al.
- 1984
|
|
2
|
auf der Heide and V. Stemann, Shared Memory Simulations with Triple-Logarithmic Delay, in
– Czumaj, Meyer
- 1995
|
|
