Communication-processor tradeoffs in a limited resources PRAM

DOI10.1007/S00453-002-0966-5MaRDI QIDQ1849381zbMATH OpenOpenAlexFDO

Authors Adnan Agbaria, Yosi Ben-Asher, Ilan Newman

Publication date 1 December 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-002-0966-5

zbMATH Keywords

PPRAMPRAM model

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Communication complexity of PRAMs
• Trade-offs between communication throughput and parallel time
• Trade-offs between communication throughput and parallel time
• scientific article; zbMATH DE number 4060722
• Processor-time tradeoffs in PRAM simulations

Cited in

(6)

• Scalable and predictable performance for irregular problems using the WPRAM computational model
• scientific article; zbMATH DE number 4060722 (Why is no real title available?)
• On the sublinear processor gap for parallel architectures
• Trade-offs between communication throughput and parallel time
• Trade-offs between communication throughput and parallel time
• Communication complexity of PRAMs

This page was built for publication: Communication-processor tradeoffs in a limited resources PRAM

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