Presentation is loading. Please wait.

Presentation is loading. Please wait.

N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER Comparing Cray Tasking and OpenMP NERSC User Services Overview of Cray Tasking Overview of OpenMP.

Published byArnold Simpson Modified over 8 years ago

Similar presentations

Presentation on theme: "N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER Comparing Cray Tasking and OpenMP NERSC User Services Overview of Cray Tasking Overview of OpenMP."— Presentation transcript:

1 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER Comparing Cray Tasking and OpenMP NERSC User Services Overview of Cray Tasking Overview of OpenMP Directives Comparison Mixing OpenMP with MPI

2 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 2 Cray Shared-Memory Multiprocessors 1982: X-MP –1, 2, or 4 processors 1985: Cray-2 –4 processors 1988: Y-MP –8 processors “Cray for the 90s”: C90 –16 processors

3 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 3 Cray Tasking Microtasking –Parallel loops Macrotasking –Parallel regions Autotasking –Emphasis on “auto”

4 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 4 History of OpenMP Defined by OpenMP Architecture Review Board –Compaq/DEC, HP, IBM, Intel, SGI/Cray, Sun, etc. Endorsed by software and application vendors –Absoft, The Portland Group, etc. –ANSYS, Fluent, Livermore Software, NAG, etc. Fortran, C, and C++ bindings –Fortran specification released late 1997 –C and C++ specification released late 1998 See http://www.openmp.org for complete details

5 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 5 Scope of OpenMP Shared-memory explicit parallelism –No automatic parallelism –Some research into extending to distributed-memory environments Directives, environment variables, runtime library routines

6 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 6 Cray Tasking Syntax sentinel directive [argument …] [, directive …] sentinel –cdir$ or !dir$ ( cmic$ and !mic$ are obsolete) Fixed format source –“normal” Fortran column rules Free format source –sentinel begins anywhere on a line, but must be the first text –sentinel followed by anything other than space implies continuation Multiple directives are comma-delimited –if a directive has required arguments, no other directives allowed

7 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 7 OpenMP Syntax prefix directive [clause[[,] clause]…] Fixed format source –prefix: !$OMP, C$OMP, or *$OMP –“normal” Fortran source rules Free format source –prefix: !$OMP –sentinel begins anywhere on a line, but must be the first text –“normal” Fortran source rules

8 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 8 Directive Correspondence Autotasking DOALL GUARD ENDGUARD PARALLEL ENDPARALLEL DOPARALLEL ENDDO CASE ENDCASE OpenMP PARALLEL DO CRITICAL END CRITICAL PARALLEL END PARALLEL DO END DO SECTIONS END SECTIONS

9 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 9 Simple Parallel Loop !MIC$ DOALL PRIVATE(I) SHARED(X,Y,Z) !$OMP PARALLEL DO DO I = 1, N Z(I)=LOG(SIN(X(I))**2+COS(Y(I))**4) END DO !$OMP END PARALLEL DO

10 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 10 Directive Correspondence Autotasking DOALL GUARD ENDGUARD PARALLEL ENDPARALLEL DOPARALLEL ENDDO CASE ENDCASE OpenMP PARALLEL DO CRITICAL END CRITICAL PARALLEL END PARALLEL DO END DO SECTIONS END SECTIONS

11 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 11 Parallel Loop With Critical Section !MIC$ DOALL PRIVATE(I) SHARED(X,Y,Z,T) !$OMP PARALLEL DO DO I = 1, N Z(I) = LOG(SIN(X(I))**2 + COS(Y(I))**4) !MIC$ GUARD !$OMP CRITICAL T = T + Z(I) !MIC$ ENDGUARD !$OMP ENDCRITICAL END DO !$OMP END PARALLEL DO

12 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 12 Directive Correspondence Autotasking DOALL GUARD ENDGUARD PARALLEL ENDPARALLEL DOPARALLEL ENDDO CASE ENDCASE OpenMP PARALLEL DO CRITICAL END CRITICAL PARALLEL END PARALLEL DO END DO SECTIONS END SECTIONS

13 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 13 Parallel Regions !MIC$ PARALLEL PRIVATE(X) SHARED(Y) !$OMP PARALLEL PRIVATE(X) !$OMP DO X = 3.0 !MIC$ GUARD !$OMP CRITICAL Y = Y + 1.0 !MIC$ ENDGUARD !$OMP ENDCRITICAL !MIC$ ENDPARALLEL !$OMP END DO !$OMP END PARALLEL

14 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 14 Directive Correspondence Autotasking DOALL GUARD ENDGUARD PARALLEL ENDPARALLEL DOPARALLEL ENDDO CASE ENDCASE OpenMP PARALLEL DO CRITICAL END CRITICAL PARALLEL END PARALLEL DO END DO SECTIONS END SECTIONS

15 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 15 Generalized Parallel Loop SUM = 0.0 !MIC$ PARALLEL PRIVATE(XSUM,I) SHARED(SUM,A,N) XSUM = 0.0 !MIC$ DOPARALLEL DO I = 1, N XSUM = XSUM + A(I) ENDDO !MIC$ GUARD SUM = SUM + XSUM !MIC$ ENDGUARD !MIC$ ENDDO !MIC$ ENDPARALLEL

16 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 16 Generalized Parallel Loop (cont.) SUM = 0.0 !$OMP PARALLEL PRIVATE(XSUM) XSUM = 0.0 !$OMP DO DO I = 1, N XSUM = XSUM + A(I) ENDDO !$OMP CRITICAL SUM = SUM + XSUM !$OMP END CRITICAL !$OMP END DO !$OMP END PARALLEL

17 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 17 Directive Correspondence Autotasking DOALL GUARD ENDGUARD PARALLEL ENDPARALLEL DOPARALLEL ENDDO CASE ENDCASE OpenMP PARALLEL DO CRITICAL END CRITICAL PARALLEL END PARALLEL DO END DO SECTIONS END SECTIONS

18 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 18 Parallel Blocks !MIC$ PARALLEL !$OMP PARALLEL !MIC$ CASE !$OMP SECTIONS !$OMP SECTION CALL SUBA !MIC$ CASE !$OMP SECTION CALL SUBB !MIC$ ENDCASE !$OMP END SECTIONS !MIC$ ENDPARALLEL !$OMP END SECTIONS

19 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 19 Mixing OpenMP and MPI INCLUDE ’mpi.h' CALL MPI_INIT(IERR) CALL MPI_COMM_RANK(MPI_COMM_WORLD,MYID,IERR) CALL MPI_COMM_SIZE(MPI_COMM_WORLD,NP,IERR) PRINT *,'PROCESS ',MYID,' OF ',NP,' IS ALIVE' !$OMP PARALLEL PRIVATE(NTHREADS, TID) TID = OMP_GET_THREAD_NUM() PRINT *,'HI;THREAD=',TID,' PROCESS=',MYID IF (TID.EQ. 0) THEN NTHREADS = OMP_GET_NUM_THREADS() PRINT *,'NTHREADS=',NTHREADS,’MYID=',MYID END IF !$OMP END PARALLEL CALL MPI_FINALIZE(IERR) END

20 N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER June, 2000Cray Tasking vs. OpenMP - User Services Group 20 Mixing OpenMP and MPI (cont.) % mpxlf_r smp.f -qsmp ** hi === End of Compilation 1 === 1501-510 Compilation successful for file smp.f. % setenv XLSMPOPTS "parthds=2" %./a.out -nodes 2 Process 1 of 2 is alive Process 0 of 2 is alive HI;THREAD=0 PROCESS=0 NTHREADS=2 MYID=0 HI;THREAD=1 PROCESS=0 HI;THREAD=0 PROCESS=1 NTHREADS=2 MYID=1 HI;THREAD=1 PROCESS=1

Download ppt "N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER Comparing Cray Tasking and OpenMP NERSC User Services Overview of Cray Tasking Overview of OpenMP."

Similar presentations

N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER TotalView on the T3E and IBM SP Systems NERSC User Services June 12, 2000.

N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER TotalView on the T3E and IBM SP Systems NERSC User Services June 12, 2000.
NPACI Parallel Computing Institute August 19-23, 2002 San Diego Supercomputing Center S an D IEGO S UPERCOMPUTER C ENTER N ATIONAL P ARTNERSHIP FOR A DVANCED.

NPACI Parallel Computing Institute August 19-23, 2002 San Diego Supercomputing Center S an D IEGO S UPERCOMPUTER C ENTER N ATIONAL P ARTNERSHIP FOR A DVANCED.
Parallel Processing with OpenMP

Parallel Processing with OpenMP
Introduction to Openmp & openACC

Introduction to Openmp & openACC
N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER 1 Mixed Language Programming on Seaborg Mark Durst NERSC User Services.

N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER 1 Mixed Language Programming on Seaborg Mark Durst NERSC User Services.
Introductions to Parallel Programming Using OpenMP

Introductions to Parallel Programming Using OpenMP
S an D IEGO S UPERCOMPUTER C ENTER N ATIONAL P ARTNERSHIP FOR A DVANCED C OMPUTATIONAL I NFRASTRUCTURE NPACI Parallel Computing Seminars San Diego Supercomputing.

S an D IEGO S UPERCOMPUTER C ENTER N ATIONAL P ARTNERSHIP FOR A DVANCED C OMPUTATIONAL I NFRASTRUCTURE NPACI Parallel Computing Seminars San Diego Supercomputing.
NewsFlash!! Earth Simulator no longer #1. In slightly less earthshaking news… Homework #1 due date postponed to 10/11.

NewsFlash!! Earth Simulator no longer #1. In slightly less earthshaking news… Homework #1 due date postponed to 10/11.
1 Programming Explicit Thread-level Parallelism  As noted previously, the programmer must specify how to parallelize  But, want path of least effort.

1 Programming Explicit Thread-level Parallelism  As noted previously, the programmer must specify how to parallelize  But, want path of least effort.
Parallel Programming On the IUCAA Clusters Sunu Engineer.

Parallel Programming On the IUCAA Clusters Sunu Engineer.
PARALLEL PROGRAMMING WITH OPENMP Ing. Andrea Marongiu

PARALLEL PROGRAMMING WITH OPENMP Ing. Andrea Marongiu
Scientific Programming OpenM ulti- P rocessing M essage P assing I nterface.

Scientific Programming OpenM ulti- P rocessing M essage P assing I nterface.
DISTRIBUTED AND HIGH-PERFORMANCE COMPUTING CHAPTER 7: SHARED MEMORY PARALLEL PROGRAMMING.

DISTRIBUTED AND HIGH-PERFORMANCE COMPUTING CHAPTER 7: SHARED MEMORY PARALLEL PROGRAMMING.
Computer Architecture II 1 Computer architecture II Programming: POSIX Threads OpenMP.

Computer Architecture II 1 Computer architecture II Programming: POSIX Threads OpenMP.
Parallel Programming by Tiago Sommer Damasceno Using OpenMP

Parallel Programming by Tiago Sommer Damasceno Using OpenMP
Introduction to OpenMP For a more detailed tutorial see: Look at the presentations.

Introduction to OpenMP For a more detailed tutorial see: Look at the presentations.
1 ITCS4145/5145, Parallel Programming B. Wilkinson Feb 21, 2012 Programming with Shared Memory Introduction to OpenMP.

1 ITCS4145/5145, Parallel Programming B. Wilkinson Feb 21, 2012 Programming with Shared Memory Introduction to OpenMP.
CSCI-6964: High Performance Parallel & Distributed Computing (HPDC) AE 216, Mon/Thurs 2-3:20 p.m. Pthreads (reading Chp 7.10) Prof. Chris Carothers Computer.

CSCI-6964: High Performance Parallel & Distributed Computing (HPDC) AE 216, Mon/Thurs 2-3:20 p.m. Pthreads (reading Chp 7.10) Prof. Chris Carothers Computer.
OpenMPI Majdi Baddourah https://computing.llnl.gov/tutorials/mpi/

OpenMPI Majdi Baddourah
N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER 1 Comparison of Communication and I/O of the Cray T3E and IBM SP Jonathan Carter NERSC User.

N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER 1 Comparison of Communication and I/O of the Cray T3E and IBM SP Jonathan Carter NERSC User.

Similar presentations

Ads by Google