Sciweavers

7 search results - page 1 / 2
» spaa 1995
Sort
View
SPAA
1995
ACM
13 years 9 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
SPAA
2005
ACM
13 years 11 months ago
Finding effective support-tree preconditioners
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ra...
SPAA
1995
ACM
13 years 9 months ago
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias,...