Optimal time-critical scheduling via resource augmentation
From MaRDI portal
Publication:5957573
DOI10.1007/S00453-001-0068-9zbMATH Open0990.68022OpenAlexW204261080MaRDI QIDQ5957573FDOQ5957573
Authors: Cynthia Phillips, Clifford Stein, Eric Torng, Joel Wein 
Publication date: 7 March 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc686106/
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
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (51)
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- On the competitiveness of AIMD-TCP within a general network
- Greedy multiprocessor server scheduling
- Title not available (Why is that?)
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- Meeting deadlines: how much speed suffices?
- Online bottleneck matching
- The feasibility of general task systems with precedence constraints on multiprocessor platforms
- A constant-approximate feasibility test for multiprocessor real-time scheduling
- Schedulability analysis of global EDF
- Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
- Bincoloring
- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
- 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
- From preemptive to non-preemptive scheduling using rejections
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- On packet scheduling with adversarial jamming and speedup
- An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices
- Minimizing the maximum starting time on-line
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Non-clairvoyantly scheduling to minimize convex functions
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
- Online machine minimization with lookahead
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- A competitive algorithm for throughput maximization on identical machines
- Title not available (Why is that?)
- Optimal on-line flow time with resource augmentation
- Improved multi-processor scheduling for flow time and energy
- Resource augmented semi-online bounded space bin packing
- The online knapsack problem: advice and randomization
- Title not available (Why is that?)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- A competitive algorithm for throughput maximization on identical machines
- The distributed wireless gathering problem
- Narrowing the speedup factor gap of partitioned EDF
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources
- Serve or skip: the power of rejection in online bottleneck matching
- Online bin packing with resource augmentation
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- Calibrations scheduling with arbitrary lengths and activation length
- Improved multiprocessor global schedulability analysis
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Scheduling heterogeneous processors isn't as easy as you think
- Partition oriented frame based fair scheduler
- On the Complexity of Minimizing the Total Calibration Cost
- Reallocation problems in scheduling
- (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation
- Handling critical jobs online: deadline scheduling and convex-body chasing
Uses Software
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)
