The expected advantage of asynchrony

DOI10.1006/JCSS.1995.1067zbMATH Open0831.68047OpenAlexW2030945058MaRDI QIDQ1900933FDOQ1900933

Authors: Ofer Zajicek, Richard 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

Recommendations

• Analysis of an asynchronous PRAM algorithm
• Asynchronous PRAMs with memory latency
• A Model for Asynchronous Shared Memory Parallel Computation
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• Clock construction in fully asynchronous parallel systems and PRAM simulation

zbMATH Keywords

PRAM modelrecursive doubling algorithmAPRAM modelparallel summation algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited In (9)

• Efficient parallel algorithms can be made robust
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Minimizing the overhead for some tree-scheduling problems
• 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
• Partially ordered knowledge sharing and fractionated systems in the context of other models for distributed computing
• Analysis of an asynchronous PRAM algorithm
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

This page was built for publication: The expected advantage of asynchrony

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900933)