Synchronization and communication in the T3E multiprocessor
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
Performance of the CRAY T3E multiprocessor
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Message-Passing Performance of Parallel Computers
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Selected Results from the ParkBench Benchmark
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
A Performance Analysis of the SGI Origin2000
VECPAR '98 Selected Papers and Invited Talks from the Third International Conference on Vector and Parallel Processing
Data Locality Exploitation in the Decomposition of Regular Domain Problems
IEEE Transactions on Parallel and Distributed Systems
Parallelization of Irregular Problems Based on Hierarchical Domain Representation
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Impact of PE Mapping on Cray T3E Message-Passing Performance
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A robust multigrid solver on parallel computers
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Modeling message-passing overhead on NCHC formosa PC cluster
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Hi-index | 0.00 |
We present the results of different communication tests on some current parallel computers, the Cray T3E and the SGI Origin 2000. The aim of this paper is to study the effect of the local memory use and the communication network exploitation on message sending. For this purpose, we have first designed experiments without network contention to establish the achievable bandwidths. We have then modified this base experiment by increasing the contention of the network and by decreasing the spatial locality properties of the messages. We analyse these results taking into account the underlying architectures and we conclude with some hints for regular applications.