We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.

Deterministic and low end-to-end latency communication is an urgent demand for many safety-critical applications such as autonomous vehicles automated industries. The time-sensitive network (TSN) introduced Ethernet-based amendments in IEEE 802.1 TSN standards to support time-triggered (TT) traffic these applications. In the presence of TT flows, designed integrate Audio/Video Bridging (AVB) Be...

A task scheduling simulator for timing analysis of the various task sets with different scheduling policies was implemented and tested. The simulator supports the various scheduling policies like Rate Monotonic, deadline monotonic and EDF, widely used for scheduling real time applications. It simulates the task execution for the time period, and then it outputs the time based representation of ...

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

In this paper, we propose a new bandwidth allocation technique where a new stream can preempt an appropriate amount of bandwidth from other existing streams, considering both quality and priority requirements of users. The existing preemption-based technique has focused on the preemption among the streams with the same user. However, in multi-party multimedia applications, there would be a case...

I. PRELIMINARIES Time utility function (TUF) scheduling goes beyond the starttime-deadline notion to express tasks’ temporal constraints. The goal of the scheduler is to maximize system utility under the assumption that tasks aggregate a given amount of utility to the system as a function of when they execute. Work available in the literature include the characterization of time utility functio...

Assurance of timing requirements from a real-time system schedule can be obtained using schedulability analysis. Existing analysis techniques ignore the preemption overhead incurred by the system, when the tasks are scheduled using preemptive schedulers. Preemptive schedulers can preempt the execution of a real-time task when a higher priority task is released by the system. Every job preemptio...