Quasi-perfect resource placements for two-dimensional toroidal networks

DOI10.1016/J.JPDC.2005.02.005MaRDI QIDQ557658zbMATH OpenOpenAlexFDO

Authors Bella Bose, Bader F. AlBdaiwi

Publication date 30 June 2005

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.2005.02.005

zbMATH Keywords

Interconnection networksPerfect placementsQuasi-perfect placementsResource placementsTorus

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Perfect distance-\(d\) placements in 2D toroidal networks
• Placing resource copies on graphs that model the structures of computer systems
• On resource placements in 3D tori.
• Resource placement in Cartesian product of networks
• Placement of resources of a computing system on a general graph

Cited in

(6)

• Chromatic sets of power graphs and their application to resource placement in multicomputer networks
• Placement of resources of a computing system on a general graph
• Resource placement in the 4-dimensional cube-type processor networks with soft degradation
• On resource placements in 3D tori.
• Efficient location of resources in cylindrical networks
• Perfect distance-\(d\) placements in 2D toroidal networks

This page was built for publication: Quasi-perfect resource placements for two-dimensional toroidal networks

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