Tracking requirements for augmented reality
Communications of the ACM - Special issue on computer augmented environments: back to the real world
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On-line extraction of SCSI disk drive parameters
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
BubbleUp: low latency fast-scan for media servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Temporally determinate disk access: an experimental approach
Temporally determinate disk access: an experimental approach
Cello: a disk scheduling framework for next generation operating systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Data mining on an OLTP system (nearly) for free
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On Scheduling Atomic and Composite Continuous Media Objects
IEEE Transactions on Knowledge and Data Engineering
Engineering and Analysis of Fixed Priority Schedulers
IEEE Transactions on Software Engineering
Priority Queueing in RAID5 Disk Arrays with an NVS Cache
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Real-time filesystems. Guaranteeing timing constraints for disk accesses in RT-Mach
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Micro-Benchmark Based Extraction of Local and Global Disk
Micro-Benchmark Based Extraction of Local and Global Disk
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Freeblock Scheduling Outside of Disk Firmware
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Design and Implementation of Semi-preemptible IO
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Awarded Best Student Paper! -- A Framework for Building Unobtrusive Disk Maintenance Applications
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Towards higher disk head utilization: extracting free bandwidth from busy disk drives
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
IEEE Communications Magazine
Evaluating block-level optimization through the IO path
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Why specialized disks for composite operations may be unnecessary
ACM SIGARCH Computer Architecture News
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
| Hi-index | 14.98 |
Allowing higher-priority requests to preempt ongoing disk IOs is of particular benefit to delay-sensitive and real-time systems. In this paper, we present Semi-preemptible IO, which divides disk IO requests into small temporal units of disk commands to improve the preemptibility of disk access. We first lay out main design strategies to allow preemption of each component of a disk access驴seek, rotation, and data transfer, namely, seek-splitting, JIT-seek, and chunking. We then present the preemption mechanisms for single and multidisk systems驴JIT-preemption and JIT-migration. The evaluation of our prototype system showed that Semi-preemptible IO substantially improved the preemptibility of disk access with little loss in disk throughput and that preemptive disk scheduling could improve the response time for high-priority interactive requests.