Expected advantage of asynchrony

Richard Cole, Ofer Zajicek

Research output: Contribution to journalArticle

Abstract

This paper studies the implicit costs of synchronization and the possible gains arising from avoiding synchronization in asynchronous environments. An asynchronous generalization of the PRAM model called the APRAM model is used and appropriate complexity measures are defined. The advantage that asynchrony provides is illustrated by analyzing two algorithms: a parallel summation algorithm which proceeds along an implicit complete binary tree and a recursive doubling algorithm which proceeds along a linked list.

Original languageEnglish (US)
Pages (from-to)286-300
Number of pages15
JournalJournal of Computer and System Sciences
Volume51
Issue number2
DOIs
StatePublished - Oct 1995

Fingerprint

Synchronization
Binary trees
Parallel algorithms
Complexity Measure
Binary Tree
Doubling
Summation
Costs
Model
Generalization

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Applied Mathematics
  • Computer Networks and Communications

Cite this

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

In: Journal of Computer and System Sciences, Vol. 51, No. 2, 10.1995, p. 286-300.

Research output: Contribution to journalArticle

Cole, Richard ; Zajicek, Ofer. / Expected advantage of asynchrony. In: Journal of Computer and System Sciences. 1995 ; Vol. 51, No. 2. pp. 286-300.
@article{6a32127ba52c4f828c0b9fda4bb7d6e9,
title = "Expected advantage of asynchrony",
abstract = "This paper studies the implicit costs of synchronization and the possible gains arising from avoiding synchronization in asynchronous environments. An asynchronous generalization of the PRAM model called the APRAM model is used and appropriate complexity measures are defined. The advantage that asynchrony provides is illustrated by analyzing two algorithms: a parallel summation algorithm which proceeds along an implicit complete binary tree and a recursive doubling algorithm which proceeds along a linked list.",
author = "Richard Cole and Ofer Zajicek",
year = "1995",
month = "10",
doi = "10.1006/jcss.1995.1067",
language = "English (US)",
volume = "51",
pages = "286--300",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Expected advantage of asynchrony

AU - Cole, Richard

AU - Zajicek, Ofer

PY - 1995/10

Y1 - 1995/10

N2 - This paper studies the implicit costs of synchronization and the possible gains arising from avoiding synchronization in asynchronous environments. An asynchronous generalization of the PRAM model called the APRAM model is used and appropriate complexity measures are defined. The advantage that asynchrony provides is illustrated by analyzing two algorithms: a parallel summation algorithm which proceeds along an implicit complete binary tree and a recursive doubling algorithm which proceeds along a linked list.

AB - This paper studies the implicit costs of synchronization and the possible gains arising from avoiding synchronization in asynchronous environments. An asynchronous generalization of the PRAM model called the APRAM model is used and appropriate complexity measures are defined. The advantage that asynchrony provides is illustrated by analyzing two algorithms: a parallel summation algorithm which proceeds along an implicit complete binary tree and a recursive doubling algorithm which proceeds along a linked list.

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

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

U2 - 10.1006/jcss.1995.1067

DO - 10.1006/jcss.1995.1067

M3 - Article

AN - SCOPUS:0029393037

VL - 51

SP - 286

EP - 300

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 2

ER -