Sciweavers

1200 search results - page 45 / 240
» Distributed Data Management for Large Volume Visualization
Sort
View
SPAA
2003
ACM
15 years 5 months ago
Asynchronous parallel disk sorting
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...
Roman Dementiev, Peter Sanders
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 12 days ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
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...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
SOFTVIS
2006
ACM
15 years 5 months ago
Visualizing live software systems in 3D
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...
Orla Greevy, Michele Lanza, Christoph Wysseier
HPCA
2009
IEEE
16 years 12 days ago
PageNUCA: Selected policies for page-grain locality management in large shared chip-multiprocessor caches
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...
Mainak Chaudhuri
HPDC
2000
IEEE
15 years 4 months ago
A Monitoring Sensor Management System for Grid Environments
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, ...
Brian Tierney, Brian Crowley, Dan Gunter, Mason Ho...