Multi-level hierarchical scheduling in ethernet switches

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

Santos, R (Author) Other; Behnam, M (Author) Other; Nolte, T (Author) Other; Pedreiras, P (Author) Other; Luis Almeida (Author) FEUP

Conference proceedings International

Title: Embedded Systems Week 2011, ESWEEK 2011 - Proceedings of the 9th ACM International Conference on Embedded Software, EMSOFT'11

Pages: 185-194

Embedded Systems Week 2011, ESWEEK 2011 - 9th ACM International Conference on Embedded Software, EMSOFT'11

Taipei, 9 October 2011 through 14 October 2011

Indexing

Scopus - 24 Citations

Other information

Authenticus ID: P-008-109

DOI: 10.1145/2038642.2038671

Abstract (EN): The complexity of Networked Embedded Systems (NES) has been growing steeply, due to increases both in size and functionality, and is becoming a major development concern. This situation is pushing for paradigm changes in NES design methodologies towards higher composability and flexibility. Component-oriented design technologies, in particular supported by server-based scheduling, seem to be good candidates to provide the needed properties. As a response we developed a multi-level hierarchical serverbased architecture for Ethernet switches that provides composability and supports online adaptation and reconfiguration. This paper extends our work, presenting the associated response-time based schedulability analysis, necessary for the admission control procedure. Additionally, we have derived the temporal complexity of the analysis, which is shown to be O(n2), where n is the number of higher priority components associated with a given server. Finally, we present a proof-of-concept implementation and a set of experimental results that validates the analysis. Copyright © 2011 ACM.

Language: English

Type (Professor's evaluation): Scientific