1200 search results - page 45 / 240 » Distributed Data Management for Large Volume Visualization |
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
125
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
109
click to vote
SOFTVIS
2006
ACM
15 years 8 months ago
2006
ACM
The analysis of the runtime behavior of a software system yields vast amounts of information, making accurate interpretations difficult. Filtering or compression techniques are o...
114
click to vote
HPCA
2009
IEEE
16 years 3 months ago
2009
IEEE
As the last-level on-chip caches in chip-multiprocessors increase in size, the physical locality of on-chip data becomes important for delivering high performance. The non-uniform...
154
click to vote
HPDC
2000
IEEE
15 years 6 months ago
2000
IEEE
Large distributed systems such as Computational Grids require a large amount of monitoring data be collected for a variety of tasks such as fault detection, performance analysis, ...