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

asynchronous modelparallel modelsshared memory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) 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

(20)

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

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)