Contention of Communications in Switched Networks with Applications to Parallel Sorting

dc.contributor.authorMistry, Nil
dc.contributor.authorRamsey, Jordan
dc.contributor.authorWiley, Benjamin
dc.contributor.authorYanchuck, Jackie
dc.contributor.authorHuang, Xuan
dc.contributor.authorGobbert, Matthias K.
dc.contributor.authorMineo, Christopher
dc.contributor.authorMountain, David
dc.date.accessioned2018-10-01T13:58:13Z
dc.date.available2018-10-01T13:58:13Z
dc.date.issued2013
dc.description.abstractContention of communications across a switched network that connects multiple compute nodes in a distributed-memory cluster may seriously degrade performance of parallel code. The InfiniBand network is the most popular interconnect for compute clusters. While one may correctly assume that increased resource contention leads to decreased application performance, alternate methods such as virtual channels and adaptive routing have obscured the point at which inter-job interference becomes a major issue. This contention is maximized when communicating large blocks of data among all parallel processes simultaneously. This communication pattern arises in many important algorithms such as parallel sorting. We use the cluster tara in the UMBC High Performance Computing Facility (HPCF) with a quad-data rate Infini-Band network which provides an opportunity to test the case if the capacity of a switched network is a limiting factor in algorithmic performance.en_US
dc.description.sponsorshipThese results were obtained as part of the REU Site: Interdisciplinary Program in High Performance Computing (www.umbc.edu/hpcreu) in the Department of Mathematics and Statistics at the University of Maryland, Baltimore County (UMBC) in Summer 2013. This program is funded jointly by the National Science Foundation and the National Security Agency (NSF grant no. DMS–1156976), with additional support from UMBC, the Department of Mathematics and Statistics, the Center for Interdisciplinary Research and Consulting (CIRC), and the UMBC High Performance Computing Facility (HPCF). HPCF (www.umbc.edu/hpcf) is supported by the National Science Foundation through the MRI program (grant nos. CNS–0821258 and CNS–1228778) and the SCREMS program (grant no. DMS–0821311), with additional substantial support from UMBC. Co-author Jordan Ramsey was supported, in part, by the UMBC National Security Agency (NSA) Scholars Program though a contract with the NSA. Graduate RA Xuan Huang was supported by UMBC as HPCF RA.en_US
dc.description.urihttps://userpages.umbc.edu/~gobbert/papers/REU2013Team3IB.pdfen_US
dc.format.extent11 pagesen_US
dc.genretechnical reporten_US
dc.identifierdoi:10.13016/M26Q1SM54
dc.identifier.urihttp://hdl.handle.net/11603/11417
dc.language.isoen_USen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Mathematics and Statistics Department
dc.relation.ispartofUMBC Faculty Collection
dc.relation.ispartofUMBC Student Collection
dc.relation.ispartofseriesHPCF Technical Report;HPCF-2013-13
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
dc.subjectdistributed-memory clusteren_US
dc.subjectparallel codeen_US
dc.subjectInfiniBand networken_US
dc.subjectUMBC High Performance Computing Facility (HPCF)en_US
dc.subjectContention of communications across a switched network
dc.subjectvirtual channels
dc.subjectadaptive routing
dc.titleContention of Communications in Switched Networks with Applications to Parallel Sortingen_US
dc.typeTexten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
REU2013Team3IB.pdf
Size:
271.75 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.68 KB
Format:
Item-specific license agreed upon to submission
Description: