Simple two-priority, low-jitter scheduler

Authors:
Wladek Olesinski;Hans Eberle
Affiliations:
Oracle, Sun Labs, Menlo Park, CA;Oracle, Sun Labs, Menlo Park, CA
Venue:
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Year:
2010

Citing 6
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Simple Fairness Protocols for Daisy Chain Interconnects

HOTI '09 Proceedings of the 2009 17th IEEE Symposium on High Performance Interconnects
Algorithm for computer control of a digital plotter

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many papers on emulations of Generalized Processor Sharing (GPS) have been published. The algorithms and their implementations are often very complex and/or generate a bursty output. In this paper, we present a simple two-priority scheduler that can be easily implemented in hardware, making it especially interesting for Networks on Chips (NoCs), and other applications dealing with stringent resource constraints.