An optical simulation of shared memory

Leslie Ann Goldberg, Yossi Matias, Satish Rao
<span title="">1994</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="" style="color: black;">Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA &#39;94</a> </i> &nbsp;
We present a work-optimal randomized algorithm for simulating a shared memory machine (pram) on an optical communication parallel computer (ocpc). The ocpc model is motivated by the potential of optical communication for parallel computation. The memory of an ocpc is divided into modules, one module per processor. Each memory module only services a request on a timestep if it receives exactly one memory request. Our algorithm simulates each step of an n lg lg n-processor erew pram on an
more &raquo; ... sor ocpc in O(lg lg n) expected delay. (The probability that the delay is longer than this is at most n ? for any constant .) The best previous simulation, due to Valiant, required (lg n) expected delay.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1145/181014.181406</a> <a target="_blank" rel="external noopener" href="">dblp:conf/spaa/GoldbergMR94</a> <a target="_blank" rel="external noopener" href="">fatcat:hjomdnekgrflhgzjr7xabrqbo4</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>