Sciweavers

720 search results - page 29 / 144
» Uniform Memory Hierarchies
Sort
View
FSTTCS
2006
Springer
15 years 8 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
ICS
1992
Tsinghua U.
15 years 8 months ago
Optimizing for parallelism and data locality
Previous research has used program transformation to introduce parallelism and to exploit data locality. Unfortunately,these twoobjectives have usuallybeen considered independentl...
Ken Kennedy, Kathryn S. McKinley
ISPDC
2007
IEEE
15 years 10 months ago
Hybrid MPI-Thread Parallelization of the Fast Multipole Method
We present in this paper multi-thread and multi-process parallelizations of the Fast Multipole Method (FMM) for Laplace equation, for uniform and non uniform distributions. These ...
Olivier Coulaud, Pierre Fortin, Jean Roman
CIDR
2007
144views Algorithms» more  CIDR 2007»
15 years 5 months ago
Cache-Oblivious Query Processing
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
Bingsheng He, Qiong Luo
PE
2010
Springer
175views Optimization» more  PE 2010»
14 years 11 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami