By Topic

Sparse flat neighborhood networks (SFNNs): scalable guaranteed pairwise bandwidth & unit latency

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
$33 $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

3 Author(s)
T. I. Mattox ; ECE Dept., Kentucky Univ., Lexington, KY, USA ; H. G. Dietz ; W. R. Dieter

Network performance for a particular application is determined by the latency and bisection bandwidth that are achieved for the set of specific communication patterns used by that application. The number of nodes with which each node might potentially communicate grows linearly as nodes are added, thus, network cost for large systems either becomes a large fraction of machine cost or performance suffers. However, performance-critical communication patterns commonly occurring in real parallel programs rarely require that each node directly communicate with every other node. The number of node pairs actually communicating generally grows far slower than the expected O(N2). Thus, a carefully designed network for a massively parallel system can use relatively narrow switches while still providing single-switch latency and guaranteed pairwise bandwidth for performance-critical communications. This paper introduces sparse flat neighborhood networks (SFNNs), a variant of flat neighborhood networks (FNNs) which are engineered from first principles to efficiently meet these detailed pairwise communication performance criteria.

Published in:

19th IEEE International Parallel and Distributed Processing Symposium

Date of Conference:

4-8 April 2005