Mappings for conflict-free access of paths in elementary data structures

DOI10.1007/3-540-44968-X_35MaRDI QIDQ2766844zbMATH OpenFDO

Authors Alan A. Bertossi, Maria Cristina Pinotti

Publication date 22 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_35

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
• Optimal mappings of q-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
• scientific article; zbMATH DE number 4033049
• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
• Conflict-free star-access in parallel memory systems

Cited in

(8)

• Optimal mappings of q-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
• scientific article; zbMATH DE number 434884 (Why is no real title available?)
• scientific article; zbMATH DE number 4092740 (Why is no real title available?)
• scientific article; zbMATH DE number 4094782 (Why is no real title available?)
• Conflict-free access for streams in multimodule memories
• scientific article; zbMATH DE number 1424319 (Why is no real title available?)
• On coloring complete binary trees
• Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees

This page was built for publication: Mappings for conflict-free access of paths in elementary data structures

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