Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
From MaRDI portal
Publication:701181
DOI10.1006/jpdc.2002.1860zbMath1004.68005MaRDI QIDQ701181
Cristina M. Pinotti, Alan A. Bertossi
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
system; complete tree; frequency assignment; bidimensional array; circular list; conflict-free access; mapping scheme; multibank memory; path template
68M10: Network design and communication in computer systems
Related Items
Template-driven rainbow coloring of proper interval graphs, Template-driven rainbow coloring of proper interval graphs, \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs, 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