Sciweavers

1299 search results - page 230 / 260
» Why Not Use a Pattern-Based Parallel Programming System
Sort
View
137
Voted
ICS
2007
Tsinghua U.
15 years 8 months ago
A study of process arrival patterns for MPI collective operations
Process arrival pattern, which denotes the timing when different processes arrive at an MPI collective operation, can have a significant impact on the performance of the operatio...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
133
Voted
ANCS
2007
ACM
15 years 6 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
128
Voted
IEEEPACT
2007
IEEE
15 years 8 months ago
JudoSTM: A Dynamic Binary-Rewriting Approach to Software Transactional Memory
With the advent of chip-multiprocessors, we are faced with the challenge of parallelizing performance-critical software. Transactional memory (TM) has emerged as a promising progr...
Marek Olszewski, Jeremy Cutler, J. Gregory Steffan
127
Voted
ACSC
2003
IEEE
15 years 7 months ago
Communication Performance Issues for Two Cluster Computers
Clusters of commodity machines have become a popular way of building cheap high performance parallel computers. Many of these designs rely on standard Ethernet networks as a syste...
Francis Vaughan, Duncan A. Grove, Paul D. Coddingt...
123
Voted
IPPS
2007
IEEE
15 years 8 months ago
Invited Paper: A Compile-time Cost Model for OpenMP
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. It is also a promising candidate to exploit the emer...
Chunhua Liao, Barbara M. Chapman