The expected advantage of asynchrony
From MaRDI portal
Publication:1900933
DOI10.1006/jcss.1995.1067zbMath0831.68047OpenAlexW2030945058MaRDI QIDQ1900933
Ofer Zajicek, Richard John Cole
Publication date: 25 October 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1067
Related Items (7)
MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ ⋮ Efficient execution of nondeterministic parallel programs on asynchronous systems ⋮ The queue-read queue-write asynchronous PRAM model ⋮ Efficient parallel algorithms can be made robust ⋮ Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ Minimizing the overhead for some tree-scheduling problems
This page was built for publication: The expected advantage of asynchrony
