Modeling node bandwidth limits and their effects on vector combining algorithms [electronic resource].
- Washington, D.C. : United States. Dept. of Energy, 1992. and Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
- Physical Description:
- 14 pages : digital, PDF file
- Additional Creators:
- Pacific Northwest Laboratory, United States. Department of Energy, and United States. Department of Energy. Office of Scientific and Technical Information
- Restrictions on Access:
- Free-to-read Unrestricted online access
- Each node in a message-passing multicomputer typically has several communication links. However, the maximum aggregate communication speed of a node is often less than the sum of its individual link speeds. Such computers are called node bandwidth limited (NBL). The NBL constraint is important when choosing algorithms because it can change the relative performance of different algorithms that accomplish the same task. This paper introduces a model of communication performance for NBL computers and uses the model to analyze the overall performance of three algorithms for vector combining (global sum) on the Intel Touchstone DELTA computer. Each of the three algorithms is found to be at least 33% faster than the other two for some combinations of machine size and vector length. The NBL constraint is shown to significantly affect the conditions under which each algorithm is fastest.
- Published through SciTech Connect., 01/13/1992., "pnl-sa--20425", "DE92010829", and Littlefield, R.J.
- Type of Report and Period Covered Note:
- Topical; 01/01/1992 - 01/01/1992
- Funding Information:
View MARC record | catkey: 14353941