A Scheduling with DVS Mechanism for Embedded Multi-Core Real-Time Systems
@article{Lee2011ASW, title={A Scheduling with DVS Mechanism for Embedded Multi-Core Real-Time Systems}, author={Liang-Teh Lee and Shin-Tsung Lee and Chaokai Tsai}, journal={International Journal of Digital Content Technology and Its Applications}, year={2011}, volume={5}, pages={51-64} }
Abstract With the advancement of technology, embedded systems have been widely used in portable devices. Portable embedded systems must have rather superior computing capability in order to meet real-time application demands. It is very important for the design of portable embedded system to enable minimum energy consumption while meeting real-time application demands. Dynamic voltage scaling technology enables effective reduction of energy consumption by utilizing slack time to modify…
Figures and Tables from this paper
6 Citations
Power-aware Scheduling of fixed priority tasks in soft real-time multicore systems
- Computer Science2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)
- 2013
This paper introduces the PAS-SRTMS (Power Aware Scheduling of fixed priority tasks in Soft Real-Time Multicore Systems) scheduling algorithm, a combination of Offline and Online scheduling with DVFS to schedule fixedpriority tasks on soft real-time Multicorean systems.
Phase distance mapping: a phase-based cache tuning methodology for embedded systems
- Computer ScienceDes. Autom. Embed. Syst.
- 2014
This paper proposes phase distance mapping, which directly determines the best configuration for a phase, thereby eliminating design space exploration and determines cache configurations within 1 % of the optimal configurations on average and yields an energy delay product savings of 27 % on average.
Dynamic phase-based tuning for embedded systems using phase distance mapping
- Computer Science2012 IEEE 30th International Conference on Computer Design (ICCD)
- 2012
This paper proposes phase distance mapping, which directly determines the best configuration for a phase, thereby eliminating design space exploration and yields an energy delay product savings of 26% on average.
Exploiting dynamic phase distance mapping for phase-based tuning of embedded systems
- Computer Science2013 IEEE 31st International Conference on Computer Design (ICCD)
- 2013
DynaPDM is proposed, a new dynamic phase distance mapping methodology that eliminates a priori designer effort, dynamically analyzes phases, and determines the best configurations, yielding average energy delay product savings of 28%-an 8% improvement on PDM-and configurations within 1% of the optimal.
Scheduling Divisible Loads with Return Messages on Multi-core Heterogeneous Clusters with Unknown System Parameters
- Business, Computer Science
- 2012
The experimental results on the heterogeneous cluster with multi-core machines show that the two-round probing method can estimate the system parameters and the multi-round distribution load strategy can obtain shorter scheduling length and has stronger practicability.
A Survey of Phase Classification Techniques for Characterizing Variable Application Behavior
- Computer ScienceIEEE Transactions on Parallel and Distributed Systems
- 2020
This paper presents a survey of phase classification techniques that have been proposed to exploit the advantages of adaptable computing through phase-based optimization, focusing on recent techniques and classify these techniques with respect to several factors in order to highlight their similarities and differences.
References
SHOWING 1-10 OF 17 REFERENCES
Real-time dynamic voltage scaling for low-power embedded operating systems
- Computer ScienceSOSP
- 2001
This paper presents a class of novel algorithms that modify the OS's real-time scheduler and task management service to provide significant energy savings while maintaining real- time deadline guarantees, and shows that these RT-DVS algorithms closely approach the theoretical lower bound on energy consumption.
Energy Efficient Scheduling of Real-Time Tasks on Multicore Processors
- Computer ScienceIEEE Transactions on Parallel and Distributed Systems
- 2008
Simulation results show that Dynamic Repartitioning can produce energy savings of about 8 percent even with the best energy-efficient partitioning algorithm, and Dynamic Core Scaling algorithm, which adjusts the number of active cores to reduce leakage power consumption under low load conditions.
A simple power-aware scheduling for multicore systems when running real-time applications
- Computer Science2008 IEEE International Symposium on Parallel and Distributed Processing
- 2008
This paper proposes a novel soft power-aware real-time scheduler for a state-of-the-art multicore multithreaded processor, which implements dynamic voltage scaling techniques, and shows that using a fair scheduling policy, the proposed algorithm provides, on average, energy savings.
Performance comparison of dynamic voltage scaling algorithms for hard real-time systems
- Computer ScienceProceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium
- 2002
This paper compares several key DVS algorithms recently proposed for hard real-time periodic task sets, analyze their energy efficiency, and discusses the performance differences quantitatively to give quantitative answers to several important DVS questions.
A dynamic voltage scaled microprocessor system
- EngineeringIEEE Journal of Solid-State Circuits
- 2000
A microprocessor system is presented in which the supply voltage and clock frequency can be dynamically varied so that the system can deliver high throughput when required while significantly…
Dynamic Frequency and Voltage Scaling for a Multiple-Clock-Domain Microprocessor
- Computer ScienceIEEE Micro
- 2003
A multiple clock domain (MCD) microarchitecture, which uses a globally asynchronous, locally synchronous (GALS) clocking style, permits future aggressive frequency increases, maintains a synchronous design methodology, and exploits the trend of making functional blocks more autonomous.
Static-priority scheduling on multiprocessors
- Computer ScienceProceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)
- 2001
It is proven that this scheduling algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm and successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocesser platform.
Real-time kernel
- Computer Science
- 2009
By adopting the real-time kernel 20, developers are capable of focusing on development of high level communication functions, and are not required to focus on non-low level plumbing code.
On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Computer SciencePerform. Evaluation
- 1982