An optimal resource sharing protocol for generalized multiframe tasks

Ekberg, Pontus; Guan, Nan; Stigge, Martin; Yi, Wang

doi:10.1016/j.jlamp.2014.10.001

Cited by 11 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The locking protocols have been studied with other graph-based task models, such as the DRT model [30] and multi-frame task model [31]. However, these models are still sequential (multiple edges going out from a vertex have conditional branching semantics rather than forking).…”

Section: Related Workmentioning

confidence: 99%

On the Analysis of Parallel Real-Time Tasks with Spin Locks

Jiang

Guan

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

Locking protocol is an essential component in resource management of real-time systems, which coordinates mutually exclusive accesses to shared resources from different tasks. Although the design and analysis of locking protocols have been intensively studied for sequential real-time tasks, there has been little work on this topic for parallel real-time tasks. In this paper, we study the analysis of parallel real-time tasks using spin locks to protect accesses to shared resources in three commonly used request serving orders (unordered, FIFO-order and priority-order). A remarkable feature making our analysis method more accurate is to systematically analyze the blocking time which may delay a task's finishing time, where the impact to the total workload and the longest path length is jointly considered, rather than analyzing them separately and counting all blocking time as the workload that delays a task's finishing time, as commonly assumed in the state-of-the-art.

show abstract

Section: Related Workmentioning

confidence: 99%

On the Analysis of Parallel Real-Time Tasks with Spin Locks

Jiang

Guan

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Local shared resource Like precedence dependencies, shared resources are not supported by the classical multiframe task models and DAG task models, since they assume independent tasks [6,26]. In [27] the authors propose an optimal shared resource access protocol for GMF tasks but the protocol is not implemented in the OS of Thales products.…”

Section: Applicability Of Related Workmentioning

confidence: 99%

Scheduling analysis of tasks constrained by TDMA: Application to software radio protocols

Singhoff

Rubini

et al. 2017

Journal of Systems Architecture

View full text Add to dashboard Cite

International audienceThe work, presented in this article, aims at performing scheduling analysis of Time Division Multiple Access (TDMA) based communication systems. Products called software radio protocols, developed at Thales Communications & Security, are used as case-studies. Such systems are real-time embedded systems. They are implemented by tasks that are statically allocated on multiple processors. A task may have an execution time, a deadline and a release time that depend on TDMA configuration. The tasks also have dependencies through precedence and shared resources. TDMA-based software radio protocols have architecture characteristics that are not handled by scheduling analysis methods of the literature. A consequence is that existing methods give either optimistic or pessimistic analysis results. We propose a task model called Dependent General Multiframe (DGMF) to capture the specificities of such a system for scheduling analysis. The DGMF task model describes, in particular, the different jobs of a task, and task dependencies. To analyze DGMF tasks, we propose their transformation to real-time transactions and we also propose a new schedulability test for such transactions. The general analysis method is implemented in a tool that can be used by software engineers and architects. Experimental results show that our propositions give less pessimistic schedulability results, compared to fundamental methods. The results are less pessimistic for both randomly generated systems and real case-studies from Thales. These results are important for engineering work, in order to limit the over-dimensioning of resources. Through tooling, we also automated the analysis. These are advantages for engineers in the more and more competitive market of software radios

show abstract

“…Ding et al [12] scheduled a set of tasks with the I/O blocking property under the MF model. Ekberg et al [13] developed an optimal resource sharing protocol for the GMF model. Andersson [3] presented a schedulability analysis for the flows in multi-hop networks comprising software-implemented Ethernet switches, according to the GMF model.…”

Section: The Dgmf-pa Modelmentioning

confidence: 99%

MILP-based Deadline Assignment for End-to-End Flows in Distributed Real-Time Systems

Peng

Fisher

Chantem

2016

Proceedings of the 24th International Conference on Real-Time Networks and Systems

View full text Add to dashboard Cite

End-to-end flows, which have a set of chainlike subtasks, are widely used in distributed real-time systems. For instance, multimedia and automative applications require that subtasks finish executing on a chain of processors before their end-to-end deadlines. The scheduling of such chained subtasks decides the schedulability of a distributed realtime system. Since the subtask priority assignment problem is NP-hard in general, most heuristics are presented to schedule end-to-end flows in two separate steps. The first step calculates intermediate relative deadlines for frames, and the second step makes scheduling decisions under EDF scheduling. Because the quality of the priority assignment of subtasks will directly affect the schedulability of the distributed systems, the two separate steps may cause pessimism in schedulability analysis. To reduce potential pessimism, we combine the two steps in our novel dGMF-PA (distributed generalized multiframe tasks with parameter adaption) model. We present an algorithm based on mixedinteger linear programming for optimally selecting frame relative deadlines in the dGMF-PA model. An approximation algorithm is also proposed to reduce computational running time. Our approximation algorithm has a tunable speed-up factor of 1 + where can be arbitrarily small, with respect to the exact schedulability test of dGMF-PA tasks under EDF scheduling. Extensive experiments have shown that our approximation algorithm (which is a sufficient schedulability test) can schedule at most 44 % more than HOSPA, an existing state-of-the-art algorithm.

show abstract

An optimal resource sharing protocol for generalized multiframe tasks

Cited by 11 publications

References 10 publications

On the Analysis of Parallel Real-Time Tasks with Spin Locks

On the Analysis of Parallel Real-Time Tasks with Spin Locks

Scheduling analysis of tasks constrained by TDMA: Application to software radio protocols

MILP-based Deadline Assignment for End-to-End Flows in Distributed Real-Time Systems

Contact Info

Product

Resources

About