Results 251 to 260 of about 1,854,282 (287)

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium, 2009
This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors.The algorithm is categorized to such a scheduling class that qualifies a few tasks to migrate across processors, while most tasks are fixed to particular processors.
Shinpei Kato, Nobuyuki Yamasaki
openaire   +1 more source

Fixed-priority scheduling of dual-criticality systems

Proceedings of the 21st International conference on Real-Time Networks and Systems, 2013
In modern embedded platforms, safety-critical functionalities that must be certified correct to very high levels of assurance may co-exist with less critical software that is not subject to certification requirements. One seeks to satisfy two, sometimes contradictory, goals upon such mixed-criticality platforms: (i) certify the safety-critical ...
Sanjoy K. Baruah, Alan Burns 0001
openaire   +2 more sources

Integrating best effort and fixed priority scheduling

Annual Review in Automatic Programming, 1994
Abstract Adaptive and dynamic behaviour is seen as one of the key characteristics of next generation hard real-time systems. Whilst fixed priority pre-emptive scheduling is becoming a de facto standard in real-time system implementation, it remains inflexible in its purest form.
N.C. Audsley, A. Burns, R.I. Davis, A.J. Wellings   +3 more
openaire   +1 more source

Response Time Analysis for Fixed Priority Servers

Proceedings of the 26th International Conference on Real-Time Networks and Systems, 2018
In the automotive domain, existing scheduling primitives do not suffice for complex integration scenarios involving heterogeneous applications with diverse timing requirements. Thus, there is a renewed interest to establish server based scheduling as a mainstream scheduling paradigm in automotive software development and to that end, we provide a ...
Arne Hamann 0001, Dakshina Dasari, Jorge Martinez 0003, Dirk Ziegenbein   +3 more
openaire   +2 more sources

New results on fixed priority aperiodic servers

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054), 2003
The issue of using the sporadic server (SS) for scheduling aperiodic tasks has received new attention under the POSIX standard as it has been proposed in P1003.1 d, the additional real-time extensions to POSIX. The SS has been traditionally considered a better approach to the deferrable server (DS) due to its supposed higher achievable utilisation ...
Guillem Bernat, Alan Burns 0001
openaire   +2 more sources

Towards a fixed priority scheduler for an aircraft application

Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, 2002
This paper describes process improvement work that has been performed in the Rolls-Royce Systems and Software Engineering University Technology Centre based at York University. The domain of interest is hard real-time safety critical systems certified to the avionics equipment standard D0178B.
Iain Bate, Alan Burns 0001, John A. McDermid, Andy Vickers   +3 more
openaire   +1 more source

Can fixed priority scheduling work in practice?

Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748), 2004
Mobile phones serve as platforms for a variety of mobile applications including text and picture messaging as well as personal information management, including data synchronization with remote servers and desktop computers. They also host a range of communication-centered applications most of which have real-time constraints.
Raimondas Lencevicius, Alexander Ran
openaire   +1 more source

Multi-core Fixed Priority DVS Scheduling

2012
In this paper, we study offline and online DVS algorithms for Fixed Priority tasks scheduled on multi-core systems. The offline multi-core algorithm (MC-SSS) slows down tasks with a static slowdown speed based on multi-core fixed priority schedulability analysis.
Liu Yang, Man Lin, Laurence Tianruo Yang
openaire   +1 more source

Analyzing fixed-priority global multiprocessor scheduling

Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium, 2003
We consider a multiprocessor where hard real-time tasks are scheduled globally on in processors. Each task has a fixed priority and tasks are executed using preemptive scheduling. The state-of-the-art priority assignment scheme in such cases is called RM-US[US-LIMIT], where US-LIMIT is a parameter to the RM-US algorithm. The challenge is to find the US-
openaire   +1 more source

Solution Space for Fixed-Priority with Preemption Threshold

11th IEEE Real Time and Embedded Technology and Applications Symposium, 2005
This paper reaffirms that fixed-priority with preemption threshold (FPPT) is an important form of real-time scheduling algorithm, which fills the gap between fixed-priority preemptive (FPP) and fixed-priority nonpreemptive (FPNP). When a task set is schedulable by FPPT, there may exist multiple valid preemption threshold assignments, which provide ...
Jiongxiong Chen, Ashif S. Harji, Peter A. Buhr   +2 more
openaire   +2 more sources