Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
119
Correction of an Augmentation Bound Analysis for Parallel Real-Time Tasks
, 2012
"... This paper proposes some significant corrections in a recent work of Lakshmanan et al on parallel task scheduling. Lakshmanan et al have proposed a transformation of parallel tasks into sequential tasks, and have claimed a resource augmentation bound of 3:42 for partitioned deadline monotonic (DM) s ..."
Abstract
- Add to MetaCart
This paper proposes some significant corrections in a recent work of Lakshmanan et al on parallel task scheduling. Lakshmanan et al have proposed a transformation of parallel tasks into sequential tasks, and have claimed a resource augmentation bound of 3:42 for partitioned deadline monotonic (DM
(will be inserted by the editor) Correction of an Augmentation Bound Analysis for Parallel Real-Time Tasks
, 2012
"... Abstract: With the advent of multi-core processors, real-time scheduling of parallel tasks has received considerable attention in recent years. In this paper, we propose some significant corrections in a recent work of Lakshmanan et al. on parallel task scheduling. Lakshmanan et al. has proposed a t ..."
Abstract
- Add to MetaCart
transformation of parallel tasks into sequential tasks, and has claimed a resource augmentation bound of 3.42 for partitioned deadline monotonic (DM) scheduling of the transformed tasks. In this paper, we demonstrate that their resource augmentation bound is incorrect. We also demonstrate that no practical
Schedulability analysis of global deadline-monotonic scheduling. Available at http://www.cs.unc.edu/˜ baruah, 2007. BARUAH, S. Techniques for multiprocessor global schedulability analysis
- In Proceedings of the Real-Time Systems Symposium (Tucson, AZ, December 2007), IEEE Computer
"... The multiprocessor Deadline-Monotonic (DM) schedul-ing of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guaran-tees, including a resource augmentation bound. ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
The multiprocessor Deadline-Monotonic (DM) schedul-ing of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guaran-tees, including a resource augmentation bound.
Abstract GLOBAL STATIC-PRIORITY SCHEDULING OF SPORADIC TASK SYSTEMS ON MULTIPROCESSOR PLATFORMS
"... The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining whether a specified system meets all deadlines when scheduled by a static-priority algorithm. These conditions are used to obtain efficient schedulability tests for sporadi ..."
Abstract
- Add to MetaCart
for sporadic task systems scheduled using the popular Deadline-Monotonic real-time scheduling algorithm. Resource-augmentation bounds are provided that quantify the tightness of these schedulability tests. Keywords: Multiprocessor platforms; Static-Priority Scheduling; Schedulability analysis; Resource
RESOURCE AUGMENTATION FOR PERFORMANCE GUARANTEES IN EMBEDDED REAL-TIME SYSTEMS RESOURCE AUGMENTATION FOR PERFORMANCE GUARANTEES IN EMBEDDED REAL-TIME SYSTEMS
"... Abstract Real-time scheduling policies have been widely studied, with many known schedulability and feasibility analysis techniques for different task models, that have advanced the state-of-the-art. Most of these techniques are typically derived under the assumption of negligible runtime overheads ..."
Abstract
- Add to MetaCart
the resource augmentation bound, specifically the upper-bound on the lowest processor speed, that guarantees the feasibility of a specified nonpreemption behavior for any real-time task. We show that, for any task τ i , the resource augmentation bound that guarantees a non-preemptive execution for a specified
1 Parallel Real-Time Scheduling of DAGs
"... Abstract—Recently, multi-core processors have become mainstream in processor design. To take full advantage of multi-core processing, computation-intensive real-time systems must exploit intra-task parallelism. In this paper, we address the problem of real-time scheduling for a general model of dete ..."
Abstract
- Add to MetaCart
decompose each DAG into sequential tasks with their own release times and deadlines. Then we prove that these decomposed tasks can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first
Parallel Real-Time Scheduling of DAGs
"... Abstract—Recently, multi-core processors have become mainstream in processor design. To take full advantage of multi-core processing, computation-intensive real-time systems must exploit intra-task parallelism. In this paper, we address the open problem of real-time scheduling for a general model of ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
decompose each DAG into sequential tasks with their own release times and deadlines. Then we prove that these decomposed tasks can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first
Real-Time Scheduling of Parallel Tasks under a General DAG Model
"... Abstract—Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, existi ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
decomposition that splits a DAG into sequential tasks. Second, we prove that parallel tasks, upon decomposition, can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first for a general DAG
Noname manuscript No. (will be inserted by the editor) Multi-core Real-Time Scheduling for Generalized Parallel Task Models
"... Abstract Multi-core processors offer a significant performance increase over single-core processors. They have the potential to enable computation-intensive real-time applications with stringent timing constraints that cannot be met on traditional single-core processors. However, most results in tra ..."
Abstract
- Add to MetaCart
can be converted into synchronous tasks such that the same decomposition can be applied and the same augmentation bounds hold. Simulations based on synthetic workload demonstrate that the derived resource augmentation bounds are safe and sufficient. Keywords parallel task · multi-core processor · real
General DAG Model
"... Abstract: Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, exist ..."
Abstract
- Add to MetaCart
decomposition that splits a DAG into sequential tasks. Second, we prove that parallel tasks, upon decomposition, can be scheduled using preemptive global EDF with a resource augmentation bound of 4. This bound is as good as the best known bound for more restrictive models, and is the first for a general DAG
Results 1 - 10
of
119
