Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Davis, Robert I.; Burns, Alan

doi:10.1007/s11241-010-9106-5

Cited by 150 publications

(147 citation statements)

References 35 publications

Supporting

Mentioning

144

Contrasting

Order By: Relevance

“…2. This is similar to the concept of carry-in interference used in the analysis of global multiprocessor fixed-priority scheduling (Bertogna and Cirinei 2007;Davis and Burns 2010). Effectively due to local interference from higher priority tasks on its core, the memory accesses of the first job are carried-in to the interval of interest leading to increased interference on the bus during the interval.…”

Section: Interference On the Busmentioning

confidence: 84%

An extensible framework for multicore response time analysis

et al. 2017

Self Cite

View full text Add to dashboard Cite

In this paper, we introduce a multicore response time analysis (MRTA) framework, which decouples response time analysis from a reliance on contextindependent WCET values. Instead, the analysis formulates response times directly The additional material includes: Section 4: analysis for warmed-up caches and dynamic scratchpads (Sects. 4.3 and 4.2). Section 7: extensions to the task model, including RTOS and interrupts, shared software resources, and open systems and incremental verification. Section 8: presentation of a cycle-accurate multicore simulator. Section 9: evaluation of different local memory types (Sect. 9.2), a comparison between predictable and reference architectures (Sect. 9.3), and a verification of the precision of the analysis using results from the simulator (Sect. 9.4). 123Real-Time Syst from the demands placed on different hardware resources. The MRTA framework is extensible to different multicore architectures, with a variety of arbitration policies for the common interconnects, and different types and arrangements of local memory. We instantiate the framework for single level local data and instruction memories (cache or scratchpads), for a variety of memory bus arbitration policies, including: Round-Robin, FIFO, Fixed-Priority, Processor-Priority, and TDMA, and account for DRAM refreshes. The MRTA framework provides a general approach to timing verification for multicore systems that is parametric in the hardware configuration and so can be used at the architectural design stage to compare the guaranteed levels of real-time performance that can be obtained with different hardware configurations. We use the framework in this way to evaluate the performance of multicore systems with a variety of different architectural components and policies. These results are then used to compose a predictable architecture, which is compared against a reference architecture designed for good average-case behaviour. This comparison shows that the predictable architecture has substantially better guaranteed real-time performance, with the precision of the analysis verified using cycle-accurate simulation.

show abstract

Section: Interference On the Busmentioning

confidence: 84%

An extensible framework for multicore response time analysis

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thereafter, for every task (Lines 13-17). Then, it repeats this process until there is no slack value update (τ is deemed schedulable) (Lines [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] or there exists at least one task τ j satisfying R j > D j (τ is deemed unschedulable) (Lines 10-11).…”

Section: Is Deemed Schedulable) or There Is No Slack Value Update (τ mentioning

confidence: 99%

“…To this end, the real-time systems community has developed various techniques for guaranteeing timing requirements, and RTA (Response Time Analysis) is one of the most popular techniques. Starting with FP (Fixed priority) [2] on uniprocessors [3], the generic RTA framework has been extended to multiprocessor systems for popular scheduling algorithms [4]- [6].…”

Section: Introductionmentioning

confidence: 99%

“…While the forward strategy proposed a decade ago [4] scans the slack values from zero to the largest feasible value, the backward strategy introduced recently [7] investigates the values on the other way round. Although the forward strategy was exploited and studied in several studies [4]- [6], the backward strategy (which dominates the forward one) has not been identified in terms of its correctness and empirical performance to this day, and thus it has not been used. In this letter, we focus on the backward strategy, and aim at identifying its correctness and empirical performance.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems

Baek

Lim²,

Lee

2018

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYRTA (Response time analysis) is a popular technique to guarantee timing requirements for a real-time system, and therefore the RTA framework has been widely studied for popular scheduling algorithms such as EDF (Earliest Deadline First) and FP (Fixed Priority). While a number of extended techniques of RTA have been introduced, some of them cannot be used since they have not been proved and evaluated in terms of their correctness and empirical performance. In this letter, we address the state of the art technique of slack reclamation of the existing generic RTA framework for multiprocessors. We present its mathematical proof of correctness and empirical performance evaluation, which have not been revealed to this day.

show abstract

“…These tests are described in more detail by Davis and Burns (2010a). Bertogna et al (2009) developed a polynomial time sufficient schedulability test for global FP scheduling based on the approach of Baker (2003).…”

Section: Schedulability Tests For Global Fpmentioning

confidence: 99%

FPSL, FPCL and FPZL schedulability analysis

Davis

Kato

2012

Real-Time Syst

Self Cite

View full text Add to dashboard Cite

This paper presents the Fixed Priority until Static Laxity (FPSL), Fixed Priority until Critical Laxity (FPCL) and Extended versionThis paper builds on the paper "FPZL Schedulability Analysis" by Davis and Burns (2011b) published in the proceedings of RTAS 2011. This paper extends Davis and Burns (2011b) analysis to cover the FPSL and FPCL scheduling algorithms as well as FPZL. The analysis given in this paper is a superset of that provided for FPZL and reduces to it if the laxity threshold of each task is set to zero. In this paper, the experimental evaluation has been extended to include schedulability tests for FPSL (which also apply to FPCL) and simulation of FPCL as well as FPZL. We also report on a prototype implementation of FPCL and FPZL in a Linux kernel, running on an Intel Core 2 Quad processor (Q9650).

show abstract

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Abstract: Abstract

Cited by 150 publications

References 35 publications

An extensible framework for multicore response time analysis

An extensible framework for multicore response time analysis

Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems

FPSL, FPCL and FPZL schedulability analysis

Contact Info

Product

Resources

About