Perfect distance-d placements in 2D toroidal networks

DOI10.1023/B:SUPE.0000022572.95414.27MaRDI QIDQ704708zbMATH OpenOpenAlexFDO

Authors Marilynn L. Livingston, Bader F. AlBdaiwi

Publication date 19 January 2005

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:supe.0000022572.95414.27

zbMATH Keywords

distance-d placementsperfect placementsregular and irregular placementsresource placementsToroidal networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On resource placements in 3D tori.
• Quasi-perfect resource placements for two-dimensional toroidal networks
• Resource placement in the 4-dimensional cube-type processor networks with soft degradation
• Placement of resources of a computing system on a general graph
• Resource placement in Cartesian product of networks

Cited in

(7)

• A generalization of Lee codes
• Resource Placement in Networks Using Chromatic Sets of Power Graphs
• Resource placement in the 4-dimensional cube-type processor networks with soft degradation
• Quasi-perfect resource placements for two-dimensional toroidal networks
• Resource placement in Cartesian product of networks
• Quasi perfect codes in the Cartesian product of some graphs
• Chromatic sets of power graphs and their application to resource placement in multicomputer networks

This page was built for publication: Perfect distance-\(d\) placements in 2D toroidal networks

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