Constant bandwidth vs. proportional share resource allocation
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 107-111
- https://doi.org/10.1109/mmcs.1999.778154
Abstract
Due to the success of new multimedia technologies, there is a great interest in providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in the literature are based on proportional share resource allocation, such as WFQ, WF/sup 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.Keywords
This publication has 7 references indexed in Scilit:
- A proportional share resource allocation algorithm for real-time, time-shared systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simulation and tracing of hybrid task sets on distributed systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Integrating multimedia applications in hard real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1998
- A hierarchial CPU scheduler for multimedia operating systemsPublished by Association for Computing Machinery (ACM) ,1996
- Scheduling aperiodic tasks in dynamic priority systemsReal-Time Systems, 1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989