scholarly journals Energy performance evaluation for dynamic frequency scaling on rate monotonic and earliest deadline first scheduling algorithm

2018 ◽  
Vol 5 (1) ◽  
pp. 143-147
Author(s):  
et al. Sabri ◽  
Keyword(s):  
Performance Evaluation ◽  
Scheduling Algorithm ◽  
Energy Performance ◽  
Earliest Deadline First ◽  
Frequency Scaling ◽  
Dynamic Frequency Scaling ◽  
Rate Monotonic ◽  
Earliest Deadline ◽  
Dynamic Frequency

Effectiveness of DFS Tuning on Java Server Workload

2015 ◽  
Vol 25 (01) ◽  
pp. 1640005 ◽  
Author(s):  
Hitoshi Oi
Keyword(s):  
Power Consumption ◽  
Sampling Period ◽  
Threshold Level ◽  
Load Level ◽  
Clock Frequency ◽  
Frequency Scaling ◽  
Dynamic Frequency Scaling ◽  
Maximum Reduction ◽  
Dynamic Frequency

Dynamic frequency scaling (DFS) is a feature commonly found in modern processors. It lowers the clock frequency of a core according to the load level and reduces the power consumption. In this paper, we present a case study of tuning DFS parameters on a platform with an AMD Phenom II X6 using the SPECjEnterprise2010 (jEnt10) and SPECjbb2005 (jbb05) as the workload. In jEnt10, a longer sampling period of core utilization (up to 1.5[Formula: see text]s) reduced the power by 6[Formula: see text]Watt at 25% load level. At 50% load level, combining it with an increased threshold level (98%) to switch the clock frequency further reduced the power consumption by up to 10[Formula: see text]Watt. In jbb05, stretching the sampling period was only effective up to 0.5[Formula: see text]s. The maximum reduction was observed at around 60% load level. Raising the threshold level was not effective for jbb05.

ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems

2013 ◽  
pp. 85-96
Author(s):  
Apurva Shah ◽  
Ketan Kotecha
Keyword(s):  
Real Time ◽  
Computational Models ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Multiprocessor Systems ◽  
Individual Agent ◽  
Collective Foraging ◽  
Time Systems ◽  
Earliest Deadline

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well during overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm.

A 120-MHz–1.8-GHz CMOS DLL-Based Clock Generator for Dynamic Frequency Scaling

2006 ◽  
Vol 41 (9) ◽  
pp. 2077-2082 ◽  
Author(s):  
J.-H. Kim ◽  
Y.-H. Kwak ◽  
M. Kim ◽  
S.-W. Kim ◽  
C. Kim
Keyword(s):  
Clock Generator ◽  
Frequency Scaling ◽  
Dynamic Frequency Scaling ◽  
Dynamic Frequency

Power Management Through Dynamic Frequency Scaling for Low and Medium Bit-Rate Digital Receivers

2006 ◽  
Vol 2 (3) ◽  
pp. 356-364
Author(s):  
A. P. Kakarountas ◽  
N. D. Zervas ◽  
G. Theodoridis ◽  
H. E. Michail ◽  
D. Soudris
Keyword(s):  
Power Management ◽  
Bit Rate ◽  
Frequency Scaling ◽  
Dynamic Frequency Scaling ◽  
Digital Receivers ◽  
Dynamic Frequency
Sign in / Sign up

Export Citation Format

Share Document