Conflict-free star-access in parallel memory systems

DOI10.1016/J.JPDC.2006.06.004zbMath1178.68074OpenAlexW2071565901MaRDI QIDQ861322

Irene Finocchi, Sajal K. Das, Rossella Petreschi

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.06.004

zbMATH Keywords

hypercubescoloringdata distributiontoriparallel memory systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (12)

A DSATUR-based algorithm for the equitable coloring problem ⋮ A Tabu Search Heuristic for the Equitable Coloring Problem ⋮ \((N, p)\)-equitable \(b\)-coloring of graphs ⋮ A polyhedral approach for the equitable coloring problem ⋮ The equitable vertex arboricity of complete tripartite graphs ⋮ A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ On the equitable vertex arboricity of graphs ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ On the equitable vertex arboricity of complete tripartite graphs ⋮ Equitable coloring of some convex polytope graphs

This page was built for publication: Conflict-free star-access in parallel memory systems