Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds

DOI10.1007/S002240000066zbMath0893.68007OpenAlexW2038729923MaRDI QIDQ1384682

Franco P. Preparata, Gianfranco Bilardi

Publication date: 25 May 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000066

zbMATH Keywords

simulations of multiprocessor machinestopological separator

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (1)

The cache complexity of multithreaded cache oblivious algorithms

This page was built for publication: Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds