An optical simulation of shared memory
- Sandia National Labs., Albuquerque, NM (United States)
- AT and T Bell Labs., Murray Hill, NJ (United States)
- NEC Research Inst., Princeton, NJ (United States)
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(lg lg n) expected delay. (The probability that the delay is longer than this is at most n{sup {minus}{alpha}} for any constant {alpha}). The best previous simulation, due to Valiant, required {Theta}(lg n) expected delay.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 10160474
- Report Number(s):
- SAND--94-0512C; CONF-9406186--1; ON: DE94013824
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance analysis of the FFT algorithm on a shared-memory parallel architecture
Parallel (delta + 1) coloring of constant-degree graphs