Effect of data organization in a system of interleaved memories on the performance of parallel search

DOI10.1016/0020-0255(86)90038-1MaRDI QIDQ1092668zbMATH OpenOpenAlexFDO

Authors Sudarshan Dhall, S. Lakshmivarahan

Publication date 1986

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(86)90038-1

zbMATH Keywords

organizations of data in a multiprocessor systemperformance of parallel search algorithmsstorage schemessystem of interleaved memory modules

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10)

Review text

The performance of parallel search algorithms with respect to three storage schemes - (a) low-order, (b) complete binary tree, and (c) high- order - in a system of interleaved memory modules is analyzed. It is shown using analysis and simulation that parallel search algorithms using the latter two storage schemes, even in competitive mode, perform as well as or even better than the search algorithms using the low-order scheme involving various degrees of cooperation.

Recommendations

• Parallel processing can be harmful: The unusual behavior of interpolation search
• On Parallel Searching
• scientific article; zbMATH DE number 4033049
• On a parallel memory to access trees
• A memory organization for parallel computers

Cites work

• Analysis of Memory Interference in Multiprocessors
• Binary Search in a Multiprocessing Environment
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3574970 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)

This page was built for publication: Effect of data organization in a system of interleaved memories on the performance of parallel search

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