A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
We present lower bounds for time needed to solve basic problems on three general-purpose models of parallel computation: the shared-memory models qsm and s-qsm, and the distributed-memory model, the bsp. For each of these models, we also obtain lower bounds for the number of rounds needed to solve these problems using a randomized algorithm on a p-processor machine. Our results on'rounds' is of special interest in the context of designing work-e cient algorithms on a machine where latency anddoi:10.1145/277651.277681 dblp:conf/spaa/MackenzieR98 fatcat:zf2bjy3dajexnbymse7234i6c4