Interprocessor communication overhead is a crucial measure of the power of parallel computing systems-its impact can severely limit the performance of parallel programs. This report presents measurements of communication overhead on three contemporary commercial multicomputer systems: the Intel Paragon, the IBM SP2 and the Meiko CS-2. In each case the time to communicate between processors is presented as a function of message length. The time for global synchronization and memory access is discussed. The performance of these machines in emulating hypercubes and executing random pairwise exchanges is also investigated. It is shown that the interprocessor communication time depends heavily on the specific communication pattern required. Thes...
154 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.In this thesis we study commu...
International audienceParallel runtime systems such as MPI or task-based libraries provide models to...
This paper describes two models of the cost of data movement in parallel numerical algorithms. One m...
Interprocessor communication overhead is a crucial measure of the power of parallel computing syste...
Interprocessor communication overhead is a crucial measure of the power of parallel computing system...
The overhead of interprocessor communication is a major factor in limiting the performance of parall...
Performance information is essential to the design of efficient parallel programs. Whether the progr...
For parallel computers, the execution time of communication routines is an important determinate of ...
We evaluate the architectural support of collective communication operations on the IBM SP2, Cray T3...
Experiments were conducted on the Intel iPSC-860 hypercube in order to evaluate the overhead of inte...
227 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Most future supercomputers wi...
The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and...
We evaluate the architectural support of collective communication operations on the IBM SP2, Cray T3...
This is a post-peer-review, pre-copyedit version. The final authenticated version is available onlin...
Previous work on the analysis of execution time of parallel algorithms has either largely ignored co...
154 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.In this thesis we study commu...
International audienceParallel runtime systems such as MPI or task-based libraries provide models to...
This paper describes two models of the cost of data movement in parallel numerical algorithms. One m...
Interprocessor communication overhead is a crucial measure of the power of parallel computing syste...
Interprocessor communication overhead is a crucial measure of the power of parallel computing system...
The overhead of interprocessor communication is a major factor in limiting the performance of parall...
Performance information is essential to the design of efficient parallel programs. Whether the progr...
For parallel computers, the execution time of communication routines is an important determinate of ...
We evaluate the architectural support of collective communication operations on the IBM SP2, Cray T3...
Experiments were conducted on the Intel iPSC-860 hypercube in order to evaluate the overhead of inte...
227 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Most future supercomputers wi...
The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and...
We evaluate the architectural support of collective communication operations on the IBM SP2, Cray T3...
This is a post-peer-review, pre-copyedit version. The final authenticated version is available onlin...
Previous work on the analysis of execution time of parallel algorithms has either largely ignored co...
154 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.In this thesis we study commu...
International audienceParallel runtime systems such as MPI or task-based libraries provide models to...
This paper describes two models of the cost of data movement in parallel numerical algorithms. One m...