A Model for Asynchronous Shared Memory Parallel Computation

DOI10.1137/S0097539791219670MaRDI QIDQ4327420zbMATH OpenOpenAlexFDO

Authors N. Nishimura

Publication date 6 April 1995

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539791219670

zbMATH Keywords

shared memoryparallel modelsasynchronous model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• scientific article; zbMATH DE number 1728438
• Analysis of an asynchronous PRAM algorithm
• The queue-read queue-write asynchronous PRAM model
• Virtual shared memory: Algorithms and complexity

Cited in

(18)

• Parallel `go with the winners' algorithms in distributed memory models.
• Imperative process algebra and models of parallel computation
• Hundreds of impossibility results for distributed computing
• A hybrid approach for the modelling and simulation of a virtually shared memory parallel computer architecture
• A model of sequential computation with Pipelined access to memory
• The expected advantage of asynchrony
• A mathematical model of asynchronous data flow in parallel computers*
• Bulk synchronous parallel algorithms for the external memory model
• Can a shared-memory model serve as a bridging model for parallel computation?
• scientific article; zbMATH DE number 3907760 (Why is no real title available?)
• scientific article; zbMATH DE number 4087003 (Why is no real title available?)
• On the formalization of the notion of a concurrent algorithm
• Cooperative asynchronous update of shared memory
• An asynchronous protocol for release consistent distributed shared memory systems
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• On process assignment in parallel computing
• Primitives for asynchronous list compression
• Dynamic Task Allocation in Asynchronous Shared Memory

This page was built for publication: A Model for Asynchronous Shared Memory Parallel Computation

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