Retention-Based Energy-Efficient and High-Core-Utilization Scheduling for Arbitrary-Deadline DAGs
A retention-oriented scheduling framework for always-on arbitrary-deadline Directed Acyclic Graph workloads, consisting of two algorithms with a clear progression, and shows that, compared with a representative work-conserving baseline with automatic retention/PG, PREHS reduces static energy consumption.