Internship - Final Presentation (26-08-2015)
- 1. C++ w/ OpenMP Task Graph Generator Sean Krail
- 2. Goal C++ w/ OpenMP -> Clangs AST + (Data Structure) (Data Structure) -> TGFF (Data Structure) -> DOT (Data Structure) -> DARTS
- 3. Goal C++ w/ OpenMP -> Clangs AST + (Data Structure) (Data Structure) -> TGFF (Data Structure) -> DOT (Data Structure) -> DARTS
- 4. (Data Structure) LinkedList of Tasks Task -> Task -> -> Task -> null 3 Types of Tasks CallTask, StmtGroupTask, ParallelTask
- 5. CallTask Function call Start of a parallel OpenMP directive Implicit barriers Function return
- 6. StmtGroupTask & ParallelTask StmtGroupTask Group of non-parallel, non-OpenMP Stmts ParallelTask Group of regular or OMP-directive parallel Stmts
- 7. C++ w/ OpenMP -> Clangs AST void f(int n) { int a = 1; int b = 2; # pragma omp parallel { int c = 3; int d = 4; # pragma omp for for(int i = 0; i < n; i++) { int e = 5; int f = 6; int g = 7; } // implicit barrier int h = 8; # pragma omp single { int i = 9; } // implicit barrier int j = 10; # pragma omp single { int k = 11; } } // combined implicit barrier int l = 12; }
- 8. Interface for traversing clangs AST RecursiveASTVisitor Class Hierarchy bool TheVisitor::TraverseDecl(clang::Decl *d) { if(!d) return true; else if(!isa<clang::FunctionDecl>(d)) return true; // create the function start CallTask clang::FunctionDecl *f = llvm::cast <clang::FunctionDecl>(d); this->task = new CallTask(f, true); // traverse children nodes RecursiveASTVisitor::TraverseDecl(d); // move to next sibling // or back go back to parent // create the function end CallTask Task *tmp = new CallTask(f, false); this->task->setChild(tmp); this->task = nullptr; // good practice return true; }
- 9. Clangs AST + (Data Structure)
- 10. Clangs AST + (Data Structure)
- 11. Clangs AST + (Data Structure)
- 12. Clangs AST + (Data Structure)
- 13. Clangs AST + (Data Structure)
- 14. Clangs AST + (Data Structure)
- 15. Clangs AST + (Data Structure)
- 16. Clangs AST + (Data Structure)
- 17. Clangs AST + (Data Structure)
- 18. Clangs AST + (Data Structure)
- 19. Clangs AST + (Data Structure)
- 20. Clangs AST + (Data Structure)
- 21. Clangs AST + (Data Structure)
- 22. Clangs AST + (Data Structure)
- 23. Clangs AST + (Data Structure)
- 24. Clangs AST + (Data Structure)
- 25. Clangs AST + (Data Structure)
- 26. Clangs AST + (Data Structure)
- 27. Clangs AST + (Data Structure)
- 28. Clangs AST + (Data Structure)
- 29. Clangs AST + (Data Structure)
- 30. Clangs AST + (Data Structure)
- 31. Clangs AST + (Data Structure)
- 32. Goal C++ w/ OpenMP -> Clangs AST + (Data Structure) (Data Structure) -> TGFF (Data Structure) -> DOT (Data Structure) -> DARTS
- 33. Goal C++ w/ OpenMP -> Clangs AST + (Data Structure) (Data Structure) -> TGFF (Data Structure) -> DOT (Data Structure) -> DARTS
- 34. (Data Structure) -> TGFF List of Tasks ParallelTask is broken down into N StmtGroupTasks (for N number of threads) List of Arcs Synonymous with dependencies
- 35. (Data Structure) -> DOT List of Tasks and Arcs like TGFF Allows for styling of the graph
- 36. (Data Structure) -> DARTS Modular 1. Derived Codelet classes for each unique Task 2. A Single ThreadedProcedure for the entire Task Graph 3. Definition of each derived codelet classs fire method 4. main entry function
- 37. Script to Execute Tool #!/bin/sh CLANGBUILD=~/Documents/clang-llvm/build OMP=~/Documents/omp-darts-compiler/ompdarts-sean/taskgraph/functions/hello.cpp DARTSDIR=~/CAPSL/DARTS APP=TaskGraphTP rm $DARTSDIR/apps/$APP/$APP.cpp # run tool # Options: # numthreads (default is 2) # tgff # dot # darts # Examples: # $BUILD/bin/ompdarts-taskgraph-generator $PROGRAM -numthreads=5 -tgff -dot -darts -- -Xclang -fopenmp # $BUILD/bin/ompdarts-taskgraph-generator $PROGRAM -- -Xclang -fopenmp $CLANGBUILD/bin/ompdarts-taskgraph-generator $OMP -numthreads=2 -darts -- -Xclang -fopenmp >> $DARTSDIR/apps/$APP/$APP.cpp TMP=$PWD cd $DARTSDIR/build make $DARTSDIR/build/apps/$APP/$APP cd $TMP
- 38. DARTS Example TaskGraphTP() Fired codelet start Fired codelet sg0 Fired codelet call0 Fired codelet sg1_t0 Fired codelet sg1_t1 Fired codelet for0_t0 Fired codelet for0_t1 Fired codelet barrier0 Fired codelet sg2_t0 Fired codelet sg2_t1 Fired codelet single0_t0 Skipped codelet single0_t1 Fired codelet barrier1 Fired codelet single1_t0 Skipped codelet single1_t1 Fired codelet barrier2 Fired codelet sg3 Fired codelet end Total Time Taken: 0.00969014 sec void f(int n) { int a = 1; int b = 2; # pragma omp parallel { int c = 3; int d = 4; # pragma omp for for(int i = 0; i < n; i++) { int e = 5; int f = 6; int g = 7; } // implicit barrier int h = 8; int i = 9; # pragma omp single { int j = 10; int k = 11; } // implicit barrier # pragma omp single { int l = 12; } } // combined implicit barrier of OMPSingle and OMPParallel int m = 13; }
- 39. Questions?