Add to ORKGAs part of our research into improving synthetic, block-level I/O workloads, we developed an algorithm that gener-ates a synthetic disk access pattern based on given distribu-tions of both (1) sectors accessed and (2) “jump distances” between successive disk accesses. Generating a synthetic disk access pattern that maintains both distributions exactly is an NP-complete problem (similar to the Traveling Sales-man problem). In this paper, we (1) discuss our approxima-tion algorithm, (2) show that it runs in a reasonable amount of time, (3) show that it reproduces both distributions with reasonable accuracy, and (4) demonstrate its overall effect on the quality of block-level synthetic workloads. 1
With the widening gap between processor speeds and disk access speeds, the I/O bottleneck has become...
The amortized analysis is a useful tool for analyzing the time-complexity of performing a sequence o...
We present a formal analysis of the database layout problem, i.e., the problem of determining how da...
As part of our on-going research into improving the quality of synthetic, block-level I/O workloads,...
For the design and analysis of algorithms that process huge data sets, a machine model is needed tha...
disk layout algorithms, seek distance optimization, disk data placement, disk reorganization © Copyr...
For the design and analysis of algorithms that process huge data sets, a machine model is needed tha...
is defined. V(R) maintains a current SCAN direction (in or out) and services next the request with t...
Synthetic disk request traces are convenient and popular workloads for performance evaluation of sto...
We prove a new lower bound on the critical density ρc of the hard disk model, i.e., the density belo...
In this thesis, we propose a self-tuning approach for automatically selecting and refining the file ...
We consider the problem of placing n points, each one inside its own, prespecified disk, with the ob...
High performance applications involving large data sets require the efficient and flexible use of mu...
High performance applications involving large data sets require the efficient and flexible use of mu...
Rotational position optimization disk scheduling algorithms utilize seek distance versus rotational...
With the widening gap between processor speeds and disk access speeds, the I/O bottleneck has become...
The amortized analysis is a useful tool for analyzing the time-complexity of performing a sequence o...
We present a formal analysis of the database layout problem, i.e., the problem of determining how da...
As part of our on-going research into improving the quality of synthetic, block-level I/O workloads,...
For the design and analysis of algorithms that process huge data sets, a machine model is needed tha...
disk layout algorithms, seek distance optimization, disk data placement, disk reorganization © Copyr...
For the design and analysis of algorithms that process huge data sets, a machine model is needed tha...
is defined. V(R) maintains a current SCAN direction (in or out) and services next the request with t...
Synthetic disk request traces are convenient and popular workloads for performance evaluation of sto...
We prove a new lower bound on the critical density ρc of the hard disk model, i.e., the density belo...
In this thesis, we propose a self-tuning approach for automatically selecting and refining the file ...
We consider the problem of placing n points, each one inside its own, prespecified disk, with the ob...
High performance applications involving large data sets require the efficient and flexible use of mu...
High performance applications involving large data sets require the efficient and flexible use of mu...
Rotational position optimization disk scheduling algorithms utilize seek distance versus rotational...
With the widening gap between processor speeds and disk access speeds, the I/O bottleneck has become...
The amortized analysis is a useful tool for analyzing the time-complexity of performing a sequence o...
We present a formal analysis of the database layout problem, i.e., the problem of determining how da...