Results 1 - 10
of
22
A survey of hard real-time scheduling for multiprocessor systems
- ACM COMPUTING SURVEYS
, 2011
"... This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results ab ..."
Abstract
-
Cited by 99 (9 self)
- Add to MetaCart
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges, and likely productive research directions.
Schedulability analysis of global scheduling algorithms on multiprocessor platforms
, 2008
"... ..."
Priority Assignment for Global Fixed Priority Pre-emptive Scheduling in Multiprocessor Real-Time Systems
, 2009
"... This paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. In this paper, we prove that Audsley’s Optimal Priority Assignment (OPA) algorithm, originally devised for uniprocessor scheduling, is applicable to th ..."
Abstract
-
Cited by 39 (14 self)
- Add to MetaCart
(Show Context)
This paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. In this paper, we prove that Audsley’s Optimal Priority Assignment (OPA) algorithm, originally devised for uniprocessor scheduling, is applicable to the multiprocessor case, provided that three conditions hold with respect to the schedulability tests used. Our empirical investigations show that the combination of optimal priority assignment policy and a simple compatible schedulability test is highly effective, in terms of the number of tasksets deemed to be schedulable. We also examine the performance of heuristic priority assignment policies such as Deadline Monotonic, and an extension of the TkC priority assignment policy called DkC that can be used with any schedulability test. Here we find that Deadline Monotonic priority assignment has relatively poor performance in the multiprocessor case, while DkC priority assignment is highly effective. 1.
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- Real-Time Systems Journal
"... ..."
(Show Context)
A Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems
"... This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results a ..."
Abstract
-
Cited by 28 (1 self)
- Add to MetaCart
(Show Context)
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
"... Abstract—In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction problem that we prove equivalent to the multiprocessor problem. A solution has to satisfy a set of constraints and th ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction problem that we prove equivalent to the multiprocessor problem. A solution has to satisfy a set of constraints and there is no performance criterion to optimize. We propose two different CSP formulations. The first one is a basic encoding allowing to use state of the art CSP solvers. The second one is a more complex encoding designed to obtain solutions faster. With these encodings, we then study the resolution of the scheduling problem using systematic search algorithms based on backtracking. I.
Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems
, 2009
"... The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors. 1
Addressing Cache Related Preemption Delay in Fixed Priority Assignment
"... Abstract-Handling cache related preemption delay (CRPD) in preemptive scheduling context for real-time embedded systems still stays an open issue despite of its practical importance. Indeed, classical priority assignment algorithms are only optimal when preemption costs are neglected. For example, ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-Handling cache related preemption delay (CRPD) in preemptive scheduling context for real-time embedded systems still stays an open issue despite of its practical importance. Indeed, classical priority assignment algorithms are only optimal when preemption costs are neglected. For example, with Audsley's Optimal Priority Assignment (OPA), as the original algorithm does not take CRPD into account, it fails frequently in identifying the schedulable task sets as it happens that the algorithm qualifies a task set to be schedulable, while it is practically not because of CRPD. In this article, we propose an approach to adapt fixed priority assignment algorithms to realtime embedded systems with cache memory. For such a purpose, we propose three extensions of the original OPA algorithm that have different degrees of pessimism, different complexities, and give different results in terms of schedulable task sets coverage. Exhaustive experimentations were achieved to evaluate the proposed approaches in terms of complexity and efficiency. The result shows that our approach provides a mean to guarantee the schedulability of the real-time embedded system while taking into account CRPD.
Author manuscript, published in "ICPP'09 Workshop on Real-time systems on multicore platforms: Theory and Practice (XRTS'09) (2009)" Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
, 2009
"... Abstract—In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction problem that we prove equivalent to the multiprocessor problem. A solution has to satisfy a set of constraints and th ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction problem that we prove equivalent to the multiprocessor problem. A solution has to satisfy a set of constraints and there is no performance criterion to optimize. We propose two different CSP formulations. The first one is a basic encoding allowing to use state of the art CSP solvers. The second one is a more complex encoding designed to obtain solutions faster. With these encodings, we then study the resolution of the scheduling problem using systematic search algorithms based on backtracking. I.
Author manuscript, published in "16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'11), United States (2011)" DOI: 10.1109/ETFA.2011.6059012 Laxity-Based Restricted-Migration Scheduling
, 2013
"... We focus on the real-time multiprocessor scheduling of periodic tasksets. We propose a new static priority scheduling algorithm based on the restricted-migration approach. Restricted-migration approach is a global scheduling approach for which the number of migrations is bounded just by one migratio ..."
Abstract
- Add to MetaCart
(Show Context)
We focus on the real-time multiprocessor scheduling of periodic tasksets. We propose a new static priority scheduling algorithm based on the restricted-migration approach. Restricted-migration approach is a global scheduling approach for which the number of migrations is bounded just by one migration per job at most. Our algorithm uses the laxity of already admitted jobs to decide the admission of newly arrived jobs. We prove that this algorithm is predictable. We give a feasible interval and we propose a utilization bound for this algorithm. We also compare our algorithm to other global algorithms in terms of schedulability by simulations. 1.
