Constant Bandwidth vs Proportional Share Resource Allocation

Authors:
Luca Abeni;Giuseppe Lipari;Giorgio Buttazzo
Affiliations:
Retis Lab;Retis Lab;Retis Lab
Venue:
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Year:
1999

Citing 0
Cited 6

Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Real-time control system analysis: an integrated approach

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
On adaptive control techniques in real-time resource allocation

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Reward Scheduling for QoS in Cloud Applications

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Brief announcement: application-sensitive QoS scheduling in storage servers

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Resource management for multimedia applications, distributed in open and heterogeneous home networks

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the success of new multimedia technologies, there is a great interest for providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in literature are based on proportional share resource allocation, such as WFQ, WF$^2$Q, EEVDF, or SFQ. In a previous paper, we showed how to perform resource reservation according to a Constant Bandwidth allocation. In this paper we compare Proportional Share and Constant Bandwidth resource allocation strategies, by showing advantages and drawbacks of both techniques.