Can a shared-memory model serve as a bridging model for parallel computation?

DOI10.1007/S002240000121MaRDI QIDQ1293920zbMATH OpenOpenAlexFDO

Authors Phillip B. Gibbons, Y. Matias, Vijaya Ramachandran

Publication date 10 January 2000

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000121

zbMATH Keywords

parallel computationshared-memory model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1304264
• A Model for Asynchronous Shared Memory Parallel Computation
• scientific article; zbMATH DE number 177541
• A methodology approach to compare performance of parallel programming models for shared-memory architectures
• A hybrid approach for the modelling and simulation of a virtually shared memory parallel computer architecture

Cited in

(4)

• The cache complexity of multithreaded cache oblivious algorithms
• scientific article; zbMATH DE number 1728438 (Why is no real title available?)
• scientific article; zbMATH DE number 1728434 (Why is no real title available?)
• The bulk-synchronous parallel random access machine

This page was built for publication: Can a shared-memory model serve as a bridging model for parallel computation?

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