Bandwidth Allocation with Preemption
From MaRDI portal
Publication:4268843
DOI10.1137/S0097539797321237zbMath0928.68008OpenAlexW1995953287MaRDI QIDQ4268843
Ran Canetti, Yishay Mansour, Baruch Schieber, Amotz Bar-Noy, Shay Kutten
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797321237
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ Dynamic storage allocation with known durations ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ Resource allocation in bounded degree trees
This page was built for publication: Bandwidth Allocation with Preemption
