13 search results - page 1 / 3 » Optimal Read-Once Parallel Disk Scheduling |
ALGORITHMICA
2005
13 years 4 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
ICDCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Multi-dimensional storage virtualization (MDSV) allows multiple virtual disks, each with a distinct combination of capacity, latency and bandwidth requirements, to be multiplexed ...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
VLDB
1997
ACM
13 years 9 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...