On saving space in parallel computation

DOI10.1016/0020-0190(88)90233-5MaRDI QIDQ1114403zbMATHOpenAlexFDO

Authors Torben Hagerup

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90233-5

zbMATH Keywords

parallel algorithmCRCW PRAM model of computationspace requirements

Mathematics Subject Classification ID

Recommendations

• Trade-Offs between Depth and Width in Parallel Computation
• Dynamic parallel memories
• Space-efficient parallel merging
• scientific article; zbMATH DE number 176748
• Parallelism Always Helps

Cited in

(9)

• Memory requirements for parallel programs
• Multiplication, division, and shift instructions in parallel random access machines
• Fast and practical approximate string matching
• Optimal parallel algorithms on planar graphs
• Dynamic parallel memories
• Trade-Offs between Depth and Width in Parallel Computation
• Managing space as virtual parallel space
• Optimal parallel algorithms for Prefix Matching
• Parallel construction and query of index data structures for pattern matching on square matrices

This page was built for publication: On saving space in parallel computation

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