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
Editors Anon
PublisherPubl by ACM
Pages85-94
Number of pages10
ISBN (Print)0897913701
StatePublished - 1990
EventSPAA '90 - Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures - Crete, Greece
Duration: Jul 2 1990Jul 6 1990

Other

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

Fingerprint

Binary trees
Parallel algorithms
Synchronization
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cole, R., & Zajicek, O. (1990). Expected advantage of asynchrony. In Anon (Ed.), Algorithms and Architectures (pp. 85-94). Publ by ACM.

Expected advantage of asynchrony. / Cole, Richard; Zajicek, Ofer.

Algorithms and Architectures. ed. / Anon. Publ by ACM, 1990. p. 85-94.

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

Cole, R & Zajicek, O 1990, Expected advantage of asynchrony. in Anon (ed.), Algorithms and Architectures. Publ by ACM, pp. 85-94, SPAA '90 - Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece, 7/2/90.
Cole R, Zajicek O. Expected advantage of asynchrony. In Anon, editor, Algorithms and Architectures. Publ by ACM. 1990. p. 85-94
Cole, Richard ; Zajicek, Ofer. / Expected advantage of asynchrony. Algorithms and Architectures. editor / Anon. Publ by ACM, 1990. pp. 85-94
@inproceedings{daef581de4744423aa5012111fa588de,
title = "Expected advantage of asynchrony",
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.",
author = "Richard Cole and Ofer Zajicek",
year = "1990",
language = "English (US)",
isbn = "0897913701",
pages = "85--94",
editor = "Anon",
booktitle = "Algorithms and Architectures",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Expected advantage of asynchrony

AU - Cole, Richard

AU - Zajicek, Ofer

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025623021&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025623021&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897913701

SP - 85

EP - 94

BT - Algorithms and Architectures

A2 - Anon, null

PB - Publ by ACM

ER -