Results 1 - 10 of 88,021

Algorithms for determining the load of a sporadic task system

by Theodore P. Baker , 2005
"... In this report, we discuss a metric that characterizes the load of a sporadic task system. We give an exact, exponential-time algorithm that determines a task system’s load by essentially simulating the execution of task system. In addition, we also give an algorithm that can determine the load of a ..."
Abstract - Cited by 9 (6 self) - Add to MetaCart
In this report, we discuss a metric that characterizes the load of a sporadic task system. We give an exact, exponential-time algorithm that determines a task system’s load by essentially simulating the execution of task system. In addition, we also give an algorithm that can determine the load

Semi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors ∗

by unknown authors
"... This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across pro ..."
Abstract - Add to MetaCart
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across

Semi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors ∗

by unknown authors
"... This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across pro ..."
Abstract - Add to MetaCart
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across

Algorithms for determining the demand-based load of a sporadic task system

by Nathan Fisher, Theodore P. Baker, Sanjoy Baruah - In 12th IEEE International Conf. on Embedded and Real-Time Computing Systems and Applications , 2006
"... The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time interval, normalized by the length of the interval. This parameter is known to play a very important role in the uniproce ..."
Abstract - Cited by 21 (7 self) - Add to MetaCart
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time interval, normalized by the length of the interval. This parameter is known to play a very important role

Schedulability analysis of multiprocessor sporadic task systems

by Theodore P. Baker, Sanjoy K. Baruah - Handbook of Realtime and Embedded Systems , 2007
"... ..."
Abstract - Cited by 34 (1 self) - Add to MetaCart
Abstract not found

Mixed-Criticality Scheduling of Sporadic Task Systems

by Sanjoy K. Baruah, Vincenzo Bonifaci, Suzanne Van Der Ster, Leen Stougie, et al. , 2011
"... We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any 2 ..."
Abstract - Cited by 20 (5 self) - Add to MetaCart
We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any

The Partitioned Multiprocessor Scheduling of Sporadic Task Systems ∗

by unknown authors
"... A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst ..."
Abstract - Add to MetaCart
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its

The Partitioned Dynamic-priority Scheduling of Sporadic Task Systems

by unknown authors
"... A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative character-ization of its wors ..."
Abstract - Add to MetaCart
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative character-ization of its

Abstract GLOBAL STATIC-PRIORITY SCHEDULING OF SPORADIC TASK SYSTEMS ON MULTIPROCESSOR PLATFORMS

by unknown authors
"... 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

Hybrid-priority Scheduling of Resource-sharing Sporadic Task Systems∗

by Sanjoy Baruah, Nathan Fisher
"... A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid schedul-ing algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and f ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
and features of both in-dividual policies. An exact (i.e., necessary and sufficient) test is derived for the preemptive uniprocessor scheduling of resource-sharing sporadic task systems using this hybrid scheduling algo-rithm, with access to shared resources arbitrated using the Stack Resource Policy (SRP). 1
Results 1 - 10 of 88,021