Journal Article10.1109/32.637146
A multiframe model for real-time tasks
Aloysius K. Mok,Deji Chen +1 more
298
TL;DR: A multiframe real time task model which allows the executionTime of a task to vary from one instance to another by specifying the execution time of atask in terms of a sequence of numbers is given.
read more
Abstract: The well known periodic task model of C.L. Liu and J.W. Layland (1973) assumes a worst case execution time bound for every task and may be too pessimistic if the worst case execution time of a task is much longer than the average. We give a multiframe real time task model which allows the execution time of a task to vary from one instance to another by specifying the execution time of a task in terms of a sequence of numbers. We investigate the schedulability problem for this model for the preemptive fixed priority scheduling policy. We show that a significant improvement in the utilization bound can be established in our model.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Real-time calculus for scheduling hard real-time systems
Lothar Thiele,Samarjit Chakraborty,Martin Naedele +2 more
- 28 May 2000
TL;DR: A link between three areas, namely Max-Plus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and real-time scheduling is established.
716
System level performance analysis - the SymTA/S approach
Rafik Henia,Arne Hamann,Marek Jersak,Razvan Racu,Kai Richter,Rolf Ernst +5 more
- 25 Jul 2005
TL;DR: The paper gives an overview of current research interests in the SymTA/S project and determines system-level performance data such as end-to-end latencies, bus and processor utilisation, and worst-case scheduling scenarios.
589
Elastic task model for adaptive rate control
Giorgio Buttazzo,Giuseppe Lipari,Luca Abeni +2 more
- 02 Dec 1998
TL;DR: A novel periodic task model is presented, in which tasks' periods are treated as springs, with given elastic coefficients, to provide a simple and efficient mechanism for controlling the quality of service of the system as a function of the current load.
Elastic scheduling for flexible workload management
TL;DR: This work presents a novel scheduling framework in which tasks are treated as springs with given elastic coefficients to better conform to the actual load conditions, and under this model, periodic tasks can intentionally change their execution rate to provide different quality of service.
Generalized Multiframe Tasks
TL;DR: A framework for determining feasibility for a wide variety of task systems is established and a framework is applied to this task model to obtain a feasibility-testing algorithm that runs in time pseudo-polynomial in the size of the input for all systems of such tasks whose densities are bounded by a constant less than one.
271
References
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.
MPEG: a video compression standard for multimedia applications
TL;DR: Design of the MPEG algorithm presents a difficult challenge since quality requirements demand high compression that cannot be achieved with only intraframe coding, and the algorithm’s random access requirement is best satisfied with pure intraframes coding.
2.5K
The rate monotonic scheduling algorithm: exact characterization and average case behavior
John P. Lehoczky,Lui Sha,Y. Ding +2 more
- 05 Dec 1989
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.
1.6K
•Dissertation
Fundamental design problems of distributed systems for the hard-real-time environment
Aloysius K. Mok
- 01 Jun 1983
TL;DR: This work shall provide a graph-based computation model which is more suitable for expressing the computation requirements of the real-time environment, and is an extension of CONSORT (Control Structure Optimized for Real-Time), an experimental software design system.
1K
Aperiodic task scheduling for real-time systems
TL;DR: A new algorithm is presented, the Sporadic Server algorithm, which greatly improves response times for soft deadline a periodic tasks and can guarantee hard deadlines for both periodic and aperiodic tasks.
982