4ECE692 2009
Papers
• PowerHerd: A distributed scheme for dynamic satisfying peak power constraints in interconnection networks
• Dynamic voltage scaling with links for power optimization of interconnection networks
By L. Shang, L.-S. Peh, and N. K. Jha
ECE, University of Princeton
PowerHerd: A Distributed Scheme for Dynamically Satisfying Peak-Power
Constraints in Interconnection Networks
By
L. Shang, L.-S. Peh, and N. K. JhaDepartment of Electrical Engineering
Princeton University
6ECE692 2009
Introduction (1)
• Problem • Peak-power constrains
• Solution• PowerHerd
– Distributed and run-time– Modified router
•
9ECE692 2009
PoweHerd Router MechanismPLPB =PGPB/# Routers
Estimate PLPB Predict PLPB
Calculate Shared power
Negotiation with neighbors and share power
Update PLPB
Throttle switch
allocator
Update routing decision
10ECE692 2009
Dynamic Power Estimation
• Power dominators:– Input Buffer– Crossbar Switch– Link
Based on Switching activity,
Number,Coefficients from linear
regression
12ECE692 2009
Leakage Power Estimation
• Leakage Power is about 10%. (Critique)
Based on• Switching activity,• Number,• Coefficients from linear regression
17ECE692 2009
Power-aware Routing
• Previous routing algorithms– Performance– Fault-tolerance
• This routing algorithm considers power consumption of neighbors– Low overhead
23ECE692 2009
Summary
• PowerHerd– Distributed Scalable– Online (Dynamic) Efficient– Guarantee Peak-Power Constrain The Issue– Help other techniques
Dynamic Voltage Scaling with Links for Power Optimization of Interconnection
Networks
By
L. Shang, L.-S. Peh, and N. K. JhaDepartment of Electrical Engineering
Princeton University
25ECE692 2009
Introduction
• Power saving technique– Employs DVFS Links (the first attempt)
• How? Based on history of previous actions• Performance penalty– 2.5 throughput– 15.2 average latency
26ECE692 2009
DVFS Link
C= 5usn = .9
• Characteristics of a DVFS link– Transition time (100 link clock cycles)– Transition energy– Transition status– Transition step
27ECE692 2009
Communication Traffic Charc.
Link Utilization (LU)
Congestion
What is the Problem with this model?
30ECE692 2009
Prediction Policy
• LU & BU together is enough• DVFS based on two steps
• First Link Utilization• Second congestion
• Simple Implementation
35ECE692 2009
Summary
• Appling DVFS to Interconnection networks• History-based DVFS (LU, BU)• Power saving HUGH!• First study
36ECE692 2009
Critiques to PoweHerd
• Consider static power 10% now is much more!
• Gate-level design for traffic throttling is not realistic.
• Completely Distributed; suggestion hybrid!
37ECE692 2009
Critiques to DVFS Link
• There is no 100% guarantee to find the optimum for History-Based Policy
• This method works because the link is supposed to be power dominator! Inconsistent with first paper.
38ECE692 2009
Comparisons of the Two Papers
PowerHerd DVFS Link
Target Peak Power Constrain Power Consumption
Performance Penalty Yes Yes
Power Technique Power –aware routing, Dynamic power throttling
DVFS
Improvement 100% guarantee 6 times saving
Inconsistent Assumptions(most power dominator)
Input Buffers Links
Top Related