Sciweavers

340 search results - page 12 / 68
» Data Migration on Parallel Disks
Sort
View
ISCA
1998
IEEE
144views Hardware» more  ISCA 1998»
14 years 2 days ago
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism
This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a faile...
Guillermo A. Alvarez, Walter A. Burkhard, Larry J....
IPPS
2003
IEEE
14 years 1 months ago
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as...
R. J. Honicky, Ethan L. Miller
CCGRID
2011
IEEE
12 years 11 months ago
High Performance Pipelined Process Migration with RDMA
—Coordinated Checkpoint/Restart (C/R) is a widely deployed strategy to achieve fault-tolerance. However, C/R by itself is not capable enough to meet the demands of upcoming exasc...
Xiangyong Ouyang, Raghunath Rajachandrasekar, Xavi...
EUROPAR
1999
Springer
14 years 3 days ago
I/O-Conscious Tiling for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Du...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
SPAA
2004
ACM
14 years 1 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter