scientific article; zbMATH DE number 1303566
From MaRDI portal
Publication:4250192
zbMath0929.68012MaRDI QIDQ4250192
No author found.
Publication date: 25 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Quantitative fairness for assessing perceived service quality in queues ⋮ Average stretch without migration ⋮ Scheduling algorithms for procrastinators ⋮ Minimizing the stretch when scheduling flows of divisible requests ⋮ Instability of SRPT, SERPT and SJF multiclass queueing networks ⋮ Improved lower bounds for online scheduling to minimize total stretch ⋮ Stability of linear EDF networks with resource sharing ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Competitive analysis of scheduling algorithms for aggregated links ⋮ Resource allocation algorithms for virtualized service hosting platforms ⋮ On cluster resource allocation for multiple parallel task graphs ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ Parallel scheduling problems in next generation wireless networks ⋮ Scheduling to minimize staleness and stretch in real-time data warehouses ⋮ Minimizing flow time on a constant number of machines with preemption ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ Off-line admission control for general scheduling problems ⋮ Local edge minimality of SRPT networks with shared resources ⋮ On-line scheduling to minimize Max flow time: an optimal preemptive algorithm ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
This page was built for publication: