2001
Blocking in parallel multisearch problems
Publication
Publication
Theory of Computing Systems , Volume 34  Issue 2 p. 145 189
External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Blockwise access to data is a central theme in the design of efficient EM algorithms. A similar requirement arises in the transmission of data between processors in high performance parallel computation systems, for which blockwise communication is a crucial issue. We consider multisearch problems, where a large number of queries are to be simultaneously processed and satisfied by navigating through large data structures on parallel computers. Our examples originate as algorithms for parallel machines, and we adapt them to the EM situation where the queries and data structure are considered to be much larger than the size of the available internal memory. This paper presents techniques to achieve blocking for I/O as well as for communication in multisearch on the BSP and EMBSP models. We describe improvements to the 1optimal BSP* multisearch algorithm of [8] which permit larger search trees to be handled. In the area of EM algorithms new algorithms for multisearch in balanced trees are described. For search trees of size O(n log n) where n is the number of queries, we obtain a workoptimal, parallel, randomized EM multisearch algorithm whose I/O and communication time are smaller, asymptotically, than the computation time. We obtain a deterministic version via a similar technique. These algorithms are obtained via the simulation techniques of [12], [17], [13], [14], and [24]. For larger trees we describe a parallel, EM algorithm which is 1optimal considering computation, communication, and I/O (for suitable parameter constellations) plus I/Ooptimal. We give a lower bound to the number of I/O operations required for filtering n queries through a binary or multiway search tree of size m when m ≥ n2+ε, for a constant ε ≥ 0.
Additional Metadata  

dx.doi.org/10.1007/s0022400100021  
Theory of Computing Systems  
Organisation  Computational Geometry Lab 
Dittrich, W. (W.), Hutchinson, D.A. (D. A.), & Maheshwari, A. (2001). Blocking in parallel multisearch problems. Theory of Computing Systems, 34(2), 145–189. doi:10.1007/s0022400100021
