Online Scheduling to Minimize Average Stretch
From MaRDI portal
Publication:4651543
DOI10.1137/S0097539701387544zbMath1087.68017OpenAlexW2136400145MaRDI QIDQ4651543
No author found.
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701387544
Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (15)
Quantitative fairness for assessing perceived service quality in queues ⋮ The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Average stretch without migration ⋮ Minimizing the stretch when scheduling flows of divisible requests ⋮ Semi-clairvoyant scheduling ⋮ Approximating total flow time on parallel machines ⋮ Improved lower bounds for online scheduling to minimize total stretch ⋮ Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Speed scaling for stretch plus energy ⋮ Greedy multiprocessor server scheduling ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Non-clairvoyant scheduling for weighted flow time ⋮ From Preemptive to Non-preemptive Scheduling Using Rejections ⋮ Online scheduling FIFO policies with admission and push-out
This page was built for publication: Online Scheduling to Minimize Average Stretch
