Optimal time-critical scheduling via resource augmentation
From MaRDI portal
Publication:5957573
Recommendations
- scientific article; zbMATH DE number 1559529
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- scientific article; zbMATH DE number 1839473
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Optimal on-line flow time with resource augmentation
Cited in
(51)- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- From preemptive to non-preemptive scheduling using rejections
- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- The distributed wireless gathering problem
- On the Complexity of Minimizing the Total Calibration Cost
- Reallocation problems in scheduling
- Meeting deadlines: how much speed suffices?
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources
- A competitive algorithm for throughput maximization on identical machines
- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices
- Bincoloring
- Online bottleneck matching
- scientific article; zbMATH DE number 1839473 (Why is no real title available?)
- Schedulability analysis of global EDF
- The online knapsack problem: advice and randomization
- Narrowing the speedup factor gap of partitioned EDF
- Non-clairvoyantly scheduling to minimize convex functions
- Minimizing the maximum starting time on-line
- The feasibility of general task systems with precedence constraints on multiprocessor platforms
- Resource augmented semi-online bounded space bin packing
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- Serve or skip: the power of rejection in online bottleneck matching
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- On packet scheduling with adversarial jamming and speedup
- Online bin packing with resource augmentation
- Scheduling heterogeneous processors isn't as easy as you think
- Partition oriented frame based fair scheduler
- On the competitiveness of AIMD-TCP within a general network
- (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation
- Improved multiprocessor global schedulability analysis
- Greedy multiprocessor server scheduling
- Optimal on-line flow time with resource augmentation
- Calibrations scheduling with arbitrary lengths and activation length
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
- Handling critical jobs online: deadline scheduling and convex-body chasing
- A constant-approximate feasibility test for multiprocessor real-time scheduling
- scientific article; zbMATH DE number 1559529 (Why is no real title available?)
- Improved multi-processor scheduling for flow time and energy
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
- Submodular secretary problem with shortlists
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- A competitive algorithm for throughput maximization on identical machines
- Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
- Online machine minimization with lookahead
This page was built for publication: Optimal time-critical scheduling via resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957573)
