The APRAM: Incorporating asynchrony into the PRAM model

Richard Cole, Ofer Zajicek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The APRAM model is introduced and a complexity measure is defined. Algorithms for several basic problems are presented, including a non-Trivial algorithm for graph connectivity.

Original languageEnglish (US)
Title of host publicationProceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
EditorsF.T. Leighton
PublisherAssociation for Computing Machinery, Inc
Pages169-178
Number of pages10
ISBN (Electronic)089791323X, 9780897913232
DOIs
StatePublished - Mar 1 1989
Event1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 - Santa Fe, United States
Duration: Jun 18 1989Jun 21 1989

Publication series

NameProceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Other

Other1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
CountryUnited States
CitySanta Fe
Period6/18/896/21/89

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'The APRAM: Incorporating asynchrony into the PRAM model'. Together they form a unique fingerprint.

Cite this