Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Scheduling within temporal partitions: response-time analysis and server design
Publication

Publications

Scheduling within temporal partitions: response-time analysis and server design

Title
Scheduling within temporal partitions: response-time analysis and server design
Type
Article in International Conference Proceedings Book
Year
2004
Authors
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: 95-103
EMSOFT 2004 - Fourth ACM International Conference on Embedded Software
Pisa, 27 September 2004 through 29 September 2004
Indexing
Other information
Authenticus ID: P-007-EA9
Abstract (EN): As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum level of interference. This can be achieved using temporal partitions, with each application assigned to its own partition and executing as if it was executing alone on a resource with lower bandwidth. The partitions are associated to servers that execute the application tasks according to a given application-level scheduler. On the other hand, the set of servers is scheduled by a system-level scheduler. This paper addresses the particular case of fixed priorities-based application-level schedulers together with a periodic server model at the system level. It starts with an adequate response time analysis based on the notion of server availability for a known server. Then it addresses the inverse problem of designing a server with minimum system-level resource requirements to fulfill the application time constraints. In this context, the paper shows that response time based schedulability tests with linear time bounds do not need to consider all tasks but just a small subset, which may lead to substantial speed-ups. The proposed method goes a step further with respect to other recent works in the literature by considering a more complete task model, effectively computing the server parameters and establishing a better trade-off concerning complexity and tightness. Copyright 2004 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

Comparing Admission Control Architectures for Real-Time Ethernet (vol 8, pg 105521, 2020) (2020)
Other Publications
Alvarez, I; Moutinho, L; Pedreiras, P; Bujosa, D; Proenza, J; Luis Almeida
The Quest for Real-Time Behavior in Ethernet (2005)
Chapter or Part of a Book
Pedreiras, P; Luis Almeida; Fonseca, JA
Online QoS Adaptation with the Flexible Time-Triggered (FTT) Communication Paradigm (2007)
Chapter or Part of a Book
Martins, E; Marau, R; Ferreira, J; Fonseca, JA; Luis Almeida; Calha, M; Silva, V; Pedreiras, P
The FTT-can protocol for flexibility in safety-critical systems (2002)
Article in International Scientific Journal
Ferreira, J; Pedreiras, P; Luis Almeida; Fonseca, JA
Performing flexible control on low-cost microcontrollers using a minimal real-time kernel (2008)
Article in International Scientific Journal
Marau, R; Leite, P; Velasco, M; Marti, P; Luis Almeida; Pedreiras, P; Fuertes, JM

See all (52)

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-19 at 04:23:10 | Privacy Policy | Personal Data Protection Policy | Whistleblowing