Sciweavers

159 search results - page 28 / 32
» Analytical Models of Probability Distributions for MPI Point...
Sort
View
PC
2002
82views Management» more  PC 2002»
13 years 8 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai
SPDP
1991
IEEE
14 years 3 days ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
CCGRID
2007
IEEE
14 years 3 months ago
Reliability Analysis of Self-Healing Network using Discrete-Event Simulation
The number of processors embedded on high performance computing platforms is continuously increasing to accommodate user desire to solve larger and more complex problems. However,...
Thara Angskun, George Bosilca, Graham E. Fagg, Jel...
IPPS
2008
IEEE
14 years 3 months ago
Performance comparison of SGI Altix 4700 and SGI Altix 3700 Bx2
Suitability of the next generation of high-performance computing systems for petascale simulations will depend on a balance between factors such as processor performance, memory p...
Subhash Saini, Dennis C. Jespersen, Dale Talcott, ...
ICPADS
2002
IEEE
14 years 1 months ago
Self-Stabilizing Wormhole Routing on Ring Networks
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
Ajoy Kumar Datta, Maria Gradinariu, Anthony B. Ken...