Transformation of Sporadic Tasks for Off-line Scheduling with Utilization and Response Time Trade-offs
نویسندگان
چکیده
Many safety critical real-time systems follow the time triggered approach using off-line scheduling methods for reasons of determinism, simple fault tolerance, certifiability, etc. By their very nature, offline schedules cannot handle activities which are not known completely at design time. While some methods have been presented to integrate event-triggered activities at runtime, these require modification of the simple and deterministic table look up scheduling at runtime. In this paper, we provide a proactive method for handling sporadic tasks with standard off-line scheduling in time-triggered systems without changing the schedule at runtime. The method is based on transforming the parameters of sporadic tasks to create periodic reservation tasks, for including in regular task sets for standard off-line schedulers. The resulting scheduling tables can be executed by regular time-triggered systems. The transformation requires more reserved utilization than the sporadic tasks actually need. We use this not needed reserved utilization to reduce the worst case response time of the sporadic tasks. A trade-off between reserved utilization and worst case response time of sporadic tasks is presented in this paper, too. We provide a feasibility analysis also considering the switching overhead for given bounds on the reserved utilization and worst case response time. With this analysis, we determine feasible parameters of the reservation tasks and hence, provide a designer choice for the reserved utilization and the worst case response time.
منابع مشابه
Handling sporadic tasks in off-line scheduled distributed real-time systems
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 application. The acquisition of this information may involve unacceptable cost or be impossible. O...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملStudying the process of transformation of the start-up to the academic spin off
At todaychr('39')s universities, we are witnessing the emergence of startup companies by the startup teams by student and academic teams; unfortunately, most startups face barriers to success. On the one hand, one of the new topics entering the fourth-generation universities and can be a good target for the future of the startups; the existence of academic spin-offs, centered around scholars...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملA Dynamic Scheduling Benchmark: Design, Implementation and Performance Evaluation
Games, such as Chess, Eight Queens, and Tiles Puzzle, have traditionally been used as popular benchmarks for evaluating different problem solving strategies. Many of the game benchmarks are suitable for evaluating static scheduling techniques. In such benchmarks, the scheduling phase and the execution phase (i.e. when the schedule is executed to play the game) are disjoint. The scheduling techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011