A continuum of disk scheduling algorithms
ACM Transactions on Computer Systems (TOCS)
Polling and greedy servers on a line
Queueing Systems: Theory and Applications
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Formal requirements for virtualizable third generation architectures
Communications of the ACM
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Dynamic Programming
Xen and the art of virtualization
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Analysis of the Intel Pentium's ability to support a secure virtual machine monitor
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
A linux implementation validation of track-aligned extents and track-aligned RAIDs
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
The origin of the VM/370 time-sharing system
IBM Journal of Research and Development
Virtualizing high-performance graphics cards for driver design and development
CASCON '09 Proceedings of the 2009 Conference of the Center for Advanced Studies on Collaborative Research
A framework for virtual device driver development and virtual device-based performance modeling
A framework for virtual device driver development and virtual device-based performance modeling
| Hi-index | 0.00 |
A method for predicting the performance of disk scheduling algorithms on real machines using only their performance on virtual machines is suggested. The method uses a dynamically loaded kernel intercept probe (iprobe ) to adjust low-level virtual device timing to match that of a simple model derived from the real device. An example is provided in which the performance of a newly proposed disk scheduling algorithm is compared with that of standard Linux algorithms. The advantage of the proposed method is that reasonable performance predictions may be made without dedicated measurement platforms and with only relatively limited knowledge of the performance characteristics of the targeted devices.