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 …

We consider the problem of scheduling a set of n preemptable tasks in a system having r
resources. Each task has an arbitrary, but known, worst case processing time and a …

Real-time systems have to complete the execution of a task within the predetermined time
while ensuring that the execution results are logically correct. Such systems require …

A prerun-time scheduling algorithm is presented that addresses the problem of process
sequencing. The algorithm is designed for multiprocessor applications with preemptable …

Real-time multiprocessor systems are now commonplace. Designs range from single-chip
architectures, with a modest number of processors, to large-scale signal-processing …

Scheduling periodic and aperiodic tasks to meet their time constraints has been an
important issue in the design of real-time computing systems. Usually, the task scheduling …

Optimal scheduling of real-time tasks on multiprocessor systems is known to be
computationally intractable for large task sets. Any practical scheduling algorithm for …

The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single
unit software resources on a single processor is considered. The correctness conditions are …

This paper describes a heuristic approach for solving the problem of dynamically scheduling
tasks in a real-time system where tasks have deadlines and general resource requirements …

In a parallelizable task model, a task can be parallelized and the component tasks can be
executed concurrently on multiple processors. We use this parallelism in tasks to meet their …