A hierarchical fair service curve algorithm for link-sharing, real-time and priority services
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Decay-usage scheduling in multiprocessors
ACM Transactions on Computer Systems (TOCS)
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
IEEE/ACM Transactions on Networking (TON)
An object-oriented framework for modular resource management
IWOOOS '96 Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96)
On Maximum Rate Control of Weighted Fair Scheduling for Transactional Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exact GPS simulation and optimal fair scheduling with logarithmic complexity
IEEE/ACM Transactions on Networking (TON)
Redline: first class support for interactivity in commodity operating systems
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
QoS and resource management in distributed interactive multimedia environments
Multimedia Tools and Applications
QFQ: efficient packet scheduling with tight guarantees
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We propose and analyze a new proportional share allocation algorithm for time shared resources. We assume that the resource is allocated in time quanta of size q. To each client, we associate a weight which determines the relative share from the resource that the client should receive. We define the notion of fairness in the context of an idealized system in which the resource is assumed to be granted in arbitrarily small intervals of time. Mainly, we show that in steady conditions our algorithm guarantees that the difference between the service time that a client should receive in the idealized system and the service time it actually receives in the real system is bounded by the size of a time quantum. The algorithm provides support for dynamic operations, such as a client joining or leaving the competition (for the resource), and changing a client''s weight. By using an efficient augmented binary search tree data structure, these operations are implemented in O(log n), where n reppresents the number of clients competing for the resource.