scientific article; zbMATH DE number 1559529
From MaRDI portal
Publication:4526977
Recommendations
- Optimal time-critical scheduling via resource augmentation
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Optimal on-line flow time with resource augmentation
- scientific article; zbMATH DE number 1839473
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
Cited in
(50)- Minimizing the maximum flow time in the online food delivery problem
- Deadline-based scheduling of periodic task systems on multiprocessors.
- Online parallel scheduling of non-uniform tasks: trading failures for energy
- Measuring the problem-relevant information in input
- Scheduling in the dark
- Online deadline scheduling on faster machines.
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- TCP is competitive with resource augmentation
- Scheduling with variable-length calibrations: two agreeable variants
- Resource augmentation in load balancing.
- On the Complexity of Scheduling to Optimize Average Response Time
- Improved competitive algorithms for online scheduling with partial job values
- Off-line admission control for general scheduling problems
- On-line scheduling with tight deadlines.
- A survey of real-time scheduling on multiprocessor systems
- An analysis of fixed-priority schedulability on a multiprocessor
- The non-preemptive scheduling of periodic tasks upon multiprocessors
- The partitioned dynamic-priority scheduling of sporadic task systems
- Online knapsack with resource augmentation
- Speed is more powerful than clairvoyance
- Provably good multiprocessor scheduling with resource sharing
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
- An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
- Task assignment algorithms for two-type heterogeneous multiprocessors
- Applying extra-resource analysis to load balancing.
- Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness
- An approximation algorithm for scheduling trees of malleable tasks
- Online dynamic power management with hard real-time guarantees
- The Canadian tour operator problem on paths: tight bounds and resource augmentation
- Optimal on-line flow time with resource augmentation
- A tighter extra-resource analysis of online deadline scheduling
- Scheduling many types of calibrations
- An improved algorithm for online machine minimization
- Sequential vector packing
- Calibration scheduling with time slot cost
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling
- Multi-core real-time scheduling for generalized parallel task models
- Online weighted flow time and deadline scheduling
- Global EDF scheduling for parallel real-time tasks
- Real-time scheduling with resource sharing on heterogeneous multiprocessors
- Temperature aware online algorithms for minimizing flow time
- Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
- Multiresource malleable task scheduling to minimize response time
- Optimal time-critical scheduling via resource augmentation
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
- A resource-competitive jamming defense
- Speed is as powerful as clairvoyance
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526977)
