Synthesizing Multithreaded Code from Real-Time Object-Oriented Models via Schedulability-Aware Thread Derivation

Kim, Saehwa

doi:10.1109/tse.2013.47

Cited by 4 publications

(6 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we analyzed previously proposed optimal priority assignment algorithms for PTS: TRAVERSE( ) [13] and SEARCH( ) [1]. Using priority assignment trees, we showed the inefficiency of TRAVERSE( ) due to its lack of any pruning operation.…”

Section: Discussionmentioning

confidence: 99%

“…As shown in Table 1, TRAVERSE( ) makes no tasks miss their deadlines, which is also demonstrated in Figure 1(e). While [13] did not formally prove the optimality of TRAVERSE( ), we can easily see that TRAVERSE( ) is optimal since it traverses all possible priority orderings in PO Γ until it finds a feasible priority ordering. Besides, it is a simple application of traverse_orderings( ) [21], which is for fully preemptive fixed priority scheduling and its optimality was proved.…”

Section: Previously Proposed Optimal Priority Assignment Algorithmmentioning

confidence: 94%

“…This section analyzes previously proposed optimal priority assignment algorithms for PTS: TRAVERSE( ) [13] and SEARCH( ) [1]. …”

Section: Previously Proposed Optimal Priority Assignment Algorithmmentioning

confidence: 99%

“…The work of this paper has been highly motivated by our previous work of SISAtime [13], which adopts PTS to schedule active (concurrent) objects of real-time object-oriented models [14–19]. While SISAtime contains an optimal scheduling attributes assignment algorithm for PTS, it is not so much efficient.…”

Section: Introductionmentioning

confidence: 99%

“…There are two previously proposed optimal scheduling attributes assignment algorithms for PTS: TRAVERSE( ) of SISAtime [13] and SEARCH( ) of [1], which is the first academic article that presented PTS. Both algorithms work in two stages.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

Kim

2015

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Previously Proposed Optimal Priority Assignment Algorithmmentioning

confidence: 94%

“…This section analyzes previously proposed optimal priority assignment algorithms for PTS: TRAVERSE( ) [13] and SEARCH( ) [1]. …”

Section: Previously Proposed Optimal Priority Assignment Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

Kim

2015

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

show abstract

Efficient exact Boolean schedulability tests for fixed priority preemption threshold scheduling

Kim

2017

Journal of Systems and Software

View full text Add to dashboard Cite

A Parameterized Formal Model for the Analysis of Preemption-Threshold Scheduling in Real-Time Systems

Hafaiedh¹,

Slimane²

2020

IEEE Access

View full text Add to dashboard Cite

Time-Critical systems are both complex and critical. Therefore, thorough verification processes of such systems must be performed, including behavior and timing correctness. These systems are usually designed as a set of several interacting tasks and sharing one or more processors. Several scheduling policies have been proposed to manage the dispatch of these tasks for these shared resources so as to respect their predefined deadlines. In this context, preemption threshold scheduling algorithms have been proposed to improve real-time schedulability by managing preemptiveness of tasks. The advantage of these algorithms highly depends on a proper assignment of a set of scheduling attributes, which are priority and preemption threshold. In this paper, we propose a high-level parameterized formal model for the description, analysis and comparison of preemptive, non-preemptive and threshold-based scheduling policies. This model allows to formally verify a set of timing-constraints, in particular schedulability analysis as well as to provide a set of experimental results based on real-time executions. A stochastic version of our model is also proposed allowing to define probabilistic features and to model stochastic real-time tasks, scheduling mechanisms or energy consumption.INDEX TERMS Formal methods, preemption-threshold scheduling, schedulability analysis, performance analysis.

show abstract

Synthesizing Multithreaded Code from Real-Time Object-Oriented Models via Schedulability-Aware Thread Derivation

Cited by 4 publications

References 29 publications

Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

Efficient exact Boolean schedulability tests for fixed priority preemption threshold scheduling

A Parameterized Formal Model for the Analysis of Preemption-Threshold Scheduling in Real-Time Systems

Contact Info

Product

Resources

About