Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
601
Off-line Scheduling of a Real-time System. In
- SAC,
, 1998
"... ABSTRACT This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time systems, enjoying increasing popularity in such diverse areas as automotive electronics and aerospace industry ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
industry. These real-time systems are time triggered in the sense that their overall behavior is globally controlled by a recurring clock tick. For this off-line scheduling problem a potentially indefinite, periodic processing has to be mapped onto a single time window of a fixed length. We make this new
Translating Off-line Schedules into Task Attributes for Fixed Priority Scheduling
- In Proceedings of the 22nd IEEE Real-Time Systems Symposium
, 2001
"... Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, endto -end deadlines, etc.) that are typically achieved by using off-line sche ..."
Abstract
-
Cited by 9 (5 self)
- Add to MetaCart
Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, endto -end deadlines, etc.) that are typically achieved by using off-line
Handling Sporadic Tasks in Off-line Scheduled Distributed Real-Time Systems
- Proc. of 11th EUROMICRO conf. on RT systems
, 1999
"... Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, or product reuse. The construction of an off-line schedule requires complete knowledge about all temporal aspects of the a ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, or product reuse. The construction of an off-line schedule requires complete knowledge about all temporal aspects
Transformation Methods for Off-line Schedules to Attributes for Fixed Priority Scheduling
, 2003
"... Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, endto-end deadlines, etc.) that are typically achieved by using off-line sched ..."
Abstract
- Add to MetaCart
Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, endto-end deadlines, etc.) that are typically achieved by using off-line
Off line Scheduling of Applications with Variable Duration Tasks
"... Abstract. We propose an off-line scheduling methodology for real time applications including variable duration tasks, the variations coming from the presence of conditional instructions in the body of the tasks. After adapting the task temporal model to this context, we model these applications usin ..."
Abstract
- Add to MetaCart
Abstract. We propose an off-line scheduling methodology for real time applications including variable duration tasks, the variations coming from the presence of conditional instructions in the body of the tasks. After adapting the task temporal model to this context, we model these applications
No.18 Combining Off-line Schedule Construction and Fixed Priority Scheduling in Real-Time Computer Systems
, 2005
"... Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, end-to-end deadlines, etc.) that are typically achieved by using off-line sche ..."
Abstract
- Add to MetaCart
Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, end-to-end deadlines, etc.) that are typically achieved by using off-line
Task Attribute Assignment of Fixed Priority Scheduled Tasks to Reenact Off-line Schedules
- In Conference on Real-Time Computing Systems and Applications, Korea
, 2000
"... A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-end deadlines. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibil ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
for flexibility. Fixed priority scheduling can provide more flexibility, but is limited with respect to predictability, as actual times of executions depend on run-time events. In this paper, we present a method to combine off-line schedule construction with fixed priority scheduling: by determining task
The Performance of Constraint Programming for Off-line Scheduling of Distributed Real-Time Systems
, 2002
"... Many real-time systems are distributed in the sense that they consist of tasks that execute on dierent nodes. As a consequence of the distribution, additional task constraints concerning communication and resource sharing are imposed to the traditional timing constraints. Unfortunately, these constr ..."
Abstract
- Add to MetaCart
, these constraints increase the computational complexity involved in finding a feasible distributed schedule for the tasks, making an off-line approach to the scheduling problem the only viable alternative. Off-line analysis is also required if the constraints must be guaranteed to always hold and if the distributed
Off-line scheduling of divisible requests on an heterogeneous collection of databanks
, 2004
"... ..."
A Context-Switch Reduction Heuristic for Power-Aware Off-Line Scheduling
"... Abstract. Scheduling algorithms significantly affect the performance of a real-time system. In systems with power constraints, context switches in a schedule result in wasted power consumption. We present a scheduling algorithm and a heuristic for reducing the number of context switches. The algorit ..."
Abstract
- Add to MetaCart
Abstract. Scheduling algorithms significantly affect the performance of a real-time system. In systems with power constraints, context switches in a schedule result in wasted power consumption. We present a scheduling algorithm and a heuristic for reducing the number of context switches
Results 1 - 10
of
601
