Abstract
In massively parallel processing systems that incorporate hundreds and thousands of processing nodes, the problem of placing a limited number of resources (e.g. printers, disks, software copies, etc.) over processing nodes is of great importance. In this paper, we investigate resource placement in the three-dimensional torus network which is the underlying interconnection network in most current multicomputer. We show that there exists an irregular distance-1 placement only for tori of the form 2 × 3 i × 6 j , i , j ∈ N . In addition, we present a new formal proof for the necessary and sufficient conditions for the existence of irregular distance- d placement in 3D tori.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
