Efficient low-contention parallel algorithms

DOI10.1006/JCSS.1996.0079zbMATH Open0870.68083OpenAlexW4213083648MaRDI QIDQ676446FDOQ676446

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

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

zbMATH Keywords

parallel random access machine

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited In (6)

• More efficient parallel flow algorithms
• Title not available (Why is that?)
• Simple fast parallel hashing
• The queue-read queue-write asynchronous PRAM model
• Delayed path coupling and generating random permutations
• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel 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)