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

The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Previous research has focused on power conservation for either the processor or I/O devices alone. The system-wide energy conservation has received little attention. In this paper, we analyze the problem of system-wide energy-efficient scheduling for hard real-t...

The IPNoSys is an architecture that exploits the advantages of NoCs as parallel communication, reusability and scalability to transform the routers in processing elements building a packet-driven architecture that processing while routing the packets. This represents a paradigm break of traditional NoC-based MPSoC systems, which there is the separation between computation and communication. Wit...

In a multi-purpose machine scheduling problem, jobs can be processed by any machine of a prespecified subset of the machine-set. For the preemptive problem we give a combinatorial algorithm and obtain a min-max theorem for the minimal makespan. We give a combinatorial 2-approximation algorithm based on this algorithm for the non-preemptive case, which is NP-hard. We introduce a new special pree...

In the paper the combined routing-scheduling problem which consists in scheduling of tasks on moving executors is considered. The case with non-preemptive and independent tasks, unrelated executors as well as interval processing times to minimize the maximum lateness is investigated. The robust scheduling problem based on the modified relative regret function is formulated. The solution algorit...

Project preemption allows resources flow passively from one project or task to another. Due to high-cost and high-risk characteristics of software development, project preemption might have a significant impact on the ultimate completion time of a software project. This article examines the feasibility of the Taguchi’s parameter design to achieve robust resource assignment for multiple software...

Modern GPUs are broadly adopted in many multitasking environments, including data centers and smartphones. However, the current support for the scheduling of multiple GPU kernels (from different applications) is limited, forming a major barrier for GPU to meet many practical needs. This work for the first time demonstrates that on existing GPUs, efficient preemptive scheduling of GPU kernels is...

We investigate the power of online algorithms and mechanisms for two different classic models of preemptive online job scheduling. These two models are resumptive and non-resumptive job scheduling. The distinction is when we decide to allocate a previously preempted job. In the resumptive model we resume the job’s allocation as if no preemption has occurred. In the non-resumptive model the job’...

This paper maintains that fixed-priority process-based preemptive scheduling is, arguably, more convenient, flexible and responsive than conventional cyclic scheduling for the construction of new-generation software-intensive satellite control systems. Predictable usage of preemptive priority-based scheduling, however, demands the support of mature static analysis techniques. Worst-case respons...