TY - GEN

T1 - Distortion-Oblivious Algorithms for Minimizing Flow Time

AU - Azar, Yossi

AU - Leonardi, Stefano

AU - Touitou, Noam

N1 - Publisher Copyright:
Copyright © 2022 by SIAM Unauthorized reproduction of this article is prohibited.

PY - 2022

Y1 - 2022

N2 - We consider the classic online problem of scheduling on a single machine to minimize total flow time. In STOC 2021, the concept of robustness to distortion in processing times was introduced: for every distortion factor, an 12o-competitive algorithm ALG which handles distortions up to was presented. However, using that result requires one to know the distortion of the input in advance, which is impractical. We present the first distortion-oblivious algorithms: algorithms which are competitive for every input of every distortion, and thus do not require knowledge of the distortion in advance. Moreover, the competitive ratios of our algorithms are ~1o, which is a quadratic improvement over the algorithm from STOC 2021, and is nearly optimal (we show a randomized lower bound of O1o on competitiveness).

AB - We consider the classic online problem of scheduling on a single machine to minimize total flow time. In STOC 2021, the concept of robustness to distortion in processing times was introduced: for every distortion factor, an 12o-competitive algorithm ALG which handles distortions up to was presented. However, using that result requires one to know the distortion of the input in advance, which is impractical. We present the first distortion-oblivious algorithms: algorithms which are competitive for every input of every distortion, and thus do not require knowledge of the distortion in advance. Moreover, the competitive ratios of our algorithms are ~1o, which is a quadratic improvement over the algorithm from STOC 2021, and is nearly optimal (we show a randomized lower bound of O1o on competitiveness).

UR - http://www.scopus.com/inward/record.url?scp=85130763213&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85130763213

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 252

EP - 274

BT - ACM-SIAM Symposium on Discrete Algorithms, SODA 2022

PB - Association for Computing Machinery

Y2 - 9 January 2022 through 12 January 2022

ER -