Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Analysis of Scanning Policies for Reducing Disk Seek Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object-oriented operating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pairing heap: A new form of self-adjusting heap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Adjusting Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of disk scheduling policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anomaly in disk scheduling / rank
 
Normal rank

Revision as of 14:59, 16 May 2024

scientific article
Language Label Description Also known as
English
Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
scientific article

    Statements

    Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    on-line problem
    0 references
    amortized analysis
    0 references
    disk scheduling
    0 references