Multisearch techniques: Parallel data structures on mesh-connected computers

DOI10.1006/JPDC.1994.1001MaRDI QIDQ1328103zbMATH OpenOpenAlexFDO

Authors Mikhail J. Atallah, Frank Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay

Publication date 3 July 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/861

zbMATH Keywords

multisearch problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05) Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 742956
• On the multisearching problem for hypercubes
• The complexity of parallel multisearch on coarse-grained machines
• d-dimensional range search on multicomputers
• Parallel fractional cascading on hypercube multiprocessors

Cited in

(10)

• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
• d-dimensional range search on multicomputers
• Range search in parallel using distributed data structures
• Optimal cooperative search in fractional cascaded data structures
• On the multisearching problem for hypercubes
• Parallel strategies for direct multisearch
• scientific article; zbMATH DE number 645772 (Why is no real title available?)
• scientific article; zbMATH DE number 219274 (Why is no real title available?)
• scientific article; zbMATH DE number 742956 (Why is no real title available?)
• The deterministic complexity of parallel multisearch

This page was built for publication: Multisearch techniques: Parallel data structures on mesh-connected computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328103)