Minimizing flow time nonclairvoyantly

DOI10.1145/792538.792545MaRDI QIDQ3452502zbMATH OpenOpenAlexFDO

Authors Bala Kalyanasundaram, Kirk Pruhs

Publication date 12 November 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/792538.792545

zbMATH Keywords

flow timemultilevel feedbackrandomized algorithmresource augmentationschedulingshortest elapsed time first

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
• scientific article; zbMATH DE number 437567
• Nonclairvoyant scheduling
• Non-clairvoyant scheduling for minimizing mean slowdown

Cited in

(15)

• Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
• Semi-clairvoyant scheduling
• Utilization of nonclairvoyant online schedules
• Approximating total flow time on parallel machines
• An Optimal Strategy for Online Non-uniform Length Order Scheduling
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• Minimizing Average Flow-Time
• scientific article; zbMATH DE number 1962819 (Why is no real title available?)
• Achievable performance of blind policies in heavy traffic
• Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
• Scheduling in the dark
• Nonclairvoyant speed scaling for flow and energy
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework
• Speed scaling of processes with arbitrary speedup curves on a multiprocessor
• Online weighted flow time and deadline scheduling

This page was built for publication: Minimizing flow time nonclairvoyantly

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