DMCA
Optical Communication for Pointer Based Algorithms (Extended Abstract) (1988)
| Citations: | 57 - 1 self |
BibTeX
@TECHREPORT{Anderson88opticalcommunication,
author = {Richard Anderson and Gary L. Miller},
title = {Optical Communication for Pointer Based Algorithms (Extended Abstract)},
institution = {},
year = {1988}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we study the Local Memory P-RAM. This model allows unit cost communication but assumes that the shared memory is divided into modules. This model is motivated by a consideration of potential optical computers. We show that fundamental problems such as list-ranking and parallel tree contraction can be implemented on this model in O(log n) time using n= log n processors. To solve the list-ranking problem we introduce a general asynchronous technique which has relevance to a number of problems.
Keyphrases
optical communication parallel tree contraction log processor basic problem local memory p-ram optical communication architecture list-ranking problem parallel computation general asynchronous technique unit time potential optical computer fundamental problem shared memory unit cost communication
