This paper describes a stochastic analysis method for general periodic real-time systems. The proposed method accurately computes the response time distribution of each task in the system, thus making it possible to determine the deadline miss ...

Simultaneous multithreading (SMT) improves processor throughput by processing instructions from multiple threads each cycle. This is the first work to explore soft real-time scheduling on an SMT processol: Scheduling with SMT requires two decisions: ( 1)...

This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how to choose target deadlines for jobs from their time-varying deadlines so ...

The Quantized Earliest Deadline First (Q-EDF) scheduling policy assumes a limited number of priority Ievels available to express task (or packet) deadlines. This situation arises in computer and communication systems in which priority levels must be ...

Pfair scheduling has usually been applied in the context of scheduling periodic tasks with coinciding periods and deadlines. This paper addresses the problem of scheduling hard real-time tasks characterized by arbitrary deadlines in a pfair manner on ...

In this paper, we present the first end-to-end fairness analysis of a network of fair servers. We argue that it is difficult to extend existing single-node fairness analysis to an end-to-end analysis of a network where each node may employ a different ...

This paper introduces and shows how to schedule two novel scheduling abstractions that overcome limitations of existing work on preemption threshold scheduling. The abstractions are task clusters, groups of tasks that are mutually non-preemptible by ...

We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitters using a schedule that controls the scanning of disjoint frequency ...

The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo-polynomial time, thereby restricting the application of the concerned ...