By Topic

Data reshuffling in support of fast I/O for distributed-memory machines

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)
Bornstein, C. ; Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Steenkiste, P.

Achieving high-speed network I/O on distributed memory systems is a hard problem because their architectures are, in general, ill-suited for communication with the external world One of the problems is that messages are distributed over the private memories of the distributed memory system. This can result in poor performance since communication includes a complex scatter/gather operation. This paper presents a strategy in which the task of creating large contiguous messages is performed on the distributed-memory system, thus minimizing the overhead on the network interface. The performance results for an implementation of this strategy for an iWarp system with a HIPPI interface board are presented

Published in:

High Performance Distributed Computing, 1994., Proceedings of the Third IEEE International Symposium on

Date of Conference:

2-5 Aug 1994