Placement of resources of a computing system on a general graph

MaRDI QIDQ378357zbMATH OpenFDO

Authors P. P. Parkhomenko

Publication date 11 November 2013

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83)

Recommendations

• Placing resource copies on graphs that model the structures of computer systems
• Resource placement in Cartesian product of networks
• Quasi-perfect resource placements for two-dimensional toroidal networks
• Chromatic sets of power graphs and their application to resource placement in multicomputer networks
• Resource Placement in Networks Using Chromatic Sets of Power Graphs

Cited in

(6)

• Quasi-perfect resource placements for two-dimensional toroidal networks
• Resource Placement in Networks Using Chromatic Sets of Power Graphs
• Chromatic sets of power graphs and their application to resource placement in multicomputer networks
• Resource placement in Cartesian product of networks
• Resource placement in the 4-dimensional cube-type processor networks with soft degradation
• Perfect distance-\(d\) placements in 2D toroidal networks

This page was built for publication: Placement of resources of a computing system on a general graph

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