Results 1 
4 of
4
Techniques for multiprocessor global schedulability analysis
 In Proceedings of IEEE RealTime Systems Symposium
, 2007
"... A new technique was recently introduced by Bonifaci et al. for the analysis of realtime systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is generalized so that it is applicable to the schedulability analysi ..."
Abstract

Cited by 96 (1 self)
 Add to MetaCart
(Show Context)
A new technique was recently introduced by Bonifaci et al. for the analysis of realtime systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is generalized so that it is applicable to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by any workconserving algorithm. The resulting analysis technique is applied to obtain a new sufficient global Deadline Monotonic (DM) schedulability test. It is shown that this new test is quantitatively superior to preexisting DM schedulability analysis tests; in addition, the degree of its deviation from any hypothetical optimal scheduler (that may be clairvoyant) is quantitatively bounded. A new global EDF schedulability test is also proposed here that builds on the results of Bonifaci et al. This new test is shown to be less pessimistic and more widely applicable than the earlier result was, while retaining the strong theoretical properties of the earlier result.
How Hard Is Partitioning for the Sporadic Task Model?
"... AbstractPartitioning n independent sporadic realtime tasks among m identical processors is known to be an NPhard in the strong sense (by transformation from binpacking). Therefore, current research on partitioning has focused on developing and analyzing various heuristics and approximation algo ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractPartitioning n independent sporadic realtime tasks among m identical processors is known to be an NPhard in the strong sense (by transformation from binpacking). Therefore, current research on partitioning has focused on developing and analyzing various heuristics and approximation algorithms. However, currently only "loose" fundamental limits of approximation (trivially based on the known limits for bin packing and partitioning periodic tasks) are known for partitioning sporadic tasks . In this position paper, we briefly summarize known resourceaugmentation approximation ratio results for sporadic task systems and argue for further theoretic investigation of approximation schemes and lower bounds for this problem. We believe the results of such an investigation will be invaluable (beyond their theoretic implications) to the realtime multicore system designer; such results will inform the system designer on the relative benefits and disadvantages of various task allocation strategies.
What to Make of Multicore Processors for Reliable RealTime Systems?
, 2010
"... Now that multicore microprocessors have become a commodity, it is natural to think about employing them in all kinds of computing, including highreliability embedded realtime systems. Appealing aspects of this development include the ability to process more instructions per second and more instruc ..."
Abstract
 Add to MetaCart
(Show Context)
Now that multicore microprocessors have become a commodity, it is natural to think about employing them in all kinds of computing, including highreliability embedded realtime systems. Appealing aspects of this development include the ability to process more instructions per second and more instructions per watt. However, not all problems are amenable to parallel decomposition, and for those that are, designing a correct scalable solution can be difficult. If there are deadlines or other hard timing constraints the difficulty becomes much greater. This paper reviews some of what is known about multiprocessor scheduling of task systems with deadlines, including recent advances in the analysis of arbitrary sporadic task systems under fixedpriority and earliestdeadline first scheduling polices. It also examines critically the foundations of these theoretical results, including assumptions about task independence and worstcase execution time estimates, with a view toward their practical applicability. 1
Global DM schedulability analysis: upper and lower bounds∗
"... A new technique was recently introduced [7] for the analysis of realtime systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of realtime systems schedule ..."
Abstract
 Add to MetaCart
(Show Context)
A new technique was recently introduced [7] for the analysis of realtime systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by the global DeadlineMonotonic (DM) scheduling algorithm. It is shown that the resulting analysis technique is quantitatively superior to preexisting DM schedulability analysis tests; in addition, the degree of its deviation from any hypothetical optimal scheduler (that may be clairvoyant) is also quantitatively bounded.