Sciweavers

2609 search results - page 7 / 522
» Optimizing for parallelism and data locality
Sort
View
SIGCOMM
2009
ACM
15 years 4 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
IEEEPACT
1999
IEEE
15 years 2 months ago
Localizing Non-Affine Array References
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
Nicholas Mitchell, Larry Carter, Jeanne Ferrante
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
15 years 11 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
IPPS
1997
IEEE
15 years 2 months ago
DPF: A Data Parallel Fortran Benchmark Suite
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
Y. Charlie Hu, S. Lennart Johnsson, Dimitris Kehag...
IPPS
2003
IEEE
15 years 3 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...