Contention of Communications in Switched Networks with Applications to Parallel Sorting
dc.contributor.author | Mistry, Nil | |
dc.contributor.author | Ramsey, Jordan | |
dc.contributor.author | Wiley, Benjamin | |
dc.contributor.author | Yanchuck, Jackie | |
dc.contributor.author | Huang, Xuan | |
dc.contributor.author | Gobbert, Matthias K. | |
dc.contributor.author | Mineo, Christopher | |
dc.contributor.author | Mountain, David | |
dc.date.accessioned | 2018-10-01T13:58:13Z | |
dc.date.available | 2018-10-01T13:58:13Z | |
dc.date.issued | 2013 | |
dc.description.abstract | Contention 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.sponsorship | These 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.uri | https://userpages.umbc.edu/~gobbert/papers/REU2013Team3IB.pdf | en_US |
dc.format.extent | 11 pages | en_US |
dc.genre | technical report | en_US |
dc.identifier | doi:10.13016/M26Q1SM54 | |
dc.identifier.uri | http://hdl.handle.net/11603/11417 | |
dc.language.iso | en_US | en_US |
dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
dc.relation.ispartof | UMBC Computer Science and Electrical Engineering Department Collection | |
dc.relation.ispartof | UMBC Mathematics and Statistics Department | |
dc.relation.ispartof | UMBC Faculty Collection | |
dc.relation.ispartof | UMBC Student Collection | |
dc.relation.ispartofseries | HPCF Technical Report;HPCF-2013-13 | |
dc.rights | This 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.subject | distributed-memory cluster | en_US |
dc.subject | parallel code | en_US |
dc.subject | InfiniBand network | en_US |
dc.subject | UMBC High Performance Computing Facility (HPCF) | en_US |
dc.subject | Contention of communications across a switched network | |
dc.subject | virtual channels | |
dc.subject | adaptive routing | |
dc.title | Contention of Communications in Switched Networks with Applications to Parallel Sorting | en_US |
dc.type | Text | en_US |