6533b853fe1ef96bd12ad342

RESEARCH PRODUCT

Deadline-based QoS Algorithms for High-performance Networks

José DuatoFrancisco J. AlfaroJosé L. SánchezAlejandro Martínez

subject

Earliest deadline first schedulingPacket switchingbusiness.industryNetwork packetComputer scienceQuality of serviceDistributed computingFeature (machine learning)businessAlgorithmComputer networkScheduling (computing)

description

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 high-performance 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.

yearjournalcountryeditionlanguage
2007-01-012007 IEEE International Parallel and Distributed Processing Symposium
https://doi.org/10.1109/ipdps.2007.370288