PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms

DOI10.1109/12.16507MaRDI QIDQ3817606zbMATH OpenOpenAlexFDO

Authors Allen Van Gelder

Publication date 1989

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.16507

zbMATH Keywords

asymptotic analysisparallel algorithmssortingPRAMmergingCREWdynamic processor allocationglobal memorysublogarithmic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• Fast Deterministic Processor Allocation
• scientific article; zbMATH DE number 437523
• Processor-time tradeoffs in PRAM simulations
• The log-star revolution
• Retrieval of scattered information by EREW, CREW, and CRCW PRAMs

Cited in

(6)

• Divide-and-conquer algorithms on the hypercube
• The log-star revolution
• \(O (\log^* n)\) algorithms on a Sum-CRCW PRAM
• Fast Deterministic Processor Allocation
• ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE
• On the sublinear processor gap for parallel architectures

This page was built for publication: PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms

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