Pages that link to "Item:Q4406304"
From MaRDI portal
The following pages link to Speed is as powerful as clairvoyance (Q4406304):
Displaying 50 items.
- Speed scaling for maximum lateness (Q255271) (← links)
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911) (← links)
- 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)
- Energy-efficient multiprocessor scheduling for flow time and makespan (Q401300) (← links)
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← links)
- Temperature aware online algorithms for minimizing flow time (Q501653) (← links)
- The distributed wireless gathering problem (Q627160) (← links)
- Competitive algorithms for due date scheduling (Q633847) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- Online tree node assignment with resource augmentation (Q652619) (← links)
- On the competitiveness of AIMD-TCP within a general network (Q690448) (← links)
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor (Q693765) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Competitive analysis of most-request-first for scheduling broadcasts with start-up delay (Q924150) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Bincoloring (Q954994) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- TCP is competitive with resource augmentation (Q987404) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- On the competitiveness of on-line real-time task scheduling (Q1206445) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement (Q1698776) (← links)
- Exact speedup factors and sub-optimality for non-preemptive scheduling (Q1698782) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Minimizing the maximum flow time in batch scheduling (Q1709967) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- A tighter extra-resource analysis of online deadline scheduling (Q1781800) (← links)
- Online deadline scheduling on faster machines. (Q1853172) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Scheduling to minimize energy and flow time in broadcast scheduling (Q2018933) (← 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)
- A resource-competitive jamming defense (Q2075623) (← links)
- A competitive algorithm for throughput maximization on identical machines (Q2164724) (← links)
- Calibration scheduling with time slot cost (Q2173297) (← links)
- Partitioned EDF scheduling: a closer look (Q2251383) (← links)
- Mixed-criticality scheduling on multiprocessors (Q2251396) (← links)
