References[1] The Linux Source Code.[2] Arcangeli, A. "Evolution of Linux Towards Clustering," EFD R&D Clamart, 2003.[3] Axboe, J. "Deadline I/O Scheduler Tunables," SuSE, EDF R&D, 2003.[4] Corbet, J. "A New Deadline I/O Scheduler," http://lwn.net/Articles/10874.[5] "Anticipatory I/O Scheduling," http://lwn.net/Articles/21274.[6] "The Continuing Development of I/O Scheduling," http://lwn.net/Articles/21274.[7] "Porting Drivers to the 2.5 Kernel," Linux Symposium, Ottawa, Canada, 2003.[8] Heger, D., J. Jacobs, B. McCloskey, and J. Stultz. "Evaluating Systems Performance in the Context of Performance Paths," IBM Technical White Paper, Austin, 2000.[9] Iyer, S. and P. Drushel. "Anticipatory SchedulingA Disk Scheduling Framework to Overcome Deceptive Idleness in Synchronous I/O," SOSP 2001.[10] Irwin, Lee W. III, "A 2.5 Page Clustering Implementation," Linux Symposium, Ottawa, 2003.[11] Nagar, S., H. Franke, J. Choi, C. Seetharaman, S. Kaplan, N. Singhvi, V. Kashyap, and M. Kravetz. "Class-Based Prioritized Resource Control in Linux," 2003 Linux Symposium.[12] McKenney, P. "Stochastic Fairness Queueing," INFOCOM, 1990.[13] Molnar, I. "Goals, Design and Implementation of the New Ultra-scalable O(1) Scheduler" (sched-design.txt).[14] Mosberger, D. and S. Eranian. IA-64 Linux Kernel, Design and Implementation, Prentice Hall, NJ, 2002.[15] Shriver, E., A. Merchant, and J. Wilkes. "An Analytic Behavior Model with Readahead Caches and Request Reordering," Bell Labs, 1998.[16] Wienand, I. "An Analysis of Next Generation Threads on IA64," HP, 2003.[17] Zimmermann, R. and S. Ghandeharizadeh. "Continuous Display Using Heterogeneous Disk-Subsystems," ACM Multimedia, 1997.http://www.specbench.org/sfs97r1/docs/chapter1l. |
لطفا منتظر باشید ...
