Algorithms for scheduling real-time tasks with input error and end-to-end deadlines
Wu-chun Feng,J. W.-S. Liu +1 more
TL;DR: In this article, a two-level scheduler is used to schedule preemptive, imprecise, composite tasks in real-time, where each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part.
read more
Abstract: This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by a two-level scheduler. At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of the composite task.
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
Optimal reward-based scheduling of periodic real-time tasks
Hakan Aydin,Rami Melhem,Daniel Mosse,P. Mejfa-Alvarez +3 more
- 01 Dec 1999
TL;DR: This paper proves the existence of an optimal schedule where the optional service time of a task is constant at every instance and how to efficiently compute this service time, and proves that RMS-h, RMS with harmonic periods, EDF and LLF policies are optimal when used with the optimal service times.
Optimal reward-based scheduling for periodic real-time tasks
TL;DR: This paper addresses the reward-based scheduling problem for periodic tasks and proves the optimality of Rate Monotonic Scheduling (with harmonic periods), Earliest Deadline First, and Least Laxity First policies for the case of uniprocessors when used with the optimal service times.
Flexible Soft Real-Time Processing in Middleware
Scott A. Brandt,Gary J. Nutt +1 more
TL;DR: The Dynamic QoS Manager middleware, implemented on top of two different versions of Unix, is shown to be a highly effective system for supporting contemporary soft real-time desktop applications.
56
Probabilistic analysis and scheduling of critical soft real-time systems
Jane W. Liu,Mark K. Gardner +1 more
- 01 Jan 1999
TL;DR: In order to allow a trade-off between deadlines met and average performance, a probabilistic analysis technique is developed, call Stochastic Time Demand Analysis, for determining a lower bound on the rate at which deadlines are met in fixed priority systems.
55
Soft real-time application execution with dynamic quality of service assurance
Scott A. Brandt,Gary J. Nutt,T. Berk,M. Humphrey +3 more
- 18 May 1998
TL;DR: In this article, the authors describe a dynamic QoS resource manager (DQM) which is a middleware application that abstracts these new operating system interfaces so that they can be easily used in contemporary application environments.
54
References
Deliberation scheduling for problem solving in time-constrained environments
Mark S. Boddy,Thomas Dean +1 more
TL;DR: An approach to designing systems that are capable of taking their own computational resources into consideration during planning and problem solving by using expectations about the performance of decision-making procedures and preferences over the outcomes resulting from applying those procedures.
284
A fault-tolerant scheduling problem
TL;DR: An algorithm to generate an optimal schedule for the deadline mechanism is introduced, and a simple and efficient implementation is discussed.
138
On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks
J.K. Dey,Jim Kurose,Don Towsley +2 more
TL;DR: This work considers a real time task model where a task receives a "reward" that depends on the amount of service received prior to its deadline, and observes that the best performance is exhibited by a two level policy.
94
Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
Wei-Kuan Shih,J.W.S. Liu +1 more
TL;DR: This work describes two preemptive algorithms for scheduling on a processor n dependent tasks with rational ready times, deadlines, and processing times and finds an optimal schedule with the minimum total error.
74
Minimizing mean weighted execution time loss on identical and uniform processors
J. Blažewicz,Gerd Finke +1 more
TL;DR: A strongly polynomial algorithm based on a network flow technique, which minimizes the mean weighted execution time loss for an arbitrary number of identical as well as uniform processors.
58