An optical simulation of shared memory

Leslie Ann Goldberg, Yossi Matias, Satish Rao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 n-processor ocpc in O(lglgn) 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 Φ(lgn) expected delay.

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994
PublisherAssociation for Computing Machinery, Inc
Pages257-267
Number of pages11
ISBN (Electronic)0897916719, 9780897916714
DOIs
StatePublished - 1 Aug 1994
Externally publishedYes
Event6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994 - Cape May, United States
Duration: 27 Jun 199429 Jun 1994

Publication series

NameProceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

Conference

Conference6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994
Country/TerritoryUnited States
CityCape May
Period27/06/9429/06/94

Fingerprint

Dive into the research topics of 'An optical simulation of shared memory'. Together they form a unique fingerprint.

Cite this