Sciweavers

652 search results - page 95 / 131
» The Distributed Flight Array
Sort
View
ICPADS
2000
IEEE
15 years 10 months ago
A Practical Nonblocking Queue Algorithm Using Compare-and-Swap
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...
Chien-Hua Shann, Ting-Lu Huang, Cheng Chen
IPPS
2000
IEEE
15 years 10 months ago
Using Time Skewing to Eliminate Idle Time due to Memory Bandwidth and Network Limitations
Time skewing is a compile-time optimization that can provide arbitrarily high cache hit rates for a class of iterative calculations, given a sufficient number of time steps and s...
David Wonnacott
SPAA
2000
ACM
15 years 10 months ago
DCAS-based concurrent deques
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
Ole Agesen, David Detlefs, Christine H. Flood, Ale...
PPOPP
1999
ACM
15 years 10 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
ICPP
1999
IEEE
15 years 10 months ago
Compiler Optimizations for I/O-Intensive Computations
This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...