scientific article; zbMATH DE number 1559529
From MaRDI portal
Publication:4526977
zbMath0962.68010MaRDI QIDQ4526977
Joel M. Wein, Eric Torng, Clifford Stein, Cynthia A. Phillips
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Improved competitive algorithms for online scheduling with partial job values, Speed is more powerful than clairvoyance, Sequential vector packing, Online weighted flow time and deadline scheduling, Efficient algorithms for scheduling parallel jobs with interval constraints in clouds, The Canadian tour operator problem on paths: tight bounds and resource augmentation, 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, An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization, Measuring the problem-relevant information in input, Provably good multiprocessor scheduling with resource sharing, Calibration scheduling with time slot cost, Optimizing bandwidth allocation in elastic optical networks with application to scheduling, Online knapsack with resource augmentation, {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines, An improved algorithm for online machine minimization, On-line scheduling with tight deadlines., Minimizing the maximum flow time in the online food delivery problem, Sticky-ERfair: a task-processor affinity aware proportional fair scheduler, Scheduling with variable-length calibrations: two agreeable variants, Global EDF scheduling for parallel real-time tasks, Temperature aware online algorithms for minimizing flow time, Multi-core real-time scheduling for generalized parallel task models, Task assignment algorithms for two-type heterogeneous multiprocessors, Real-time scheduling with resource sharing on heterogeneous multiprocessors, Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness, TCP is competitive with resource augmentation, A tighter extra-resource analysis of online deadline scheduling, New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling, Scheduling in the dark, Scheduling many types of calibrations, A resource-competitive jamming defense, An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems, A survey of real-time scheduling on multiprocessor systems, Resource augmentation in load balancing., Applying extra-resource analysis to load balancing., An approximation algorithm for scheduling trees of malleable tasks, Off-line admission control for general scheduling problems, Deadline-based scheduling of periodic task systems on multiprocessors., Online deadline scheduling on faster machines., Online parallel scheduling of non-uniform tasks: trading failures for energy, Online dynamic power management with hard real-time guarantees
