1. D YNAMIC T HREAD A SSIGNMENT ON H ETEROGENEOUS M ULTIPROCESSOR A RCHITECTURE Hüsnü Şensoy

2. A GENDA Problem Definition Benchmarking Over EV 5 & EV 6 Architectures Assignment Policies Simulation Results Questions & Comments

3. P ROBLEM D EFINITION Dynamic Thread Assignment on Heterogeneous Multiprocessor Architecture

4. P ROBLEM D EFINITION (S TATIC & H OMOGENOUS ) P1 P2 P3 P4 T1 T2 T3 T4 T5 T6 Which thread should be scheduled over which processor ?

5. P ROBLEM D EFINITION (S TATIC & H ETEROGENOUS ) P1 P3 P2 P4 T1 T2 T3 T4 T5 T6 Which thread should be scheduled over which processor ?

6. P ROBLEM D EFINITION (D YNAMIC & H ETEROGENOUS ) P1 P3 P2 P4 T1 T2 T3 T4 T5 T6 Which thread should be scheduled over which processors ?

7. P ROBLEMS How to decide which thread should be scheduled on which processor in an heterogeneous processor environment ? Are heterogeneous architectures better than homogenous ones ? Is dynamic allocation better than static one ?

8. A N E ASY P ROBLEM P1 P2 A A B B

9. B ENCHMARKING O VER EV 5 & EV 6 A RCHITECTURES Dynamic Thread Assignment on Heterogeneous Multiprocessor Architecture

10. B UILDING B LOCKS

11. W ORKLOAD D EFINITION ProgramDescription gzipData compression utility gccC compiler craftyChess program parserNatural language processing bzip2Data compression utility wupwisQuantum chromodynamics swimShallow water modeling mgridMulti-grid solver in 3D potential field galgelFluid dynamics analysis of oscillatory instability equakeFinite element simulation: earthquake modeling lucasNumber theory: primality testing

12. P ERFORMANCE O F E V 5 VS E V 6

13. R ATIO B ETWEEN A VERAGE IPC

14. P OSSIBLE A RCHITECTURES EV5 EV6 EV5 EV6 EV5 EV6 EV5

15. A SSIGNMENT P OLICIES Dynamic Thread Assignment on Heterogeneous Multiprocessor Architecture

16. R ANDOM S TATIC A SSIGNMENT P1 P3 P2 P4 P5 P6 P7 P8 T1 T2 T3 T4 T5 T6 T8 T7 Always utilize EV 6 processors first. Keep them utilized.

17. P SEUDO B EST S TATIC A SSIGNMENT P1 P3 P2 P4 P5 P6 P7 P8 gzip 2 2 gcc 2,5 bzip2 1,5 parser 2,8 crafty 4 4 mgrid 2,7 galgel 2,5 lucas 1,7

18. R OUND R OBIN D YNAMIC A SSIGNMENT P1 P3 P2 P4 P5 P6 P7 P8 T1 T2 T3 T4 T5 T6 T8T8 T8T8 T7T7 T7T7

19. IPC D RIVEN D YNAMIC A SSIGNMENT P1 P3 P2 P4 P5 P6 P7 P8 gzip 2 2 gcc 2,5 bzip2 1,5 parser 2,8 crafty 4 4 mgrid 2,7 galgel 2,5 lucas 1,7 SWAP 1 SWAP 2

20. C OST T HREAD M IGRATION

21. S IMULATION R ESULTS Dynamic Thread Assignment on Heterogeneous Multiprocessor Architecture

22. S IMULATION R ESULTS (S TATIC S CHEDULING ) Static Random Assignment Random vs Pseudo Optimal Assignment

23. S IMULATION R ESULTS (R OUND R OBIN D YNAMIC A SSIGNMENT )

24. S IMULATION R ESULTS (IPC D RIVEN D YNAMIC A SSIGNMENT )

25. C OMPONENTS O F S PEED - UP (IPC D RIVEN D YNAMIC A SSIGNMENT )

26. C OMPONENTS O F S PEED - UP (R OUND R OBIN D YNAMIC A SSIGNMENT )

27. C ONCLUSION Heterogeneous multiprocessor systems allows to Efficiently accommodate different degrees of thread parallelism Meet the needs of multi-programmed computing environments. The presence of many low area cores ensures a high level of parallelism. The presence of a few high performance cores guarantees high throughput when thread parallelism is low. In this work it is also argued that the benefits of heterogeneous CMP are increased by the use of dynamic policies for assigning threads to processors. This allows to capture the dynamic behavior of the running threads. maximize the usage of the high performance cores. According to the results of the work, a dynamic policy on a heterogeneous CMP can outperform a random assignment policy by 20% to 40%. a homogeneous configuration by 20% to 80% depending on the number of threads simulated.

28. Q UESTIONS & C OMMENTS Dynamic Thread Assignment on Heterogeneous Multiprocessor Architecture ?