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

Beitrag in einer Fachzeitschrift
(Originalarbeit)


Details zur Publikation

Autor(en): Ziermann T, Wildermann S, Mühleis N, Teich J
Zeitschrift: Concurrency and Computation-Practice & Experience
Verlag: Wiley-Blackwell
Jahr der Veröffentlichung: 2012
Band: 24
Heftnummer: 16
Seitenbereich: 1903-1917
ISSN: 1532-0626


Abstract


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-Autoren / FAU-Herausgeber

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)


Zitierweisen

APA:
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

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

BibTeX: 

Zuletzt aktualisiert 2018-19-10 um 21:50