Modelling and search complexity in multiprocessor Systems

DOI10.1515/DMA.1999.9.5.523MaRDI QIDQ4522840zbMATH OpenOpenAlexFDO

Authors El'yar E. Gasanov, E. R. Erokhina

Publication date 10 May 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1999.9.5.523

zbMATH Keywords

multiprocessor systemsparallel searching algorithmsprogram searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• On Parallel Searching
• scientific article; zbMATH DE number 3860406
• scientific article; zbMATH DE number 176084
• Coefficients of speedup and parallel effectiveness of the parallel searching method
• Parallel searching of multidimensional cubes

Cited in

(2)

• Information storage and search complexity theory
• scientific article; zbMATH DE number 3860406 (Why is no real title available?)

This page was built for publication: Modelling and search complexity in multiprocessor Systems

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