An Approximation Algorithm for Energy-Efficient Scheduling on A Chip Multiprocessor
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Proceedings of the conference on Design, automation and test in Europe
Energy-efficient real-time task scheduling with task rejection
Proceedings of the conference on Design, automation and test in Europe
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Energy-efficient scheduling of a real-time task on DVFS-enabled multi-cores
Proceedings of the 2009 International Conference on Hybrid Information Technology
Energy-Saving DVFS Scheduling of Multiple Periodic Real-Time Tasks on Multi-core Processors
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Scheduling of stream-based real-time applications for heterogeneous systems
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Platform synthesis and partitioning of real-time tasks for energy efficiency
Journal of Systems Architecture: the EUROMICRO Journal
Power efficient rate monotonic scheduling for multi-core systems
Journal of Parallel and Distributed Computing
Energy-efficient tasks scheduling algorithm for real-time multiprocessor embedded systems
The Journal of Supercomputing
Energy and transition-aware runtime task scheduling for multicore processors
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Multiprocessor implementations of real-time systems tend to be more energy-efficient than uniprocessor implementations. However several factors, including the non-existence of optimal multiprocessor scheduling algorithms, combine to prevent all the computing capacity of a multiprocessor platform from being guaranteed a variable for executing the real-time workload. In this paper, this tradeoff 驴 that while increasing the number of processors results in lower energy consumption for a given computing capacity, the fraction of the capacity of a multiprocessor platform that is guaranteed available for executing real-time work decreases as the number of processors increases 驴 is explored in detail. Algorithms are presented for synthesizing multiprocessor implementations of hard-real-time systems comprised of independent periodic tasks in such a manner that the energy consumed by the synthesized system is minimized.