Expected advantage of asynchrony

Richard Cole, Ofer Zajicek

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

Abstract

This paper expands on the APRAM model introduced in [CZ89]. It introduces a model under which processes may proceed at different and varying speeds. Using this model the implicit costs of synchronization can be studied. The merit of the model is exhibited by analyzing two key algorithms, parallel summation along an implicit binary tree and recursive doubling, and demonstrating that both asynchronous algorithms perform better then their synchronous counterparts in asynchronous settings.

Original languageEnglish (US)
Title of host publicationAlgorithms and Architectures
PublisherPubl by ACM
Pages85-94
Number of pages10
ISBN (Print)0897913701, 9780897913706
DOIs
StatePublished - 1990
EventSPAA '90 - Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures - Crete, Greece
Duration: Jul 2 1990Jul 6 1990

Publication series

NameAlgorithms and Architectures

Other

OtherSPAA '90 - Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures
CityCrete, Greece
Period7/2/907/6/90

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Expected advantage of asynchrony'. Together they form a unique fingerprint.

Cite this