Pages that link to "Item:Q5957573"

The following pages link to Optimal time-critical scheduling via resource augmentation (Q5957573):

Displaying 46 items.

• Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
• (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436) (← links)
• Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← links)
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211) (← links)
• Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
• The distributed wireless gathering problem (Q627160) (← links)
• Partition oriented frame based fair scheduler (Q666161) (← links)
• On the competitiveness of AIMD-TCP within a general network (Q690448) (← links)
• Reallocation problems in scheduling (Q747625) (← links)
• The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732) (← links)
• Bincoloring (Q954994) (← links)
• Resource augmented semi-online bounded space bin packing (Q967321) (← links)
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
• Improved multiprocessor global schedulability analysis (Q993508) (← links)
• Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
• Minimizing the maximum starting time on-line (Q1763375) (← links)
• Narrowing the speedup factor gap of partitioned EDF (Q2051780) (← links)
• Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
• Calibrations scheduling with arbitrary lengths and activation length (Q2066688) (← links)
• Online machine minimization with lookahead (Q2156292) (← links)
• A competitive algorithm for throughput maximization on identical machines (Q2164724) (← links)
• Laxity dynamics and LLF schedulability analysis on multiprocessor platforms (Q2251352) (← links)
• Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
• Online bin packing with resource augmentation (Q2427692) (← links)
• A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
• Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
• Online bottleneck matching (Q2436671) (← links)
• The online knapsack problem: advice and randomization (Q2437775) (← links)
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
• Greedy multiprocessor server scheduling (Q2466596) (← links)
• Schedulability analysis of global EDF (Q2479890) (← links)
• Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems (Q2481261) (← links)
• Optimal on-line flow time with resource augmentation (Q2489955) (← links)
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
• From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
• Meeting Deadlines: How Much Speed Suffices? (Q3012809) (← links)
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088) (← links)
• An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization (Q4561244) (← links)
• On the Complexity of Minimizing the Total Calibration Cost (Q4632198) (← links)
• Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing (Q4685726) (← links)
• (Q5090369) (← links)
• (Q5743473) (← links)
• On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
• Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
• A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
• A competitive algorithm for throughput maximization on identical machines (Q6589759) (← links)