An Adaptive Arbitration Algorithm for Fair Bandwidth Allocation, Low Latency and Maximum CPU Utilization

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Utilization of adaptive algorithm for fair bandwidth allocation, low latency and maximum CPU utilization is proved to be a promising approach for designing system-on-chip for future applications. Adaptive arbitration is more advantageous then the other conventional arbitration algorithms for several reasons; these include fair bandwidth allocation among different masters, simple design and low cost over head. This article provides a comprehensive picture of research and developments in dynamic arbitration algorithm for masters according to the different traffic behavior. The papers published in standard journals are reviewed, classified according to their objectives and presented with a general conclusion. © Springer-Verlag Berlin Heidelberg 2012.

Cite

CITATION STYLE

APA

Akhtar, M. N., & Sidek, O. (2012). An Adaptive Arbitration Algorithm for Fair Bandwidth Allocation, Low Latency and Maximum CPU Utilization. In Communications in Computer and Information Science (Vol. 293 PART 1, pp. 330–343). https://doi.org/10.1007/978-3-642-30507-8_29

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