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

From MaRDI portal
(Redirected from Optimal mappings of q-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates)
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.1638MaRDI QIDQ1581284zbMATH OpenOpenAlexFDO

Authors Maria Cristina Pinotti, Sajal K. Das

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


zbMATH Keywords

binomial treesconflict-free accessmemory bandwidth

Mathematics Subject Classification ID

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





Recommendations



Cited in
(13)








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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Optimal_mappings_of_%5C(q%5C)-ary_and_binomial_trees_into_parallel_memory_modules_for_fast_and_conflict-free_access_to_path_and_subtree_templates&oldid=72245745"
Powered by MediaWiki