Optimal mappings of q-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates

DOI10.1006/JPDC.2000.1638zbMATH Open0962.68004OpenAlexW1974380669MaRDI QIDQ1581284FDOQ1581284

Authors: Sajal K. Das, Maria Cristina Pinotti 

Publication date: 13 June 2001

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

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1638

Recommendations

• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
• Multiple templates access of trees in parallel memory systems
• scientific article; zbMATH DE number 4030978
• scientific article; zbMATH DE number 1696651
• Publication:4945533

zbMATH Keywords

binomial treesconflict-free accessmemory bandwidth

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Cited In (11)

• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
• On a parallel memory to access trees
• Title not available (Why is that?)
• On coloring complete binary trees
• Title not available (Why is that?)
• Template-driven rainbow coloring of proper interval graphs
• Title not available (Why is that?)
• Template-driven rainbow coloring of proper interval graphs
• Title not available (Why is that?)
• Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
• Title not available (Why is that?)

This page was built for publication: Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates

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