A fine-grained parallel memory compaction algorithm

DOI10.1006/JPDC.1994.1017MaRDI QIDQ1325973zbMATH OpenOpenAlexFDO

Authors Patrick Weemeeuw, Bart Demoen

Publication date 15 May 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/124263

zbMATH Keywords

dynamic data structuresgarbage collectionmemory compactionmemory managementsliding compaction algorithm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 177853
• The Parallel Simplicity of Compaction and Chaining
• Retrieval of scattered information by EREW, CREW and CRCW PRAMs

Cited in

(4)

• A parallel algorithm for allocation of spare cells on memory chips
• scientific article; zbMATH DE number 176513 (Why is no real title available?)
• Memory-Link Compression Schemes: A Value Locality Perspective
• Oblivious parallel tight compaction

This page was built for publication: A fine-grained parallel memory compaction algorithm

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