Eco-Computing
High communication needs: Multicast dominant ones (FFT,..) Medium communication needs: Point-to-point dominant ones (EF,..) Low communication needs: Master-slave ones (Data server,..)
Eco-Computing
O: W: Z: S:
Number of operations per node [Flops] Number of main memory accesses per node [Words] Number of messages to be sent per node Number of words sent by one node [Words]
Va=O/W: a = O/S:
Number of operations per memory access [Flops/Word] Number of operations per word sent [Flops/Word]
*suppose
Eco-Computing
R: M:
Peak performance of a node [Flops/s] Peak main memory bandwidth of a node [Words/s]
VM=R/M: Number of operations per memory access [Flops/Word] ra=min(R, M*Va): Peak performance of an application component [Flops/s] Total computation time [s] tc=O/ra:
Eco-Computing
Dominant cpu time operation for explicit time evolution code cpu time dominated by memory access 70% of all EPFL applications are of this type
VM [R /M] 7 7 19 3 7.5
Eco-Computing
3P
44y
Xeon /64 P4 PM
1low
voltage 2incl. screen, Microsoft, keyboard, battery, etc. 3electric consumption +cooling
Eco-Computing
First conclusions
Green is cheap
Eco-Computing
Eco-Computing
BlueGene
IBM 40960
BlueBrain@EPFL
0.6
Groningen 12288
0.4
Tokyo 8192 Lausanne 8192
0.2
NASA 10160
Barcelona 4800
JS20
Tokyo
Livermore 4096
Sandia 5000
0
RG, March 7, 2006
Itanium 5120 ES 1 2 3 4
Itanium 5 6 7 8 9
Opteron
Eco-Computing
10
Gflops/Watt
0.04
P: C: L: <d>:
Number of nodes in a machine Total network bandwidth of a machine [Words/s] Latency of the network [s] Average distance
VC=P R/ C: Number of operations per sent word [Flops/Word] b=C/(P*<d>): Inter-node communication bandwidth per node [Words/s] Time needed to send S words through the network [s] tb=S/b: tL=LZ: Latency time [s] Total turn around time of an application component* T=tc+ tb+ tL: M=ra/b (1+LZ/S): Number of operations per word sent [Flops/Word] B=4 L C /P: Message size taking L
*for
simplicity: I/O is not considered and communication cannot be hidden behind computation
RG, March 7, 2006 Eco-Computing 11
Cluster NoW Pleiades1 Pleiades2 Mizar BlueGene Horizon SX-5 Regatta Cluster NoW Pleiades1 Pleiades2 Mizar BlueGene Horizon SX-5 Regatta P
Site LIN-EPFL STI-EPFL STI-EPFL DIT-EPFL DIT-EPFL CSCS CSCS CSCS R [GF/s] 10 132 120 160 4096 1100 16 256 6 5.6 5.6 9.6 5.6 5.2 8 5
Vendor Logics Logics DELL Dalco IBM Cray NEC IBM P R [GF/s] 60 739 672 1536 22937 5720 128 1300
node Pentium 4 Pentium 4 Xeon 64 Opteron Power 4 Opteron vector Power 4 M [GW/s] 0.8 0.8 0.8 1.6 0.7 0.8 8 0.4
procs/node 1 1 1 2 2 1 1 1 VM [F/W] 7.5 7 7 6 8 6.5 1 12 C [GW/s] 0.0032 0.4 3.75 10 1065 1760 128 16
network 1 FE Bus FE switch GbE switch Myrinet Torus Torus SMP Colony VC [F/W] 19200 1792 179 154 22 3.3 80
network 2 Fat Tree L [s] 60 60 60 10 2.5 6.8 10* B [] 750 750 7500 2500 4800 52000 640* 12
Eco-Computing
>1
RG, March 7, 2006 Eco-Computing 13
model
>1
= a / M Task/application: Machine (if LZ/S<<1): a = O / S [flops/64bit word] M = ra / b [flops/64bit word]
Speedup Efficiency
LAUTREC: Car-Parrinello molecular dynamic (M. Stengel) Swiss-T1 + Tnet: -model: m = 100, a = 330, =3.3 Measured: =3.6 -> 25% of overall time is due to communication 75% is due to computation
Latency does not play a role
Swiss-T1 + Fast Ethernet: -model: m = 1333, a = 330, =0.25 Measured: =0.25 -> 20% of overall time is due to computation 80% is due to communication
RG, March 7, 2006 Eco-Computing 15
Speedup
Cray XT3 Cray XT3
1.6
1.5
1.4 Speedup
1.3
1.2
1.1
0.9
0.8 1
P measured
model
Eco-Computing
16
Capability: expensive? all machines SX-8 (1), Itanium2 (4), Horizon (8) SX-8 (4 procs) no machine
Eco-Computing
17
<1 E<50%
I/O or MPI ?
CFD
=1
Plasma physics =7
Eco-Computing
19
Goal
Submit an application to the most suited computer architecture
Database: All data on machines and applications delivered by Ganglia and and metascheduler
Cost function: Includes all strategic components on machine status and application behaviour to decide where to submit Job submission: Through Unicore/metascheduler
ISS
I
Switch
S S
SwissGrid initiative
RG, March 7, 2006 Eco-Computing 22
Eco-Computing
23
Conclusions Green is cheap fm-computing can reduce energy consumption Grid should include different types of parallel machines Optimal Grid scheduling possible thanks to ISS ISS enables application adapted Grids that have . economical advantages . ecological advantages Capability/capacity->parameterization Top500 list: R , VM , VC
Eco-Computing
24