THE SCHEDULING TASKS IN REAL-TIME SYSTEMS
نویسندگان
چکیده
منابع مشابه
Scheduling Tasks in Real-Time Systems Using Evolutionary Strategies
Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate the evolutionary strategies can find feasible schedules (assuming they exist) in very short periods of time.
متن کاملScheduling Aperiodic and Sporadic Tasks in Hard Real - Time Systems
The stringent timing constraints as well as the functional correctness are essential requirements of hard real-time systems. In such systems, scheduling plays a very important role in satisfying these constraints. The priority based scheduling schemes have been used commonly due to the simplicity of the scheduling algorithm. However, in the presence of task interdependencies and complex timing ...
متن کاملScheduling Imprecise Tasks in Real-Time Distributed Systems
The Imprecise Computation technique has been proposed as an approach to the construction of real-time systems that are able to provide both guarantee and flexibility. This paper analyzes the utilization of Imprecise Computation in the scheduling of distributed real-time applications. First we discuss the main problems associated with that goal, and we define a task model suitable to distributed...
متن کاملOn Scheduling Imprecise Tasks in Real-Time Distributed Systems
The Imprecise Computation technique has been proposed as an approach to the construction of real-time systems that are able to provide both guarantee and flexibility. This paper analyzes the use of Imprecise Computation in the scheduling of distributed real-time applications. Initially it is presented an approach to the scheduling of distributed imprecise tasks. Then we discuss the main problem...
متن کاملScheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
(ABSTRACT) In this proposal, we consider scheduling distributed soft real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node behaviors). We present a distributed real-time scheduling algorithm called Real-Time Gossip (or RTG). RTG considers a distributed (i.e., multi-node) task model where tasks are subject ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information systems, mechanics and control
سال: 2017
ISSN: 2519-2256,2219-3804
DOI: 10.20535/2219-3804172017123927