scientific article; zbMATH DE number 7650321

DOI10.4230/LIPICS.FSTTCS.2019.24MaRDI QIDQ5875658zbMATH OpenFDO

Authors G. Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2019.24

zbMATH Keywords

online algorithmsresource augmentationscheduling

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(4)

• Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
• A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
• A scheduling framework for distributed key-value stores and its application to tail latency minimization
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

This page was built for publication:

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