Sciweavers

946 search results - page 9 / 190
» Maximizing data locality in distributed systems
Sort
View
EUC
2006
Springer
13 years 11 months ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen
SC
2004
ACM
14 years 24 days ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
IPPS
1996
IEEE
13 years 11 months ago
Maximizing Speedup through Self-Tuning of Processor Allocation
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
Thu D. Nguyen, Raj Vaswani, John Zahorjan
AAAI
2010
13 years 8 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He
CLUSTER
2006
IEEE
14 years 1 months ago
Positioning Dynamic Storage Caches for Transient Data
Simulations, experiments and observatories are generating a deluge of scientific data. Even more staggering is the ever growing application demand to process and assimilate these...
Sudharshan S. Vazhkudai, Douglas Thain, Xiaosong M...