z-logo
open-access-imgOpen Access
NIC-based reduction algorithms for large-scale clusters
Author(s) -
Fabrizio Petrini,
Adam Moody,
Juan Fernández,
Eitan Frachtenberg,
Dhabaleswar K. Panda
Publication year - 2006
Publication title -
international journal of high performance computing and networking
Language(s) - English
Resource type - Journals
eISSN - 1740-0570
pISSN - 1740-0562
DOI - 10.1504/ijhpcn.2006.010635
Subject(s) - computer science , host (biology) , reduction (mathematics) , implementation , parallel computing , interconnection , computer cluster , scale (ratio) , interface (matter) , cluster (spacecraft) , algorithm , supercomputer , distributed computing , operating system , computer network , programming language , mathematics , ecology , physics , geometry , bubble , quantum mechanics , maximum bubble pressure method , biology
Efficient reduction algorithms are crucial to many large-scale, parallel scientific applications. While previous algorithms constrain processing to the host CPU, we explore and utilise the processors in modern cluster Network Interface Cards (NICs). We present the design issues, solutions, analytical models, and experimental evaluations of a family of NIC-based reduction algorithms. Through experiments on the ALC cluster at Lawrence Livermore National Laboratory, which connects 960 dual-CPU nodes with the Quadrics QsNet interconnect, we find NIC-based reductions to be more efficient than host-based implementations. At large-scale, our NIC-based reductions are more than twice as fast as the host-based, production-level MPI implementation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom