Sciweavers

862 search results - page 99 / 173
» Optimal task placement to improve cache performance
Sort
View
ICPP
1999
IEEE
15 years 2 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...
ESWS
2009
Springer
15 years 4 months ago
Improving Ontology Matching Using Meta-level Learning
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...
Kai Eckert, Christian Meilicke, Heiner Stuckenschm...
ICALP
2010
Springer
14 years 11 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
ISCA
2012
IEEE
302views Hardware» more  ISCA 2012»
13 years 6 days ago
Scale-out processors
The emergence of global-scale online services has galvanized scale-out software, characterized by splitting vast datasets and massive computation across many independent servers. ...
Pejman Lotfi-Kamran, Boris Grot, Michael Ferdman, ...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 10 months ago
Accelerating Large-scale Data Exploration through Data Diffusion
Data-intensive applications often require exploratory analysis of large datasets. If analysis is performed on distributed resources, data locality can be crucial to high throughpu...
Ioan Raicu, Yong Zhao, Ian T. Foster, Alexander S....