scientific article; zbMATH DE number 1305455
From MaRDI portal
Publication:4252341
zbMath0934.68021MaRDI QIDQ4252341
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization ⋮ An improved algorithm for online machine minimization ⋮ On-line scheduling with tight deadlines. ⋮ A constant-approximate feasibility test for multiprocessor real-time scheduling ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling ⋮ On packet scheduling with adversarial jamming and speedup ⋮ Meeting Deadlines: How Much Speed Suffices? ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing ⋮ Resource augmentation in load balancing. ⋮ Applying extra-resource analysis to load balancing. ⋮ The limited-preemptive feasibility of real-time tasks on uniprocessors
Uses Software
