9,095 Hits in 5.6 sec

An Effective Self-test Scheduling for Realtime Processor based System

J. V. N. Ramesh, B. Naresh Kumar Reddy, V. V. Murali Krishna, B. M. Kumar Gandhi, V. Shiva, M. Dronika Devi
2015 International Journal of Smart Home  
asset necessities: Memory, execution time and power utilization, these necessity are not generally simple to fulfil in real-time embedded system with hard task deadlines.  ...  Now a days Jobs are Scheduled in a single processor or more than one processor, a real time job is scheduled or executed based on requirements, An Successful task in embedded system ought to have constrained  ...  Corollary: The schedulbility of EDF&LRT in a single processor. Proof: The proof directly comes from lemma1 and lemma2. Combination of these two scheduling mechanism in a single processor.  ... 
doi:10.14257/ijsh.2015.9.3.10 fatcat:7777um5x5jg6xpxhnls462sggm

Implementation & Performance Analysis of Real Time Scheduling Algorithms for Three Industrial Embedded Applications (IEA)

Vishal Vora
2012 International Journal of Advanced Information Technology  
Some real time scheduling algorithms like Pre-emptive & Non Preemptive, Round Robin Scheduling, &Time Slicing are few of the favourites for various embedded applications.  ...  Real time scheduling algorithms are mainly depending on type of task i.e. either periodic or aperiodic or sporadic.  ...  ACKNOWLEDGEMENTS The authors would like to acknowledge math works incorporation, Management and R &D Team of Orpat Pvt. Ltd, India for providing required infrastructure for this work.  ... 
doi:10.5121/ijitcs.2012.2601 fatcat:5tulrevslngmrauujomd527nny

Minimising the Energy Consumption of Real-Time Tasks with Precedence Constraints on a Single Processor [chapter]

Hui Wu, Sridevan Parameswaran
2006 Lecture Notes in Computer Science  
In this paper, we present two optimal energy-aware polynomial-time algorithms for scheduling a set of tasks with release times, deadlines and precedence constraints on a single processor with continuous  ...  Energy-aware task scheduling is critical for real-time embedded systems.  ...  Conclusion We proposed two polynomial-time algorithms for finding a minimum energy schedule for a set of tasks with individual release times, deadlines and precedence constraints on a single processor  ... 
doi:10.1007/11802167_7 fatcat:qdc4ezlkdrhs3gb2iur54m6cba

Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm [article]

Jagbeer Singh, Satyendra Prasad Singh
2012 arXiv   pre-print
This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor  ...  In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on multiprocessors): on M processors  ...  For example, every job of a task with an execution cost of 4 time units and relative deadline of 10 time units can be sliced into two sub-jobs with execution cost and relative deadline of 2 and 5, respectively  ... 
arXiv:1205.0124v1 fatcat:c3a2tjhh6zhebof3pcvto5o5dm

Fault Tolerance in Real Time Multiprocessors - Embedded Systems [article]

A. Christy Persya, T.R. Gopalakrishnan Nair
2010 arXiv   pre-print
In this paper we have proposed an integrated approach with a new algorithm, called SASA (Sorting And Sequential Assignment) which maps the real time task assignment with task schedule and fault tolerance  ...  The most popularly used real time task assignment algorithms are First Fit (FF), Best Fit (BF), Bin Packing (BP).The common task scheduling algorithms are Rate Monotonic (RM), Earliest Deadline First (  ...  Searching for Timeslot When task Ti arrives, check each processor to find if the primary copy of the task can be scheduled between release time and deadline. Say it is scheduled on processor Pi.  ... 
arXiv:1001.3727v1 fatcat:t3py6kfuyrgctmy6d4flbejybi

Reservation-Based Scheduling for Automotive DSMS under High Overload Condition

Jaeyong Rho, Takuya Azumi, Akihiro Yamaguchi, Kenya Sato, Nobuhiko Nishio
2016 Journal of Information Processing  
The proposed algorithm reserves processor time preferentially for hard real-time tasks so that tasks can meet deadlines under overload conditions.  ...  However, hard real-time deadlines cannot be guaranteed due to unpredictable load changes caused by data streams.  ...  If resource contention occurs between two OP S i s with the same release time, period, and absolute deadline, task starvation can be avoided by rejecting the task with the lower * 2 Scheduling and context-switching  ... 
doi:10.2197/ipsjjip.24.751 fatcat:agt53gd32be2vjxewe4nkkta7q

Rate-monotonic scheduling for hard-real-time systems

Alan A. Bertossi, Andrea Fusiello
1997 European Journal of Operational Research  
This paper provides a review on deterministic scheduling algorithms for hard-real-time systems, focusing mainly on fixed priority, preemptive scheduling of periodic tasks on a single processor and, in  ...  A scheduling algorithm specifies an order in which all the tasks are to be executed, in a way that all the time deadlines are met.  ...  There are two ways to guarantee that all the task deadlines are met in a hard-real-time system.  ... 
doi:10.1016/s0377-2217(97)83306-1 fatcat:vpqgnmngjffl5oatttf3wn3t64

A High Performance Load Balance Strategy for Real-Time Multicore Systems

Keng-Mao Cho, Chun-Wei Tsai, Yi-Shiuan Chiu, Chu-Sing Yang
2014 The Scientific World Journal  
Finding ways to distribute workloads to each processor core and efficiently reduce power consumption is of vital importance, especially for real-time systems.  ...  In this paper, a novel scheduling algorithm is proposed for real-time multicore systems to balance the computation loads and save power.  ...  This work was supported in part by the National Science Council of Taiwan, under Grants NSC102-2221-E-041-006 and NSC100-2218-E-006-028-MY3 and in part by the Research Center of Energy Technology and Strategy  ... 
doi:10.1155/2014/101529 pmid:24955382 pmcid:PMC4009124 fatcat:63666lr5bbeplppfbk3ltcbtmy

Real-time task scheduling for energy-aware embedded systems

Vishnu Swaminathan, Krishnendu Chakrabarty
2001 Journal of the Franklin Institute  
For larger task sets, we present a novel low-energy earliestdeadline-first (LEDF) scheduling algorithm and apply it to two real-life task sets.  ...  We present a new approach for scheduling workloads containing periodic tasks in real-time systems.  ...  Each task has a release time, a deadline and length. We assume the two processor speeds to be 300 million instructions per second (MIPS) at 2.47 V and 400 MIPS at 3.3 V.  ... 
doi:10.1016/s0016-0032(01)00021-7 fatcat:dpijzxbypvdzfmaon4ot5pu4m4

Revealing the Secrets of RUN and QPS: New Trends for Optimal Real-Time Multiprocessor Scheduling

Ernesto Massa, George Lima, Paul Regnier
2014 2014 Brazilian Symposium on Computing Systems Engineering  
By putting RUN and QPS sideby-side, we bring about their fundamental properties and help in the understanding of the multiprocessor real-time scheduling problem.  ...  New scheduling algorithms have shown that this is not the case. In this paper we explain why two of these algorithms, RUN and QPS, achieve optimality with only a few preemptions and migrations.  ...  At time 2 a new server job is released, but now with workload equal to 0.6 since the time interval between release time and deadline is equal to 3 − 2 = 1.  ... 
doi:10.1109/sbesc.2014.32 dblp:conf/sbesc/MassaLR14 fatcat:cn7wofojrbaedbn7eaccd4oefa

Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT

S. Ewins Pon Pushpa, Manamalli Devasigamani
2014 Modelling and Simulation in Engineering  
to be scheduled, at any release time are also derived.  ...  Given the computation times, this paper proposes two utilization bound algorithms to derive interrelease times for nonpreemptive periodic tasks, using a new priority scheme, "Rate Monotonic Algorithm-Shortest  ...  ) th release time of +1 ( ) ( + 1)th release time of and deadline for the task released at ( ) ( ) Latest feasible start time for released at ( ), to start execution in order to meet its deadline. ( )  ... 
doi:10.1155/2014/705929 fatcat:nxghmrreybeebc5yj3b27jzem4

On-Line Dynamic Voltage Scaling for EDZL Scheduling on Symmetric Multiprocessor Real-Time Systems

Xuefeng Piao, Moonju Park
2015 International Journal of Multimedia and Ubiquitous Engineering  
The proposed algorithm dynamically adjusts processor speed at each scheduling point with re-assigning deadlines of active jobs that reduces power consumption of processors while making all real-time tasks  ...  Section 3 briefly reviews the EDZL scheduling and Section 4 presents a deadline reassignment method for scaling voltage with the EDZL scheduling.  ...  When the job set is scheduled by EDZL on two processors 1 and 2 , the job set is scheduled in the same way as the EDF schedule since no job reaches zero laxity as shown in Figure 1(a) .  ... 
doi:10.14257/ijmue.2015.10.7.18 fatcat:2lcq2la7wfhbhcmfup5xhyzmuy

Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking [chapter]

Nan Guan, Zonghua Gu, Qingxu Deng, Shuaihong Gao, Ge Yu
2007 Lecture Notes in Computer Science  
In this paper, we use model-checking to provide a technique for exact multiprocessor scheduability analysis by modeling the real-time multi-tasking system with Timed Automata (TA), and transforming the  ...  for exact schedulability analysis for multi-processor systems analogous to the response time analysis algorithm for single-processor systems.  ...  Multiprocessor (MP) systems are drawing a lot of attention recently, with industry trends such as multi-core processors and Multiprocessor Systems-on-a-Chip (MPSoC), hence real-time scheduling and schedulability  ... 
doi:10.1007/978-3-540-75664-4_26 fatcat:o3hj5yggizgnfji52svbguknay

Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy

Ms. Neha Jain, Mrs. Varsha Zokakar
2015 International Journal of Computer Trends and Technology  
The process deadline, processor capacity, start time, processing time, and release time of task are not known in prior, which makes the scheduling process complicated.  ...  In the real-time system, scheduling is an important factor which decides a schedule for a set of tasks.  ...  Generally two type of scheduling algorithms are used in real-time system, i.e. static and dynamic.  ... 
doi:10.14445/22312803/ijctt-v25p107 fatcat:gxzl7anwv5g4rgee4co6w5gnqe

Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Manar Qamhieh, Frédéric Fauberteau, Laurent George, Serge Midonnet
2013 Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13  
We focus on Global Earliest Deadline First scheduling of sporadic DAG tasksets with constrained-deadlines on a system of homogeneous processors.  ...  In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Directed Acyclic Graph (DAG) on multiprocessor architectures.  ...  We analyzed the real-time DAG tasks, and we proposed two algorithms to calculate local offsets and deadlines for each subtask in the DAG.  ... 
doi:10.1145/2516821.2516836 dblp:conf/rtns/QamhiehF0M13 fatcat:wwdi466hqrfsvcrlwk5ue66oue
« Previous Showing results 1 — 15 out of 9,095 results