An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of the worst-case execution time (WCET) estimation. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are often too pessimisti...

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...

In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability. This unavailability can be either unforeseeable (online models) or known a priori (offline models). For the online models we are mainly interested in preemptive schedules for problem formulations where the machine un...

When a computer system schedules jobs there is typically significant cost associated with preempting job during execution. This can be incurred from the expensive task of saving memory’s state or loading data into and out memory. Thus, it desirable to schedule non-preemptively avoid costs preemption. There need for non-preemptive schedulers desktops, servers, centers. Despite this need, gap bet...