Deadline-based QoS Algorithms for High-performance Networks

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 results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today’s technology.

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Alejandro Martínez, Francisco José Alfaro, José L. Sánchez, José Duato
• Keywords: Attractive Feature, Deadline First Family, Distributed And Parallel Computing, IPPS 2007, Powerful Qos Provision