Minimizing the Flow Time Without Migration

DOI10.1137/S009753970037446XMaRDI QIDQ3149872zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev

Publication date 29 September 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753970037446x

zbMATH Keywords

approximationflow timemigrationonlinescheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing the flow time without migration
• Minimizing flow time on a constant number of machines with preemption
• Minimizing total flow time and total completion time with immediate dispatching
• A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
• scientific article; zbMATH DE number 1559527

Cited in

(11)

• Improved lower bounds for online scheduling to minimize total stretch
• Minimizing flow time on a constant number of machines with preemption
• Non-clairvoyantly scheduling to minimize convex functions
• Improved multi-processor scheduling for flow time and energy
• Approximating total flow time on parallel machines
• Eliminating migration in multi-processor scheduling
• Minimizing the flow time without migration
• Online flow time scheduling in the presence of preemption overhead
• A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
• A scheduling framework for distributed key-value stores and its application to tail latency minimization
• Reallocation problems in scheduling

This page was built for publication: Minimizing the Flow Time Without Migration

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