Analysis of methods for scheduling low priority disk drive tasks

Performance Evaluation Review

Volumn 30, Issue 1, 2002, Pages 55-65

  Bachmat, Eitan ^a   Schindler, Jiri ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; LAPLACE TRANSFORMS; MAGNETIC DISK STORAGE; MATHEMATICAL MODELS; PROBABILITY DENSITY FUNCTION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SERVERS;

CLOSED FORM SOLUTION; GREEDY ALGORITHMS; RECONSTRUCTION TIME;

ALGORITHMS;

EID: 0036041127     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/511399.511342     Document Type: Conference Paper

References (22)

1. Analysis of SRPT scheduling: Investigating unfairness
2. The M/G/1 queue with permanent customers
3. Fast, on-line failure recovery in redundant disk arrays
4. Asymptotic distribution for the cost of linear probing hashing
5. Towards higher disk head utilization: Extracting free bandwidth from busy disk drives
6. An analytical model of reconstruction time in mirrored disks
7. Performance analysis of disk arrays under failure
8. A case for redundant arrays of inexpensive disks (RAID)
9. The asymptotic distribution of maximum tree size in a random forest
10. Linear probing: The probable largest search time grows logarithmically with the number of records
11. The design and implementation of a log-structured file system
12. An introduction to disk drive modeling
13. Track-aligned extents: Matching access patterns to disk drive characteristics
14. Approximate solutions for M/G/1 fork-join synchronization
15. Performance analysis of RAID5 disk arrays with a vacationing server model for rebuild mode operation