The following pages link to (Q4526977):
Displaying 43 items.
- The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
- Global EDF scheduling for parallel real-time tasks (Q495918) (← links)
- Temperature aware online algorithms for minimizing flow time (Q501653) (← links)
- Provably good multiprocessor scheduling with resource sharing (Q601053) (← links)
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (Q613790) (← links)
- Sticky-ERfair: a task-processor affinity aware proportional fair scheduler (Q656083) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- An analysis of fixed-priority schedulability on a multiprocessor (Q853595) (← links)
- The non-preemptive scheduling of periodic tasks upon multiprocessors (Q853598) (← links)
- TCP is competitive with resource augmentation (Q987404) (← links)
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems (Q1039307) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- A tighter extra-resource analysis of online deadline scheduling (Q1781800) (← links)
- An approximation algorithm for scheduling trees of malleable tasks (Q1848358) (← links)
- Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117) (← links)
- Online deadline scheduling on faster machines. (Q1853172) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Scheduling many types of calibrations (Q2039673) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- A survey of real-time scheduling on multiprocessor systems (Q2090220) (← links)
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds (Q2149869) (← links)
- Calibration scheduling with time slot cost (Q2173297) (← links)
- Scheduling with variable-length calibrations: two agreeable variants (Q2232596) (← links)
- Multi-core real-time scheduling for generalized parallel task models (Q2251375) (← links)
- Task assignment algorithms for two-type heterogeneous multiprocessors (Q2251393) (← links)
- Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
- Online parallel scheduling of non-uniform tasks: trading failures for energy (Q2348044) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- Sequential vector packing (Q2378514) (← links)
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
- An improved algorithm for online machine minimization (Q2417064) (← links)
- Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness (Q2479534) (← links)
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
- The partitioned dynamic-priority scheduling of sporadic task systems (Q2642543) (← links)
- An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization (Q4561244) (← links)
- Speed is more powerful than clairvoyance (Q5054861) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- Scheduling in the dark (Q5918075) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
