Performance of multi-dimensional space-filling curves
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
Scalable Multimedia Disk Scheduling
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
| Hi-index | 0.00 |
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as real-time deadline, and user priority. Previous work on disk scheduling has focused on optimizing the seek times and/or meeting the real-time deadlines. A unified framework for QoS disk scheduling is presented that scales with the number of scheduling parameters. The general idea is based on modeling the disk scheduler requests as points in the multi-dimensional space, where each of the dimensions represents one of the parameters (e.g., one dimension represents the request deadline, another represents the disk cylinder number, and a third dimension represents the priority of the request, etc.). Then the disk scheduling problem reduces to the problem of finding a linear order to traverse these multi-dimensional points. Space-filling curves are adopted to define a linear order for sorting and scheduling objectsthat lie in the multi-dimensional space. This generalizes the one-dimensional disk scheduling algorithms (e.g., EDF, SATF, FIFO). Several techniques are presented to show how a QoS-aware disk scheduler deals with the progressive arrival of requests over time. Simulation experiments are presented to show a comparison of the alternative techniques and to demonstrate the scalability of the proposed QoS-aware disk scheduling algorithm over other traditional approaches.