Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Multi-level hierarchical scheduling in ethernet switches
Publication

Publications

Multi-level hierarchical scheduling in ethernet switches

Title
Multi-level hierarchical scheduling in ethernet switches
Type
Article in International Conference Proceedings Book
Year
2011
Authors
Santos, R
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Behnam, M
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Nolte, T
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Pedreiras, P
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Conference proceedings International
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
Other information
Authenticus ID: P-008-109
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
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Hierarchical server-based traffic scheduling in ethernet switches (2011)
Article in International Scientific Journal
Santos, R; Pedreiras, P; Behnam, M; Nolte, T; Luis Almeida
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-24 at 19:08:54 | Privacy Policy | Personal Data Protection Policy | Whistleblowing