Resource partition for real-time systems

Mok, Aloysius K.; Feng, Xinwei; Chen, Deji

doi:10.1109/rttas.2001.929867

Cited by 156 publications

(126 citation statements)

References 23 publications

Supporting

Mentioning

124

Contrasting

Unclassified

Order By: Relevance

“…Supply functions have been used, possibly under different names in different contexts [e.g. service curves in network/real-time calculus (Cruz 1991;Baccelli et al 1992;Thiele et al 2000)], to model the availability of different types of resource: processing time of a single (Mok et al 2001;Lipari and Bini 2003;Shin and Lee 2003) or multi-core (Bini 2009;Xu et al 2015) platform, network (Cruz 1991;Almeida et al 2002), memory (Yun et al 2016;Åkesson and Goossens 2011), and I/O (Pellizzoni et al 2008). However, this is the first instance in which a supply function is constructed based on the experimental execution trace.…”

Section: The Supply Analysis Modulementioning

confidence: 99%

See 1 more Smart Citation

rt-muse: measuring real-time characteristics of execution platforms

2017

View full text Add to dashboard Cite

Operating systems code is often developed according to principles like simplicity, low overhead, and low memory footprint. Schedulers are no exceptions. A scheduler is usually developed with flexibility in mind, and this restricts the ability to provide real-time guarantees. Moreover, even when schedulers can provide realtime guarantees, it is unlikely that these guarantees are properly quantified using theoretical analysis that carries on to the implementation. To be able to analyze the guarantees offered by operating systems' schedulers, we developed a publicly available tool that analyzes timing properties extracted from the execution of a set of threads and computes the lower and upper bounds to the supply function offered by the execution platform, together with information about migrations and statistics on execution times. rt-muse evaluates the impact of many application and platform characteristics including the scheduling algorithm, the amount of available resources, the usage of shared resources, and the memory access overhead. Using rt-muse, we show the impact of Linux scheduling classes, shared data and application parallelism, on the delivered computing capacity. The tool provides useful insights on the runtime behavior of the applications and scheduler. In the reported experiments, rt-muse detected some issues arising with the real-time

show abstract

Section: The Supply Analysis Modulementioning

confidence: 99%

“…The supply lower bound function slbf i (t) and the supply upper bound function subf i (t) of thread τ i are functions such that (Mok et al 2001;Lipari and Bini 2003;Shin and Lee 2003) …”

Section: The Supply Analysis Modulementioning

confidence: 99%

rt-muse: measuring real-time characteristics of execution platforms

2017

View full text Add to dashboard Cite

show abstract

“…Since a two-level HSF [1] has been introduced for open environments, many studies have been proposed for its schedulability analysis of HSFs [2]- [3]. Various processor models, such as bounded-delay [4] and periodic [5], have been proposed for multi-level HSFs, and schedulability analysis techniques have been developed for the proposed processor models [6]- [12].…”

Section: Introductionmentioning

confidence: 99%

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

Chakma¹,

Debbarma²,

Kar³

et al. 2013

LNSE

View full text Add to dashboard Cite

Previously, several works have been carried out on hierarchical scheduling frameworks from a theoretical point of view. In the recent past, hierarchical scheduling frameworks have been implemented on VxWorks for uniprocessor system. In this paper we present our initial proposal of the implementation of our hierarchical scheduling framework in a commercial operating system like VxWorks for Symmetric Multiprocessing based (SMP) Real Time Systems. The purpose of the implementation is twofold: (1) we would like to identify the limitations of the previous implementations and (2) we would like to demonstrate feasibility of our implementation in a commercial operating system, without having to modify the kernel source code. We present SMP structure of VxWorks and how it can be used in our proposal. Finally, we present the design of our hierarchical scheduling framework, and we discuss our current status in the project

show abstract

“…In the literature, numerous modeling frameworks for real-time task systems have been proposed, see for instance [26][27][28][29][30][31][32]. In the design space exploration of printers, a small gain (5%) of performance can be decisive, and consequently detailed models of real-time task systems are needed in which, for instance, we can express that the completion time of a task slightly increases if another task is using the same communication bus simultaneously.…”

Section: Introductionmentioning

confidence: 99%

Modeling task systems using parameterized partial orders

Houben

Igna

Vaandrager

2012

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Abstract. Inspired by work on model-based design of printers, the notion of a parametrized partial order (PPO) was introduced recently. PPOs are a simple extension of partial orders, expressive enough to compactly represent large task graphs with finite repetitive behavior. We present a translation of the PPO subclass to timed automata and prove that the transition system induced by the Uppaal models is isomorphic to the configuration structure of the original PPO. Moreover, we introduce real-time task systems (RTTS), a general model for real-time embedded systems that we have used to describe the data paths of realistic printer designs. In an RTTS, tasks are represented as PPOs and the pace of a task instance may vary, depending on the resources that are allocated to it. We describe a translation of a subclass of RTTSs to Uppaal, and establish, for an even smaller subclass, bisimulation equivalence between the timed configuration semantics of an RTTS and the transition system induced by the corresponding Uppaal translation. Lastly, we report on a series of experiments which demonstrates that the resulting Uppaal models are more tractable than handcrafted models of the same systems used in earlier case studies.

show abstract

Resource partition for real-time systems

Cited by 156 publications

References 23 publications

rt-muse: measuring real-time characteristics of execution platforms

rt-muse: measuring real-time characteristics of execution platforms

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

Modeling task systems using parameterized partial orders

Contact Info

Product

Resources

About