Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees

DOI10.1006/JPDC.2002.1860zbMATH Open1004.68005OpenAlexW1998204921MaRDI QIDQ701181FDOQ701181

Authors: Alan A. Bertossi, Cristina M. Pinotti 

Publication date: 16 October 2002

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

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

Recommendations

• scientific article; zbMATH DE number 1696651
• 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
• 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

zbMATH Keywords

systemfrequency assignmentbidimensional arraycircular listcomplete treeconflict-free accessmapping schememultibank memorypath template

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (7)

• The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• Template-driven rainbow coloring of proper interval graphs
• Template-driven rainbow coloring of proper interval graphs
• Title not available (Why is that?)
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
• Title not available (Why is that?)

This page was built for publication: Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees

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