By Topic

A mathematical game and its applications to the design of 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)
Chi-Hsiang Yeh ; Dept. of Electr. & Comput. Eng., Queen''s Univ., Kingston, Ont., Canada ; Varvarigos, E.A.

In this paper we propose a mathematical game, called the ball-arrangement game (BAG). A game with a different set of rules (e.g., permissible moves) gives rise to a different network, and the algorithm that solves the game gives rise to a routing algorithm in that network. Based on the insights provided by BAG, we propose several new classes of symmetric and modular networks, called super Cayley graphs, that have optimal (intercluster) diameters and average (intercluster) distances, small (intercluster) node degrees, high bisection bandwidth, strong embedding capability, and optimal communication algorithms given their (intercluster) node degrees.

Published in:

Parallel Processing, 2001. International Conference on

Date of Conference:

3-7 Sept. 2001