Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm-Reference-Cited by-同舟云学术

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm

Published:2006-02 Issue:1 Volume:31 Page:85-108
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Becchetti Luca,Leonardi Stefano,Marchetti-Spaccamela Alberto,Schäfer Guido,Vredeveld Tjark

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.1050.0170

Reference26 articles.

1. The Probabilistic Method

2. Banderier C., Beier R., Mehlhorn K. Smoothed analysis of three combinatorial problems28th Internat. Sympos. Math. Foundations Comput. Sci.(2003) Berlin, GermanySpringer198207LNCS, No. 2747

3. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

4. Becchetti L., Leonardi S., Marchetti-Spaccamela A., Schäfer G., Vredeveld T. Average case and smoothed competitive analysis of the multi-level feedback algorithmProc. 44th Annual IEEE Sympos. Foundations Comput. Sci.(2003) 462471

5. Beier R., Vöcking B. Random knapsack in expected polynomial timeProc. 35th Annual ACM Sympos. Theory Comput.(2003) 232241

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multilevel feedback queue: Efficient scheduling and implementation by using dynamic quantum;THE 8TH INTERNATIONAL CONFERENCE AND WORKSHOP ON BASIC AND APPLIED SCIENCE (ICOWOBAS) 2021;2023

2. Beyond the Worst Case: Semi-random Complexity Analysis of Winner Determination;Web and Internet Economics;2022

3. Scheduling Optimization of real-time IOT system based on RNN;2020 International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI);2020-12

4. Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times;Approximation and Online Algorithms;2018

5. On the Smoothness of Paging Algorithms;Theory of Computing Systems;2017-10-13