This paper presents Warped-Compression, a warp-level register compression scheme for
reducing GPU power consumption. This work is motivated by the observation that the …

Global scheduling reduces the average response times as it can use the available
computing cores more efficiently for scheduling ready tasks. However, this flexibility poses …

Embedded systems involve the monitoring and control of complex physical processes using
applications running on dedicated execution platforms in aresource-constrained manner in …

Most recurrent real-time applications can be modeled as a set of sequential code segments
(or blocks) that must be (repeatedly) executed in a specific order. In this paper, we provide a …

A scheduling policy or a schedulability test is defined to be sustainable if any task system
determined to be schedulable remains so if it behaves" better" than mandated by its system …

Motivated by a string of recent errata, the paper argues that mechanized, yet readable
schedulability proofs are desirable, feasible to create with current tools and with reasonable …

The temporal correctness of safety-critical systems is typically guaranteed via a response-
time analysis (RTA). However, as systems become complex (eg, parallel tasks running on a …

Exact schedulability analysis of limited-preemptive (or non-preemptive) real-time workloads
with variable execution costs and release jitter is a notoriously difficult challenge due to the …

This paper provides an exact and sustainable schedulability test for a set of non-preemptive
jobs scheduled with a fixed-job-priority (FJP) policy upon a uniprocessor. Both classic work …

Non-preemptive scheduling is usually considered inferior to preemptive scheduling for time
critical systems, because the non-preemptive block would lead to poor task responsiveness …