Sciweavers

2609 search results - page 266 / 522
» Optimizing for parallelism and data locality
Sort
View
ICCCN
2008
IEEE
16 years 1 months ago
Instrumentation and Analysis of MPI Queue Times on the SeaStar High-Performance Network
—Understanding the communication behavior and network resource usage of parallel applications is critical to achieving high performance and scalability on systems with tens of th...
Ron Brightwell, Kevin T. Pedretti, Kurt B. Ferreir...
IPPS
2005
IEEE
16 years 7 days ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
PDPTA
2007
15 years 8 months ago
Suppressing Independent Loops in Packing/Unpacking Loop Nest to Reduce Message Size for Message-passing Code
- In this paper we experiment with two optimization techniques we are considering implementing in a parallelizing compiler that generates parallel code for a distributed-memory sys...
P. Jerry Martin, Clayton S. Ferner
ISPA
2004
Springer
16 years 20 hour ago
HPL Performance Prevision to Intending System Improvement
HPL is a parallel Linpack benchmark package widely adopted in massive cluster system performance test. On HPL data layout among processors, a law to determine block size NB theoret...
Wenli Zhang, Mingyu Chen, Jianping Fan
RTSS
1997
IEEE
15 years 11 months ago
More optimism about real-time distributed commit processing
In [6], we proposed a new commit protocol, OPT, specially designed for use in distributed firm-deadline real-time database systems. OPT allows transactions to “optimistically...
Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritha...