The problem of scheduling n unit-time jobs with real-valued release times and deadlines is shown to be in NC. The solution is based on characterizations of a canonical schedule and best subset of jobs to be scheduled in a given time interval. The algorithm runs in O((logn)2) time and uses O(n'ljlogn) processors.

One approach to avoid timing faults in hard, real-time systems is to make available intermediate, imprecise results produced by real-time processes. When a result of the desired quality cannot be produced in time, an imprecise result of acceptable quality produced before%he deadline can be used. This paper discusses the problem of scheduling periodic jobs to meet deadlines on a system that prov...

Analytical and eecient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This chapter presents several worst-case bounds and eecient algorithms for determining how lat...

In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all ...

In this paper we consider the problem of scheduling jobs having real-time constraints on a multiprocessor. If a job does not complete within a certain time interval of its arrival to such a system, it is considered useless and need not be served. It is therefore desirable to schedule jobs so that the fraction of jobs served within their respective deadlines is maximized. We model such a system ...

This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework for making repeated scheduling decisions based on dynamically observed information about unscheduled jobs and system’s resources. This framework generalizes the standard scheduling problem to a resource-constrained envi...

Systems whose correctness depends on their temporal aspects as well as their functional aspects.Many papers have been published in the field of real-time scheduling these. A common characteristic of many real-time systems is that their requirements.fundamental to the design of multicoreready real-time operating systems: 1 Which scheduling policies offer the greatest flexibility in satisfying te...