Journal ArticleDOI
Task scheduling policies for real-time systems
TLDR
A variety of task scheduling policies for use with real-time embedded systems are described, including commonly used practical strategies as well as new ideas from the research community.About:
This article is published in Microprocessors and Microsystems.The article was published on 1994-01-01. It has received 29 citations till now. The article focuses on the topics: Fixed-priority pre-emptive scheduling & Fair-share scheduling.read more
Citations
More filters
A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems
Ishwari Singh Rajput,Deepa Gupta +1 more
TL;DR: The main objective of this paper is to develop a new approach for round robin C P U scheduling which improves the performance of CPU in real time operating system and implements the concept of aging by assigning new priorities to the processes.
Journal ArticleDOI
Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations
TL;DR: This paper evaluates by simulation the performance of strategies for the dynamic scheduling of composite jobs in a homogeneous distributed real-time system and provides an alternative version which allows imprecise computations, taking into account the effects of input error on the processing time of the component tasks of a job.
Journal ArticleDOI
Scheduling multiple task graphs in heterogeneous distributed real-time systems by exploiting schedule holes with bin packing techniques
TL;DR: By simulation the performance of strategies for the dynamic scheduling of composite jobs in a heterogeneous distributed real-time system is evaluated, showing that the alternative versions of the algorithms outperform their respective counterparts.
Posted Content
A New Scheduling Algorithms For Real Time Tasks
C. Yaashuwanth,R. Ramesh +1 more
TL;DR: It is observed that the proposed architectures solves the problems encountered in round robin architecture in soft real time by decreasing the number of context switches waiting time and response time thereby increasing the system throughput.
Proceedings Article
Performance evaluation of gang scheduling in distributed real-time systems with possible software faults
TL;DR: This paper provides an alternative version for each scheduling policy, which allows imprecise computations, and proposes a performance metric applicable to the problem.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
C. L. Liu,James W. Layland +1 more
TL;DR: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.
Proceedings ArticleDOI
The rate monotonic scheduling algorithm: exact characterization and average case behavior
John P. Lehoczky,Lui Sha,Y. Ding +2 more
TL;DR: An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set and a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets are represented.
Journal ArticleDOI
Misconceptions about real-time computing: a serious problem for next-generation systems
TL;DR: The author defines real-time computing and states and dispels the most common misconceptions about it and discusses the fundamental technical issues of real- time computing.
Journal ArticleDOI
Some Results of the Earliest Deadline Scheduling Algorithm
Houssine Chetto,Maryline Chetto +1 more
TL;DR: This paper reports results from some investigations into the problem of making optimum use of the remaining processor idle time in scheduling perlodk tasks, and provides an elRcient algorlthm lor determining maximum quantity of total idle time available between any two instants.