The HPC Challenge Benchmark The HPC Challenge Benchmark - - PDF document

▶
the hpc challenge benchmark the hpc challenge benchmark
SMART_READER_LITE
LIVE PREVIEW

The HPC Challenge Benchmark The HPC Challenge Benchmark - - PDF document

Oct 07, 2022 19 likes •119 views

The HPC Challenge Benchmark The HPC Challenge Benchmark http://icl.cs.utk.edu/hpcc/ Jack Dongarra Innovative Computing Laboratory University of Tennessee and Computer Science and Mathematics Division Oak Ridge National Laboratory 1 Phases

slide-1
SLIDE 1

1

The HPC Challenge Benchmark The HPC Challenge Benchmark

Jack Dongarra

Innovative Computing Laboratory University of Tennessee and Computer Science and Mathematics Division Oak Ridge National Laboratory http://icl.cs.utk.edu/hpcc/

slide-2
SLIDE 2

2

Phases I Phases I -

  • III

III

02 05 06 07 08 09 10 03 04 Products Metrics, Benchmarks Academia Research Platforms Early Software Tools Early Pilot Platforms

Phase II R&D

3 companies ~$50M each

Phase III Full Scale Development

commercially ready in the 2007 to 2010 timeframe. $100M ? Metrics and Benchmarks System Design Review

Industry Application Analysis Performance Assessment HPCS Capability or Products

Fiscal Year Concept Reviews PDR Research Prototypes & Pilot Systems Phase III Readiness Review Technology Assessments Requirements and Metrics Phase II Readiness Reviews

Phase I Industry Concept Study

5 companies $10M each Reviews Industry Procurements Critical Program Milestones DDR

Productivity Team

Industry: Mission partners: Productivity team (Lincoln Lab lead)

MIT Lincoln Lab LCSOhio State PI: Koester PIs: Vetter, Lusk, Post, Bailey PIs: Gilbert, Edelman, Ahalt, Mitchell PI: Kepner PI: Lucas PI: Basili PIs: Benson, Snavely PI: Dongarra

slide-3
SLIDE 3

3

Motivation for Additional Benchmarks Motivation for Additional Benchmarks

♦ From Linpack Benchmark and Top500:

“no single number can reflect overall performance”

♦ Without HPL Linpack only peak will be

reported

♦ Clearly need something more than Linpack ♦ HPC Challenge Benchmark

Goals HPC Challenge Benchmark Goals HPC Challenge Benchmark

♦Stress CPU, memory system,

interconnect

♦Allow for optimizations

Record effort needed for tuning

♦Provide verification of results ♦Archive results ♦Requires: MPI and BLAS

slide-4
SLIDE 4

4

HPC Challenge Benchmark HPC Challenge Benchmark Initial Release 11/03 Initial Release 11/03

Consists of basically 5 benchmarks;

  • Think of it as a framework or harness for adding benchmarks of interest.

1.

HPL (LINPACK) ― MPI on whole system (Ax = b)

2.

STREAM ― single CPU *STREAM ― embarrassingly parallel whole system

3.

PTRANS (A A + BT) ― MPI on whole system

4.

RandomAccess ― single CPU *RandomAccess ― embarrassingly parallel RandomAccess ― MPI on whole system

5.

BW and Latency – MPI Coming soon: FFT and Matrix Multiply

proci prock

Random integer read; update; & write

Applications Applications

Temporal locality Spatial locality Computational Fluid Dynamics Digital Signal Processing Traveling Sales Person Radar Cross Section high low low

Memory Access Patterns

slide-5
SLIDE 5

5

Temporal locality Spatial locality Digital Signal Processing STREAM / PTRANS HPL Linpack FFT (coming soon) RandomAccess Radar Cross Section high low low

Memory Access Patterns

Applications Applications

Signatures Signatures

Computational Fluid Dynamics Traveling Sales Person low

How Will The Benchmarking Work? How Will The Benchmarking Work?

♦ Single program to download and run Simple input file similar to HPL input ♦ Base Run and Optimization Run Base run must be made

User supplies MPI and the BLAS

Optimized run allowed to replace certain routines

User specifies what was done

♦ Results upload via website ♦ html table and Excel spreadsheet

generated with performance results

Intentionally we are not providing a single figure of merit (no over all ranking) ♦ Goal: no more than 2 X the time to

execute HPL.

slide-6
SLIDE 6

6

http://icl.cs.utk.edu/hpcc/ http://icl.cs.utk.edu/hpcc/

Coming soon FFT and Matrix Multiply

Go to Go to… …

♦ http://icl.cs.utk.edu/hpcc/

slide-7
SLIDE 7

7

Example of Output Example of Output

http://icl.cs.utk.edu/hpcc/

slide-8
SLIDE 8

8

slide-9
SLIDE 9

9

http:// http://icl.cs.utk.edu/hpcc icl.cs.utk.edu/hpcc/ / Expanded Set of Benchmarks Expanded Set of Benchmarks

♦ Constructing a framework for

benchmarks

♦ Developing machine signatures ♦ Plans are to expand the benchmark

collection

♦ Currently working on

DGEMM and *DGEMM FFT (1d Complex)

slide-10
SLIDE 10

10

Future Directions Future Directions

♦Port to new systems ♦Provide more implementations

Languages (Fortran, UPC, Co-Array) Environments Paradigms

♦Other basic operations

Sparse matrix I/O

Collaborators Collaborators

♦Piotr Łuszczek, U of Tennessee ♦David Bailey, NERSC/LBL ♦Jeremy Kepner, MIT Lincoln Lab ♦David Koester, MITRE ♦Bob Lucas, ISI/USC ♦John McCalpin, IBM, Austin ♦Rolf Rabenseifner, HLRS Stuttgart

http://icl.cs.utk.edu/hpcc/