QoS Control for Pipelines of Tasks Using Multiple Resources

Cucinotta, Tommaso; Palopoli, Luigi

doi:10.1109/tc.2009.116

Cited by 29 publications

(19 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of these works consider soft real-time systems targeting multimedia applications such as Sojka et al (2011) and Dermler et al (1996). An adaptive Quality of Service (QoS) control is developed in Cucinotta and Palopoli (2010) to control the reservation during run-time.…”

Section: Resource Reservationmentioning

confidence: 99%

Designing end-to-end resource reservations in predictable distributed embedded systems

et al. 2017

View full text Add to dashboard Cite

Contemporary distributed embedded systems in many domains have become highly complex due to ever-increasing demand on advanced computer controlled functionality. The resource reservation techniques can be effective in lowering the software complexity, ensuring predictability and allowing flexibility during the development and execution of these systems. This paper proposes a novel end-to-end resource reservation model for distributed embedded systems. In order to support the development of predictable systems using the proposed model, the paper provides a method to design resource reservations and an end-to-end timing analysis. The reservation design can be subjected to different optimization criteria with respect to runtime footprint, overhead or performance. The paper also presents and evaluates a case study to show the usability of the proposed model, reservation design method and end-to-end timing analysis.

show abstract

Section: Resource Reservationmentioning

confidence: 99%

Designing end-to-end resource reservations in predictable distributed embedded systems

et al. 2017

View full text Add to dashboard Cite

show abstract

“…The last criterion (Section 5.3) describes conditions that a resource manager needs to satisfy in order to keep the system stable. Unlike the previous literature (with the possible exception of [Cuc10]) in this paper we do not present a particular, customized method for stabilizing a real-time system. We do not present a certain algorithm or develop a particular controller (e.g.…”

Section: Contributionsmentioning

confidence: 99%

“…Palopoli et al [Pa09a,Cuc10] consider resource-reservation schedulers and propose a feedback based technique for adjusting the quotas of tasks in reaction to task execution time variations. In [Cuc10] tasks share several resources and the quotas of tasks on all resources are determined together, in order to minimize end-to-end delays.…”

Section: Chapter 2 Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Stability of Adaptive Distributed Real-TimeSystems with Dynamic Resource Management

Rafiliu¹

2013

View full text Add to dashboard Cite

T oday's embedded distributed real-time systems, are exposed to large variations in resource usage due to complex software applications, sophisticated hardware platforms, and the impact of their run-time environment. As efficiency becomes more important, the applications running on these systems are extended with on-line resource managers whose job is to adapt the system in the face of such variations. Distributed systems are often heterogeneous, meaning that the hardware platform consists of computing nodes with different performance, operating systems, and scheduling policies, linked through one or more networks using different protocols.In this thesis we explore whether resource managers used in such distributed embedded systems are stable, meaning that the system's resource usage is controlled under all possible run-time scenarios. Stability implies a bounded worst-case behavior of the system and can be linked with classic real-time systems' properties such as bounded response times for the software applications. In the case of distributed systems, the stability problem is particularly hard because software applications distributed over the different resources generate complex, cyclic dependencies between the resources, that need to be taken into account. In this thesis we develop a detailed mathematical model of an adaptive, distributed real-time system and we derive conditions that, if satisfied, guarantee its stability. vii viii Popupärvetenskaplig sammanfattning V iär omgivna av ett ständigtökande antal inbyggda datorsystem. De finns exempelvis i våra bilar, telefoner, fotokameror och tvättmaskiner. Vår förväntningär att dessa produkter ska vara säkra, effektiva samt hålla hög kvalitet på de tjänster de tillhandahåller. Detta innebär bland annat att de datorsystem som finns inbyggda i våra bilar inte får leda till att passagerare skadas eller i värsta fall mister sina liv. Av en telefon förväntar vi oss lång batteritidäven om vi använder dessa dagligen för att prata och skicka SMS, lyssna på musik, ta bilder, läsa nyheter och skicka e-post. Vi förväntar oss samtidigt att de tjänster och funktioner som finns i våra mobiltelefoner håller hög kvalitet. Alla våra krav och förväntningar kan endast uppfyllas om systemens inbyggda resurser används på ett effektivt sätt. Exempel på sådana resurserär processorer, minnen, batterier och kommunikationsmedier.I denna avhandling beskrivs hur resurser i inbyggda datorsystem bör användas och kontrolleras för att optimera dess tjänster. Vidare tas hänsyn till att ett modernt system har stora variationer i resursanvändning. Detta beror delvis på att det mångfald av tjänster som finns i dagens moderna datorsystem i allra högsta grad består av komplex programvara. Detta beroräven på den komplicerade och sofistikerade hårdvara som behövs för att stödja all inbyggd programvara ix x samt påverkan från systemets omgivning.För att kunna förlita oss på dessa inbyggda systemär det nödvändigt att studera huruvida dess resurshanterareär stabila. Denna avhandling presenterar ...

show abstract

“…The downside is that they are usually conservative (they assume the worst case phasing for the task activation) and, more importantly, operate within a restricted assumption space: single processor, fixed priority preemptive scheduler, periodic activation and strict respect of every deadline (hard real-time hypotheses). In recent years, commendable extensions to the real-time scheduling theory have been made in the direction of multiprocessor systems [4,3], of relaxed timing constraints [1,18] and of distributed real-time systems [12,23,9]. Despite the relaxation of some of the hypotheses of the classic real-time task model, the applicability for real-time scheduling theory remains restricted to the adoption of specific models of computation and of homogeneous scheduling algorithms.…”

Section: Introductionmentioning

confidence: 99%