Issue No. 07 - July (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.39
Alejandro Martínez Vicente , University of Castilla-La Mancha, Albacete
Georgios Apostolopoulos , Foundation for Research and Technology - Hellas, Heraklion
Francisco J. Alfaro , University of Castilla-La Mancha, Albacete
Jose L. Sánchez , University of Castilla-La Mancha, Albacete
Jose Duato , Technical University of Valencia, Valencia
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because in those environments there are different traffic types, each one having its own requirements. In that sense, deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes these algorithms impractical for high-performance networks. In this paper, we explore how to adapt efficiently the Earliest Deadline First family of algorithms to the high-speed network environments. The results show an excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.
Network Architecture and Design, Packet-switching networks, High-speed
J. Duato, G. Apostolopoulos, J. L. Sánchez, A. Martínez Vicente and F. J. Alfaro, "Efficient Deadline-Based QoS Algorithms for High-Performance Networks," in IEEE Transactions on Computers, vol. 57, no. , pp. 928-939, 2008.