Efficient Deadline-Based QoS Algorithms for High-Performance Networks

Alejandro Mart, Georgios Apostolopoulos, Francisco J. Alfaro, Jose L. S, Jose Duato
2008 IEEE transactions on computers  
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for highperformance networks. In this paper, we explore how to adapt efficiently the Earliest Deadline First family of algorithms to the high-speed networks environments. The
more » ... vironments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.
doi:10.1109/tc.2008.39 fatcat:7gks3zjtl5h5jmxsr5l2jwz3hq