Providing Quality of Service over Advanced Switching
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Maintaining quality of service with dynamic fault tolerance in fat-trees
HiPC'08 Proceedings of the 15th international conference on High performance computing
Improving the flexibility of the deficit table scheduler
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Studying several proposals for the adaptation of the DTable scheduler to advanced switching
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
The provision of Quality of Service (QoS) in computing and communication environments is currently the focus of much discussion and research in industry and academia. A key component for networks with QoS support is the output scheduling algorithm. Some of the latest network technology proposals define scheduling algorithms that use an arbitration table to select the next packet to be transmitted. These table-based schedulers are simple to implement and can offer good latency performance. However, the versions proposed until now do not work properly with variable packet sizes. Moreover, they face the problem of bounding the bandwidth and latency assignments. In this paper, we propose a new table-based scheduler, which we call Deficit Table (DTable), that works properly with variable packet sizes. We also propose a methodology to decouple the bandwidth and latency assignments.