Efficient low-contention parallel algorithms

DOI10.1006/JCSS.1996.0079MaRDI QIDQ676446zbMATH OpenOpenAlexFDO

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

Publication date 15 September 1997

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1996.0079

zbMATH Keywords

parallel random access machine

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1003297
• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
• The queue-read queue-write asynchronous PRAM model
• Improved deterministic parallel integer sorting

Cited in

(6)

• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
• scientific article; zbMATH DE number 176751 (Why is no real title available?)
• Simple fast parallel hashing
• Delayed path coupling and generating random permutations
• The queue-read queue-write asynchronous PRAM model
• More efficient parallel flow algorithms

This page was built for publication: Efficient low-contention parallel algorithms

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