On saving space in parallel computation

DOI10.1016/0020-0190(88)90233-5zbMATH Open0662.68047OpenAlexW137867423MaRDI QIDQ1114403FDOQ1114403

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

Recommendations

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

zbMATH Keywords

parallel algorithmCRCW PRAM model of computationspace requirements

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

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

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)