Y. Li, S.-M. Tan, Z. Chen, and R. H. Campbell. Disk scheduling with dynamic request priorities. Technical report. University of Illinois at Urbana-Champaign, IL, August 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
System Support for Online Reconfiguration - Soules, Appavoo, Hui.. (2003) (7 citations) (Correct)
....is relaxed but is non scalable [38] In addition to the work done in different reconfiguration mechanisms, many groups have applied online reconfiguration to systems and achieved a variety of benefits. Many different adaptive techniques have been implemented to improve system performance [2, 25, 35]. Extensible operating systems have shown performance benefits for a number of interesting applications [7, 19, 49] Technologies such as compiler directed I O prefetching [10] and storage latency estimation descriptors [39] improve application performance using detailed knowledge about the state ....
Y. Li, S.-M. Tan, Z. Chen, and R. H. Campbell. Disk scheduling with dynamic request priorities. Technical report. University of Illinois at UrbanaChampaign, IL, August 1995.
Performance Analysis of Storage Systems - Shriver, Hillyer, Silberschatz (Correct)
....usually are considered to be trade secrets. This section will discuss a few success stories. 4. 1 Disks Disk Scheduling Numerous studies have investigated the performance of disk I O scheduling algorithms involving command queuing (e.g. 18, 51, 52, 63, 64, 65] real time applications (e.g. [66, 67, 68, 69]) and database applications (e.g. 70] Event driven simulation studies of disk scheduling algorithms that use rotational position information appear in [52] these studies were used by Hewlett Packard s Disk Memory Division in the design of products. Disk Cache Performance evaluation methods ....
Y. Li, S.-M. Tan, Z. Chen, and R. H. Campbell, \Disk scheduling with dynamic request priorities," tech. rep., Department of Computer Science, University of Illinois at Urbana-Champaign, IL, Aug. 1995.
Performance Modeling for Realistic Storage Devices - Shriver (1997) (13 citations) (Correct)
.... algorithms for real time applications: priority FCFS [Abbott89] EDF (Earliest Deadline First) P SCAN (Priority SCAN) FDSCAN (Feasible Deadline SCAN) SSEDO (Shortest Seek and Earliest Deadline by Ordering) SSEDV (Shortest Seek and Earliest Deadline by Value) Chen90] Greedy Priority Inversion [Li95], and Preempted Missed Only (PMO) Chen94] There has also been research in scheduling algorithms 40 for database applications (Priority based scheduling [Carey89] and in distributed scheduling [Worthington95a] We restrict our attention to FCFS, CLOOK, and SPTF because: FCFS is the standard ....
Yongcheng Li, See-Mong Tan, Zhigang Chen, and Roy H. Campbell. Disk scheduling with dynamic request priorities. Technical report. University of Illinois at Urbana-Champaign, IL, August 1995.
System Support for Online Reconfiguration - Craig Soules Jonathan (2003) (7 citations) (Correct)
No context found.
Y. Li, S.-M. Tan, Z. Chen, and R. H. Campbell. Disk scheduling with dynamic request priorities. Technical report. University of Illinois at Urbana-Champaign, IL, August 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC