We present an online uniprocessor scheduling algorithm TD 1 that actually has a competitive factor of 1/4; this bound is thus shown to be tight.
Abstract: The authors study the performance of online algorithms in environments where no value is obtained for the partial execution of a request.
If a task request is successfully scheduled to completion, a value equal to the task's execution time is obtained; otherwise no value is obtained. We prove that ...
Recommendations · Competitive on-line scheduling for overloaded real-time systems · On-Line Real-Time Task Scheduling on Partitionable Multiprocessors.
The authors study the performance of online algorithms in environments where no value is obtained for the partial execution of a request.
The authors study the performance of online algorithms in environments where no value is obtained for the partial execution of a request.
ABSTRACT. This paper investigates the task scheduling problem in the context of reservation- based real-time systems that provide quality of service (QoS) ...
People also ask
What is the difference between offline and online scheduling in real-time system?
What is task scheduling in real-time system?
What is the best scheduling algorithm for real-time?
What are the two main types of real-time scheduling?
This paper investigates the task scheduling problem in the oontext of reservation-based real-time systems that provide quality of service (QoS) guarantees.
The model considered in this paper consists of a single server with its associated buffer. The server multiplexes packets from several real-time input streams ...
It is shown that the competitive factor for online scheduling of unit-length packets with hard deadlines in slotted time is in the interval [0.5, ] ...