By Topic

On Resource Placement in Gaussian and EJ Interconnection Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Flahive, M. ; Dept. of Math., Oregon State Univ., Corvallis, OR, USA ; Bose, B.

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.

Published in:

Computers, IEEE Transactions on  (Volume:62 ,  Issue: 3 )