On a parallel memory to access trees

MaRDI QIDQ2734498zbMATH OpenFDO

Authors Hiromitsu Shirakawa

Publication date 14 August 2001

Published in Memoirs of the Institute of Science and Engineering. Ritsumeikan University (Search for Journal in Brave)

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 4033049
• scientific article; zbMATH DE number 4030978
• Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
• A memory organization for parallel computers
• Multiple templates access of trees in parallel memory systems

Cited in

(5)

• Effect of data organization in a system of interleaved memories on the performance of parallel search
• scientific article; zbMATH DE number 3974298 (Why is no real title available?)
• scientific article; zbMATH DE number 4030978 (Why is no real title available?)
• scientific article; zbMATH DE number 4033049 (Why is no real title available?)
• scientific article; zbMATH DE number 1424319 (Why is no real title available?)

This page was built for publication: On a parallel memory to access trees

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