A Proportional Share Scheduling using Task Satisfaction Index for Quality of Service Guarantees
2012
Most proportional share scheduling algorithms developed to accurately reflect the required resource allocation lead to a lower degree of fairness or suffer from generating higher scheduling overhead. In this paper, we propose a task satisfaction index-based proportional share scheduling algorithm for multimedia systems. Our experimental results show that our scheme outperforms the several existing scheduling algorithms in terms of fairness service error.
Keywords:
- Fair-share scheduling
- Lottery scheduling
- Real-time computing
- Dynamic priority scheduling
- Computer science
- Maximum throughput scheduling
- Fairness measure
- Distributed computing
- Stride scheduling
- Fixed-priority pre-emptive scheduling
- Rate-monotonic scheduling
- Earliest deadline first scheduling
- Round-robin scheduling
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI