OREGON STATE UNIVERSITY

You are here

On Resource Placement in Gaussian and EJ Interconnection Networks

TitleOn Resource Placement in Gaussian and EJ Interconnection Networks
Publication TypeJournal Article
Year of Publication2013
AuthorsFlahive, M., and B. Bose
JournalIEEE Transactions on Computers
Volume62
Issue3
Pagination623 - 626
Date Published03/2013
ISSN0018-9340
KeywordsEJ networks, Gaussian networks, hexagonal mesh networks, interconnection networks, perfect dominating sets, resource placement
Abstract

In a multiprocessor system, a limited number of resources need to be uniformly distributed so that all processor nodes can have equal access to these resources. This is referred to as the resource placement problem. In a perfect t--placement each nonresource node is at a distance of t or less from exactly one resource node. Here, we first find all perfect t-placements in the infinite square and triangular grids. That information is then used to show that translates of earlier sets are the only perfect t-placements in Gaussian and EJ interconnection networks.

DOI10.1109/TC.2011.254
Short TitleIEEE Trans. Comput.
Refereed DesignationRefereed