Automatic Code Orchestration from Descriptive Implementations

Størrelse: px

Starte visningen fra side:

Download "Automatic Code Orchestration from Descriptive Implementations"

Karl Christen Villadsen
10 år siden
Visninger:

1 ft her Automatic Code Orchestration from Descriptive Implementations older Professor Brian Vinter Niels Bohr Institute KU

2 ft her Automatic Code Orchestration from Descriptive Implementations Prototypin for Exascale older Professor Brian Vinter Niels Bohr Institute KU

3 Domain of interest tillin ru yknin tillin, Users are scientists not prorammers Written and maintained by a small roup of people Chanes often We don t think of Lare community codes Codes where the prorammer is not the scientist Code that will run millions of times

Chanes often We don t think of Lare community codes Codes where

4 Prototypin today tillin ru yknin tillin, Idea Days Prototype Months Full version

5 Prototypin today tillin ru yknin tillin, Idea Paper Days Prototype Matlab Months Full version C++

6 Prototypin today tillin ru yknin tillin, Idea Paper Days Prototype Matlab Months Full version C++ Prototypin: TFlops Taret: PFlops

7 Prototypin tomorrow tillin ru yknin tillin, Now Tflops => Pflops 2020 Tflops => Pflops => Eflops or Pflops => Eflops

8 Observations tillin ru yknin tillin, Prototypin is a fundamental requirement Prototypin works on small datasets 1,000 x smaller typically 1,000,000 is less realistic We need a new approach for prototypin for Exascale

datasets 1,000 x smaller typically 1,000,000 is less

9 Requirements for Exascale Prototypin tillin ru yknin tillin, Prototype must be hih productivity Like Matlab Must run on Petascale machines Must have a speed in the same order as a naïve C++ implementation

Like Matlab Must run on Petascale machines Must

10 Bohrium tillin ru yknin tillin, Build around a flexible n-dimentional tensor data-structure Desined to support all NumPy operations Supported lanuaes (for now): Python/Numpy C/C++.Net (C#, F#, ) Supported hardware: Multicores GPGPUs Clusters/MPP (FPGAs)

NumPy operations Supported lanuaes (for now): Python/Numpy

11 Implementation tillin ru yknin tillin, Bohrium is a Just-In-Time compiler Batches all nd-array operations until a flush is required Then analyzes the batched operations and compiles taretspecific code If it does not already exist

until a flush is required Then analyzes the batched

12 Prorammin Approach tillin ru yknin tillin,

13 C++/OMP tillin ru yknin tillin,

14 Optimized C tillin ru yknin tillin,

15 C/OMP/MPI tillin ru yknin tillin,

16 OpenCL tillin ru yknin tillin,

17 Multicore tillin ru yknin tillin,

18 Multicore C and C++ tillin ru yknin tillin,

19 GPU tillin ru yknin tillin,

20 Cluster tillin ru yknin tillin,

21 Black-Scholes tillin ru yknin tillin,

22 Multicore tillin ru yknin tillin, Speedup 32.9 Scalability: 25.5

23 GPU tillin ru yknin tillin,

24 Cluster tillin ru yknin tillin,

25 NICE tillin ru yknin tillin,

26 Multicore tillin ru yknin tillin, Speedup 15,5 Scalability: 16,4

27 GPU tillin ru yknin tillin,

28 Cluster tillin ru yknin tillin,

29 Shallow Water tillin ru yknin tillin,

30 Multicore tillin ru yknin tillin, Speedup 47.8 Scalability: 14.1

31 GPU tillin ru yknin tillin,

32 Cluster tillin ru yknin tillin,

33 Conclusions tillin ru yknin tillin, We believe that we need a new tool for prototypin in the Exascale ae Bohrium is one possible solution to that challene Usin hihly descriptive code we can extract parallelism and memory access patterns from the user code Performance is actually very close to that of naïve C++

34 tillin ru yknin tillin,

Relaterede dokumenter

PARALLELIZATION OF ATTILA SIMULATOR WITH OPENMP MIGUEL ÁNGEL MARTÍNEZ DEL AMOR MINIPROJECT OF TDT24 NTNU

PARALLELIZATION OF ATTILA SIMULATOR WITH OPENMP MIGUEL ÁNGEL MARTÍNEZ DEL AMOR MINIPROJECT OF TDT24 NTNU OUTLINE INEFFICIENCY OF ATTILA WAYS TO PARALLELIZE LOW COMPATIBILITY IN THE COMPILATION A SOLUTION