Online time-constrained scheduling in linear and ring networks
From MaRDI portal
Publication:616984
DOI10.1016/j.jda.2010.07.001zbMath1203.90070OpenAlexW2007005516MaRDI QIDQ616984
Gabriel Scalosub, Adi Rosén, Joseph (Seffi) Naor
Publication date: 20 January 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.07.001
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the competitiveness of on-line real-time task scheduling
- Time-constrained scheduling of weighted packets on trees and meshes
- Scheduling time-constrained communication in linear networks
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
- Efficient On-Line Call Control Algorithms
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- On-line competitive algorithms for call admission in optical networks