scientific article; zbMATH DE number 1424319

MaRDI QIDQ4945533zbMATH OpenFDO

Authors Sajal K. Das, Maria Cristina Pinotti

Publication date 7 June 2000

zbMATH Keywords

memory modulesparallel memory system

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Computer system organization (68M99) Data structures (68P05) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Recommendations

• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
• Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
• On a parallel memory to access trees
• Multiple templates access of trees in parallel memory systems
• scientific article; zbMATH DE number 1696651

Cited in

(7)

• Multiple templates access of trees in parallel memory systems
• Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
• Optimizing large data transfers in parity-declustered data layouts
• Distribution of operations and data arrays over processors
• scientific article; zbMATH DE number 4030978 (Why is no real title available?)
• scientific article; zbMATH DE number 4092740 (Why is no real title available?)
• Minimization of memory and network contention for accessing arbitrary data patterns in SIMD systems

This page was built for publication:

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