Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers.
Róbert SzabóPeter BartaFelician NémethJózsef BíróPublished in: NETWORKING (2000)
Keyphrases
- processor sharing
- worst case
- upper bound
- average case
- lower bound
- randomized algorithms
- error bounds
- worst case bounds
- service times
- greedy algorithm
- worst case analysis
- approximation algorithms
- processor sharing queue
- np hard
- mistake bound
- complexity bounds
- uniform distribution
- vc dimension
- scheduling algorithm
- fluid model
- neural network
- computational complexity
- optimal solution