Distributed self-organizing bandwidth allocation for priority-based bus communication

Journal article
(Original article)

Publication Details

Author(s): Ziermann T, Wildermann S, Mühleis N, Teich J
Journal: Concurrency and Computation-Practice & Experience
Publisher: Wiley-Blackwell
Publication year: 2012
Volume: 24
Journal issue: 16
Pages range: 1903-1917
ISSN: 1532-0626


The raising complexity in distributed embedded systems makes it necessary that the communication of such systems organizes itself automatically. In this paper, we tackle the problem of sharing bandwidth on priority-based buses. Based on a game theoretic model, reinforcement learning algorithms are proposed that use simple local rules to establish bandwidth sharing. The algorithms require little computational effort and no additional communication. Extensive experiments show that the proposed algorithms establish the desired properties without global knowledge ortextita priori information. It is proven that communication nodes using these algorithms can co-exist with nodes using other scheduling techniques. Finally, we propose a procedure that helps to set the learning parameters according to the desired behavior. Copyright © 2011 John Wiley & Sons, Ltd.

FAU Authors / FAU Editors

Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Wildermann, Stefan Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Ziermann, Tobias
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)

How to cite

Ziermann, T., Wildermann, S., Mühleis, N., & Teich, J. (2012). Distributed self-organizing bandwidth allocation for priority-based bus communication. Concurrency and Computation-Practice & Experience, 24(16), 1903-1917. https://dx.doi.org/10.1002/cpe.1759

Ziermann, Tobias, et al. "Distributed self-organizing bandwidth allocation for priority-based bus communication." Concurrency and Computation-Practice & Experience 24.16 (2012): 1903-1917.


Last updated on 2018-19-10 at 21:50

Share link