Sciweavers

139 search results - page 23 / 28
» Constructive and Adaptable Distributed Shared Memory
Sort
View
SPAA
1995
ACM
13 years 11 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
IPPS
2005
IEEE
14 years 1 months ago
Runtime Empirical Selection of Loop Schedulers on Hyperthreaded SMPs
Hyperthreaded (HT) and simultaneous multithreaded (SMT) processors are now available in commodity workstations and servers. This technology is designed to increase throughput by e...
Yun Zhang, Michael Voss
EMSOFT
2006
Springer
13 years 11 months ago
Mixing signals and modes in synchronous data-flow systems
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...
Jean-Louis Colaço, Grégoire Hamon, M...
IPPS
2003
IEEE
14 years 22 days ago
Extending OpenMP to Support Slipstream Execution Mode
OpenMP has emerged as a widely accepted standard for writing shared memory programs. Hardware-specific extensions such as data placement are usually needed to improve the scalabi...
Khaled Z. Ibrahim, Gregory T. Byrd
CCGRID
2004
IEEE
13 years 11 months ago
Unifier: unifying cache management and communication buffer management for PVFS over InfiniBand
The advent of networking technologies and high performance transport protocols facilitates the service of storage over networks. However, they pose challenges in integration and i...
Jiesheng Wu, Pete Wyckoff, Dhabaleswar K. Panda, R...