104,749 Hits in 8.3 sec

On the efficient scheduling of non-periodic tasks in hard real-time systems

M.E. Thomadakis, Jyh-Charn Liu
Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)  
Real-Time Task Model and Scheduling Framework Task System Model Periodic tasks with fixed periods and hard deadlines are very common in real-time systems [11, 12] .  ...  Section 5 developes efficient scheduling algorithms for hard aperiodic, real-time tasks based on the quantities derived in earlier sections.  ...  Appendix Proof: We know that We set h = s − t and x k = t − r k and given the fact that Similarly, Therefore, the cumulative released workload processes V i (t), i = 1, 2, . . . n, are periodic having  ... 
doi:10.1109/real.1999.818836 dblp:conf/rtss/ThomadakisL99 fatcat:spfn35ggejd3lantyvmb6ipj3u

An Adaptive Emergency First Intelligent Scheduling Algorithm for Efficient Task Management and Scheduling in Hybrid of Hard Real-Time and Soft Real-Time Embedded IoT Systems

Sehrish Malik, Shabir Ahmad, Israr Ullah, Dong Hwan Park, DoHyeun Kim
2019 Sustainability  
In this work, we propose a custom tailored adaptive and intelligent scheduling algorithm for the efficient execution and management of hard and soft real time tasks in embedded IoT systems.  ...  The proposed scheduling algorithm aims to distribute the CPU resources fairly to the possibly starving, in overloaded cases, soft real-time tasks while focusing on the execution of high priority hard real-time  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/su11082192 fatcat:24pdvyccajefpdl7po4ajant4i

Research on Embedded Multi-task Balancing Scheduling Algorithm

Han Zhuangzhi, Ma Tianlin, Changde Lu, Xuesheng Pei, Jianning Su
2018 MATEC Web of Conferences  
Therefore, based on the method of event interruption, timed interruption and task decomposition, the real-time performance of the completion of the task of the embedded system is achieved.  ...  When the real-time task is accomplished by the embedded system of the operating system, the task needs to meet certain conditions and occupy part of the processor's resources.  ...  Real-time Mission One of the advantages of an embedded system is its ability to complete tasks in real time. The real-time execution of tasks is mainly accomplished through event interrupts.  ... 
doi:10.1051/matecconf/201817601025 fatcat:lvvgeun7czg6jpg7j7khit24yi

A Survey on Scheduling Approaches for Hard Real-Time Systems

Mehrin Rouhifar, Reza Ravanmehr
2015 International Journal of Computer Applications  
This paper composed of two parts; first part surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks.  ...  In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated that include both uni and multi processors schemes.  ...  The real-time system has requirements in terms of the deadline, so depending on the consequences of deadline missing, a real-time task can be classified to three categories of hard, soft or firm.  ... 
doi:10.5120/ijca2015907656 fatcat:na7u3dgqsjhphl253ecd22jkau

Enhancing Energy Efficiency in Temperature Controlled Dynamic Scheduling Technique for Multi Processing System on Chip

2019 Sukkur IBA journal of emerging technologies  
The proposed technique also considers various thermal values by consulting the previous priorities of task on multicore systems.  ...  type of tasks and forecast them according to the priority by maintaining the previous history.  ...  In real-time embedded systems the overall accuracy of the system depends on both the useful accuracy of the system and also on time constraints.  ... 
doi:10.30537/sjet.v2i2.477 fatcat:33ndfg74jbbwpjapddg5sf7aci

A Hybrid Real-Time Scheduling Approach on Multi-Core Architectures

Pengliu Tan, Jian Shu, Zhenhua Wu
2010 Journal of Software  
This paper proposes a hybrid scheduling approach for real-time system on homogeneous multi-core architecture.  ...  Then the parallel tasks are dispatched to different cores, so as to execute in parallel. In each core, real-time tasks can run concurrently with nonreal-time tasks.  ...  SCHEDULING ARCHITECTURE The workload in the real-time system consists of realtime (hard and soft) and non-real-time tasks.  ... 
doi:10.4304/jsw.5.9.958-965 fatcat:h6bowauo6nfcvocpb6rdlx6x3u

Cache-aware static scheduling for hard real-time multicore systems based on communication affinities [article]

Lilia Zaourar, Maurice Pitel
2013 arXiv   pre-print
An open challenge is therefore to efficiently schedule hard real-time tasks on a multicore architecture.  ...  Such multicore systems are generally designed for improving the performance in average case, while hard real-time systems must consider worst-case scenarios.  ...  RELATED WORK [2] focuses on the memory-to-L 2 traffic in the cache hierarchy of soft real-time systems.  ... 
arXiv:1312.4509v1 fatcat:7az4sdtmrrek3hzmt6noqsnlza

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks

Mihai-Victor Micea, Cristina-Sorina Stangaciu, Valentin Stangaciu, Daniel-Ioan Curiac
2017 Sensors  
of extensive simulations (over 22,000 hard real-time task sets) and the measurements performed on a real sensor mote with hard real-time operating specifications.  ...  This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H 2 RTS), which combines a static, clock driven method with a dynamic, event driven scheduling technique, in  ...  Mihai-Victor Micea and Daniel-Ioan Curiac analyzed the state-of-the-art in the field, proposed the theoretical model of the scheduling system, defined and supervised the research.  ... 
doi:10.3390/s17071504 pmid:28672856 pmcid:PMC5539701 fatcat:2tzb3hpsh5d53dgwqjouhxcs4q

A capacity sharing and stealing strategy for open real-time systems

Luís Nogueira, Luís Miguel Pinho
2010 Journal of systems architecture  
This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems.  ...  among tasks of open real-time systems.  ...  If each hard real-time task is scheduled by an isolated CSS server with a reserved capacity equal to the task's WCET and period equal to the task's period, it behaves like a standard hard task scheduled  ... 
doi:10.1016/j.sysarc.2010.02.003 fatcat:swvtwt7wsrgfzh5hjd6zrb7sya

Comparative Study of Scheduling Algorithms for Real Time Environment

Ishan Khera, Ajay Kakkar
2012 International Journal of Computer Applications  
Scheduling is a technique which makes an arrangement of performing certain tasks at specified period.  ...  The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but  ...  In 2012, Wan Yeon Lee [11] proposed energy-efficient scheduling of periodic real-time tasks on lightly loaded multicore processors which considered the processors contained more processing cores than  ... 
doi:10.5120/6233-7797 fatcat:z6nergndrne5zfsok7x4wbgxae

Real-Time Operating Systems: Problems and Novel Solutions [chapter]

Giorgio Buttazzo
2002 Lecture Notes in Computer Science  
In order to provide an off-line guarantee of the critical timing constraints, deterministic and analyzable algorithms are required in all kernel mechanisms, especially involving scheduling, inter-task  ...  These techniques provide efficient support to real-time multimedia systems.  ...  An operating system able to manage hard tasks is called a hard real-time system [4] [25] . In general, hard real-time systems have to handle both hard and soft activities.  ... 
doi:10.1007/3-540-45739-9_3 fatcat:olqlk5hpejgozfsnb7mdgqhh2a

Energy-Efficient Real-Time Task Scheduling with Task Rejection

Jian-Jia Chen, Tei-Wei Kuo, Chia-Lin Yang, Ku-Jei King
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
This research explores real-time systems composed of homogeneous multiple processors with the capability of dynamic voltage scaling (DVS), in which a given task can be rejected with a specified value of  ...  The objective is to minimize the summation of the total rejection penalty for the tasks that are not completed in time and the energy consumption of the system.  ...  For uniprocessor scheduling, Irani et al. [10] proposed approximation algorithms for aperiodic real-time tasks. For periodic real-time tasks in uniprocessor systems, Jejurikar et al.  ... 
doi:10.1109/date.2007.364535 fatcat:tcw6jajh2fezpnryo6rgawb4x4

Soft Real-Time Fuzzy Task Scheduling For Multiprocessor Systems

Mahdi Hamzeh, Sied Mehdi Fakhraie, Caro Lucas
2007 Zenodo  
To alleviate these difficulties, we have proposed a fuzzy scheduling approach to arrange real-time periodic and non-periodic tasks in multiprocessor systems.  ...  In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real-time constraints is shown to be NP-hard.  ...  The model described in [27] uses fuzzy inference for scheduling non-preemptive periodic tasks in soft real-time multiprocessing systems.  ... 
doi:10.5281/zenodo.1328405 fatcat:5spgrr6nvzdzxjbe3fswssjwr4

Preemption-aware dynamic voltage scaling in hard real-time systems

Woonseok Kim, Jihong Kim, Sang Lyul Min
2004 Proceedings of the 2004 international symposium on Low power electronics and design - ISLPED '04  
However, most existing DVS algorithms focus on reducing the energy consumption of CPU only, ignoring their negative impacts on task scheduling and system wide energy consumption.  ...  Dynamic voltage scaling (DVS) is a well-known low-power design technique for embedded real-time systems.  ...  MOTIVATION System Model We consider a preemptive hard real-time system in which periodic real-time tasks are scheduled under RM scheduling policy (that is, the shorter the task period is, the higher  ... 
doi:10.1145/1013235.1013328 dblp:conf/islped/KimKM04 fatcat:4nbg6gjfhfgotpn2nntuf4t444

Dynamic Scheduling of Skippable Periodic Tasks With Energy Efficiency In Weakly Hard Real-Time System

Santhi Baskaran, P Thambidurai
2010 International Journal of Computer Science & Information Technology (IJCSIT)  
Three algorithms namely Red Tasks Only (RTO), Blue When Possible (BWP) and Red as Late as Possible (RLP) are proposed in the literature to schedule the real-time tasks in Weakly-hard real-time systems.  ...  consumption or high throughput, while it meets the timing constraints of the real-time tasks.  ...  Existing scheduling algorithms (without energy efficiency) for weakly-hard real-time systems are explained in Section 3.  ... 
doi:10.5121/ijcsit.2010.2610 fatcat:bsmp4eqaajcxrkvfccqgrfdsh4
« Previous Showing results 1 — 15 out of 104,749 results