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

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Contemporary router/switch technology for high-performance 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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Claver, J. M., Carrión, M. D. C., Canseco, M., Caminero, M. B., & Quiles, F. J. (2005). A new hardware efficient link scheduling algorithm to guarantee QoS on clusters. In Lecture Notes in Computer Science (Vol. 3648, pp. 1046–1056). Springer Verlag. https://doi.org/10.1007/11549468_114

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free