Competitive analysis of on-line disk scheduling

DOI10.1007/BFB0009512zbMATH Open1512.68051MaRDI QIDQ6487455FDOQ6487455

Authors: Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen 

Publication date: 25 January 2023

Recommendations

• Competitive analysis of on-line disk scheduling
• New algorithms for disk scheduling
• The \(k\)-client problem
• Optimal read-once parallel disk scheduling
• Beyond Competitive Analysis

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive paging algorithms
• Competitive \(k\)-server algorithms
• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
• On the Expected Performance of Scanning Disks
• An anomaly in disk scheduling
• A comparative analysis of disk scheduling policies

Cited In (5)

• New algorithms for disk scheduling
• A disk scheduling algorithm: SPFF
• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
• Improved disk scheduling algorithms based on rotational position
• Evaluating disk idle behavior by leveraging disk schedulers

This page was built for publication: Competitive analysis of on-line disk scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487455)