A new hardware efficient link scheduling algorithm to guarantee qos on clusters

  • Authors:
  • José Manuel Claver;María del Carmen Carrión;Manel Canseco;María Blanca Caminero;Francisco José Quiles

  • Affiliations:
  • Dept. of Computer Science and Engineering. E.S.T.C.E., Univ. Jaume I, Castellón, Spain;Dept. of Computer Science, Escuela Politécnica Superior, Univ. de Castilla-La Mancha, Albacete, Spain;Dept. of Computer Science and Engineering. E.S.T.C.E., Univ. Jaume I, Castellón, Spain;Dept. of Computer Science, Escuela Politécnica Superior, Univ. de Castilla-La Mancha, Albacete, Spain;Dept. of Computer Science, Escuela Politécnica Superior, Univ. de Castilla-La Mancha, Albacete, Spain

  • Venue:
  • Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Contemporary router/switch technology for high-perfor- mance local/system area networks (LANs/SANs) should provide the capacity to fit the high bandwidth and timing requirements demanded by current applications. The MultiMedia Router (MMR) aims at offering hardware-based QoS support within a compact interconnection component. One of the key elements in the MMR architecture is the link scheduling algorithm. This algorithm must solve conflicts among data flows that share an input physical link. Required solutions are motivated by chances for parallelization and pipelining, while providing the necessary support both to multimedia flows and to best-effort traffic. In this work, a cost-aware link scheduling based on the temperature coding of priority value associated to every head flit is presented and evaluated.