Compare commits
2 commits
0b93cbcdd3
...
2195a9db0a
| Author | SHA1 | Date | |
|---|---|---|---|
|
2195a9db0a | ||
|
|
56614805cf |
63 changed files with 17534 additions and 0 deletions
152
sheet3/1/HISTORY.txt
Normal file
152
sheet3/1/HISTORY.txt
Normal file
|
|
@ -0,0 +1,152 @@
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Thu, Jan 17, 2013 3:50:01 PM
|
||||||
|
|
||||||
|
Version 5.10 of stream.c has been released.
|
||||||
|
This version includes improved validation code and will automatically
|
||||||
|
use 64-bit array indices on 64-bit systems to allow very large arrays.
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Thu Feb 19 08:16:57 CST 2009
|
||||||
|
|
||||||
|
Note that the codes in the "Versions" subdirectory should be
|
||||||
|
considered obsolete -- the versions of stream.c and stream.f
|
||||||
|
in this main directory include the OpenMP directives and structure
|
||||||
|
for creating "TUNED" versions.
|
||||||
|
|
||||||
|
Only the MPI version in the "Versions" subdirectory should be
|
||||||
|
of any interest, and I have not recently checked that version for
|
||||||
|
errors or compliance with the current versions of stream.c and
|
||||||
|
stream.f.
|
||||||
|
|
||||||
|
I added a simple Makefile to this directory. It works under Cygwin
|
||||||
|
on my Windows XP box (using gcc and g77).
|
||||||
|
|
||||||
|
A user suggested a sneaky trick for "mysecond.c" -- instead of using
|
||||||
|
the #ifdef UNDERSCORE to generate the function name that the Fortran
|
||||||
|
compiler expects, the new version simply defines both "mysecond()"
|
||||||
|
and "mysecond_()", so it should automagically link with most Fortran
|
||||||
|
compilers.
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Wed Nov 17 09:15:37 CST 2004
|
||||||
|
|
||||||
|
The most recent "official" versions have been renamed "stream.f" and
|
||||||
|
"stream.c" -- all other versions have been moved to the "Versions"
|
||||||
|
subdirectory.
|
||||||
|
|
||||||
|
The "official" timer (was "second_wall.c") has been renamed "mysecond.c".
|
||||||
|
This is embedded in the C version ("stream.c"), but still needs to be
|
||||||
|
externally linked to the FORTRAN version ("stream.f").
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Tue May 27 11:51:23 CDT 2003
|
||||||
|
|
||||||
|
Copyright and License info added to stream_d.f, stream_mpi.f, and
|
||||||
|
stream_tuned.f
|
||||||
|
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Tue Apr 8 10:26:48 CDT 2003
|
||||||
|
|
||||||
|
I changed the name of the timer interface from "second" to "mysecond"
|
||||||
|
and removed the dummy argument in all versions of the source code (but
|
||||||
|
not the "Contrib" versions).
|
||||||
|
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Mon Feb 25 06:48:14 CST 2002
|
||||||
|
|
||||||
|
Added an OpenMP version of stream_d.c, called stream_d_omp.c. This is
|
||||||
|
still not up to date with the Fortran version, which includes error
|
||||||
|
checking and advanced data flow to prevent overoptimization, but it is
|
||||||
|
a good start....
|
||||||
|
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Tue Jun 4 16:31:31 EDT 1996
|
||||||
|
|
||||||
|
I have fixed an "off-by-one" error in the RMS time calculation in
|
||||||
|
stream_d.f. This was already corrected in stream_d.c. No results are
|
||||||
|
invalidated, since I use minimum time instead of RMS time anyway....
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Fri Dec 8 14:49:56 EST 1995
|
||||||
|
|
||||||
|
I have renamed the timer routines to:
|
||||||
|
second_cpu.c
|
||||||
|
second_wall.c
|
||||||
|
second_cpu.f
|
||||||
|
|
||||||
|
All have a function interface named 'second' which returns a double
|
||||||
|
precision floating point number. It should be possible to link
|
||||||
|
second_wall.c with stream_d.f without too much trouble, though the
|
||||||
|
details will depend on your environment.
|
||||||
|
|
||||||
|
If anyone builds versions of these timers for machines running the
|
||||||
|
Macintosh O/S or DOS/Windows, I would appreciate getting a copy.
|
||||||
|
|
||||||
|
To clarify:
|
||||||
|
* For single-user machines, the wallclock timer is preferred.
|
||||||
|
* For parallel machines, the wallclock timer is required.
|
||||||
|
* For time-shared systems, the cpu timer is more reliable,
|
||||||
|
though less accurate.
|
||||||
|
|
||||||
|
|
||||||
|
-------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Revisions as of Wed Oct 25 09:40:32 EDT 1995
|
||||||
|
|
||||||
|
(1) NOTICE to C users:
|
||||||
|
|
||||||
|
stream_d.c has been updated to version 4.0 (beta), and
|
||||||
|
should be functionally identical to stream_d.f
|
||||||
|
|
||||||
|
Two timers are provided --- second_cpu.c and second_wall.c
|
||||||
|
second_cpu.c measures cpu time, while second_wall.c measures
|
||||||
|
elapsed (real) time.
|
||||||
|
|
||||||
|
For single-user machines, the wallclock timer is preferred.
|
||||||
|
For parallel machines, the wallclock timer is required.
|
||||||
|
For time-shared systems, the cpu timer is more reliable,
|
||||||
|
though less accurate.
|
||||||
|
|
||||||
|
(2) cstream.c has been removed -- use stream_d.c
|
||||||
|
|
||||||
|
(3) stream_wall.f has been removed --- to do parallel aggregate
|
||||||
|
bandwidth runs, comment out the definition of FUNCTION SECOND
|
||||||
|
in stream_d.f and compile/link with second_wall.c
|
||||||
|
|
||||||
|
(4) stream_offset has been deprecated. It is still here
|
||||||
|
and usable, but stream_d.f is the "standard" version.
|
||||||
|
There are easy hooks in stream_d.f to change the
|
||||||
|
array offsets if you want to.
|
||||||
|
|
||||||
|
(5) The rules of the game are clarified as follows:
|
||||||
|
|
||||||
|
The reference case uses array sizes of 2,000,000 elements
|
||||||
|
and no additional offsets. I would like to see results
|
||||||
|
for this case.
|
||||||
|
|
||||||
|
But, you are free to use any array size and any offset
|
||||||
|
you want, provided that the arrays are each bigger than
|
||||||
|
the last-level of cache. The output will show me what
|
||||||
|
parameters you chose.
|
||||||
|
|
||||||
|
I expect that I will report just the best number, but
|
||||||
|
if there is a serious discrepancy between the reference
|
||||||
|
case and the "best" case, I reserve the right to report
|
||||||
|
both.
|
||||||
|
|
||||||
|
Of course, I also reserve the right to reject any results
|
||||||
|
that I do not trust....
|
||||||
|
--
|
||||||
|
John D. McCalpin, Ph.D.
|
||||||
|
john@mccalpin.com
|
||||||
0
sheet3/1/HISTORY.txt:Zone.Identifier
Normal file
0
sheet3/1/HISTORY.txt:Zone.Identifier
Normal file
34
sheet3/1/LICENSE.txt
Normal file
34
sheet3/1/LICENSE.txt
Normal file
|
|
@ -0,0 +1,34 @@
|
||||||
|
*=======================================================================
|
||||||
|
*-----------------------------------------------------------------------
|
||||||
|
* Copyright 1991-2003: John D. McCalpin
|
||||||
|
*-----------------------------------------------------------------------
|
||||||
|
* License:
|
||||||
|
* 1. You are free to use this program and/or to redistribute
|
||||||
|
* this program.
|
||||||
|
* 2. You are free to modify this program for your own use,
|
||||||
|
* including commercial use, subject to the publication
|
||||||
|
* restrictions in item 3.
|
||||||
|
* 3. You are free to publish results obtained from running this
|
||||||
|
* program, or from works that you derive from this program,
|
||||||
|
* with the following limitations:
|
||||||
|
* 3a. In order to be referred to as "STREAM benchmark results",
|
||||||
|
* published results must be in conformance to the STREAM
|
||||||
|
* Run Rules, (briefly reviewed below) published at
|
||||||
|
* http://www.cs.virginia.edu/stream/ref.html
|
||||||
|
* and incorporated herein by reference.
|
||||||
|
* As the copyright holder, John McCalpin retains the
|
||||||
|
* right to determine conformity with the Run Rules.
|
||||||
|
* 3b. Results based on modified source code or on runs not in
|
||||||
|
* accordance with the STREAM Run Rules must be clearly
|
||||||
|
* labelled whenever they are published. Examples of
|
||||||
|
* proper labelling include:
|
||||||
|
* "tuned STREAM benchmark results"
|
||||||
|
* "based on a variant of the STREAM benchmark code"
|
||||||
|
* Other comparable, clear and reasonable labelling is
|
||||||
|
* acceptable.
|
||||||
|
* 3c. Submission of results to the STREAM benchmark web site
|
||||||
|
* is encouraged, but not required.
|
||||||
|
* 4. Use of this program or creation of derived works based on this
|
||||||
|
* program constitutes acceptance of these licensing restrictions.
|
||||||
|
* 5. Absolutely no warranty is expressed or implied.
|
||||||
|
*-----------------------------------------------------------------------
|
||||||
0
sheet3/1/LICENSE.txt:Zone.Identifier
Normal file
0
sheet3/1/LICENSE.txt:Zone.Identifier
Normal file
44
sheet3/1/Makefile
Normal file
44
sheet3/1/Makefile
Normal file
|
|
@ -0,0 +1,44 @@
|
||||||
|
CC = gcc
|
||||||
|
CFLAGS = -O3
|
||||||
|
DIMENSIONS = -DSTREAM_ARRAY_SIZE=80000000 -DNTIMES=20
|
||||||
|
|
||||||
|
FF = gfortran
|
||||||
|
FFLAGS = -O3
|
||||||
|
|
||||||
|
all: stream_f.exe stream_c.exe flops.exe
|
||||||
|
|
||||||
|
stream_f.exe: stream.f mysecond.o
|
||||||
|
$(CC) $(CFLAGS) -c mysecond.c
|
||||||
|
$(FF) $(FFLAGS) $(DIMENSIONS) -c stream.f
|
||||||
|
$(FF) $(FFLAGS) stream.o mysecond.o -o stream_f.exe
|
||||||
|
|
||||||
|
stream_c.exe: stream.c
|
||||||
|
$(CC) $(CFLAGS) $(DIMENSIONS) stream.c -o stream_c.exe
|
||||||
|
|
||||||
|
clean:
|
||||||
|
rm -f *.exe *.o
|
||||||
|
|
||||||
|
# an example of a more complex build line for the Intel icc compiler
|
||||||
|
stream.icc: stream.c
|
||||||
|
icc -O3 -xCORE-AVX2 -ffreestanding -qopenmp -DSTREAM_ARRAY_SIZE=80000000 -DNTIMES=20 stream.c -o stream.omp.AVX2.80M.20x.icc
|
||||||
|
|
||||||
|
# GH
|
||||||
|
flops.exe:
|
||||||
|
$(CC) $(CFLAGS) -DUNIX flops.c -o flops.exe
|
||||||
|
|
||||||
|
run: clean all
|
||||||
|
./stream_c.exe
|
||||||
|
./flops.exe
|
||||||
|
|
||||||
|
MY_DIR = `basename ${PWD}`
|
||||||
|
tar: clean
|
||||||
|
@cd .. ;\
|
||||||
|
tar cf ${MY_DIR}.tar ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
|
||||||
|
|
||||||
|
zip: clean
|
||||||
|
@cd .. ;\
|
||||||
|
zip -r ${MY_DIR}.zip ${MY_DIR} *default.mk;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
# HG
|
||||||
0
sheet3/1/Makefile:Zone.Identifier
Normal file
0
sheet3/1/Makefile:Zone.Identifier
Normal file
110
sheet3/1/READ.ME
Normal file
110
sheet3/1/READ.ME
Normal file
|
|
@ -0,0 +1,110 @@
|
||||||
|
===============================================
|
||||||
|
|
||||||
|
STREAM is the de facto industry standard benchmark
|
||||||
|
for measuring sustained memory bandwidth.
|
||||||
|
|
||||||
|
Documentation for STREAM is on the web at:
|
||||||
|
http://www.cs.virginia.edu/stream/ref.html
|
||||||
|
|
||||||
|
===============================================
|
||||||
|
NEWS
|
||||||
|
===============================================
|
||||||
|
UPDATE: October 28 2014:
|
||||||
|
|
||||||
|
"stream_mpi.c" released in the Versions directory.
|
||||||
|
|
||||||
|
Based on Version 5.10 of stream.c, stream_mpi.c
|
||||||
|
brings the following new features:
|
||||||
|
* MPI implementation that *distributes* the arrays
|
||||||
|
across all MPI ranks. (The older Fortran version
|
||||||
|
of STREAM in MPI *replicates* the arrays across
|
||||||
|
all MPI ranks.)
|
||||||
|
* Data is allocated using "posix_memalign"
|
||||||
|
rather than using static arrays. Different
|
||||||
|
compiler flags may be needed for both portability
|
||||||
|
and optimization.
|
||||||
|
See the READ.ME file in the Versions directory
|
||||||
|
for more details.
|
||||||
|
* Error checking and timing done by all ranks and
|
||||||
|
gathered by rank 0 for processing and output.
|
||||||
|
* Timing code uses barriers to ensure correct
|
||||||
|
operation even when multiple MPI ranks run on
|
||||||
|
shared memory systems.
|
||||||
|
|
||||||
|
NOTE: MPI is not a preferred implementation for
|
||||||
|
STREAM, which is intended to measure memory
|
||||||
|
bandwidth in shared-memory systems. In stream_mpi,
|
||||||
|
the MPI calls are only used to properly synchronize
|
||||||
|
the timers (using MPI_Barrier) and to gather
|
||||||
|
timing and error data, so the performance should
|
||||||
|
scale linearly with the size of the cluster.
|
||||||
|
But it may be useful, and was an interesting
|
||||||
|
exercise to develop and debug.
|
||||||
|
|
||||||
|
===============================================
|
||||||
|
UPDATE: January 17 2013:
|
||||||
|
|
||||||
|
Version 5.10 of stream.c is finally available!
|
||||||
|
|
||||||
|
There are no changes to what is being measured, but
|
||||||
|
a number of long-awaited improvements have been made:
|
||||||
|
|
||||||
|
* Updated validation code does not suffer from
|
||||||
|
accumulated roundoff error for large arrays.
|
||||||
|
* Defining the preprocessor variable "VERBOSE"
|
||||||
|
when compiling will (1) cause the code to print the
|
||||||
|
measured average relative absolute error (rather than
|
||||||
|
simply printing "Solution Validates", and (2) print
|
||||||
|
the first 10 array entries with relative error exceeding
|
||||||
|
the error tolerance.
|
||||||
|
* Array index variables have been upgraded from
|
||||||
|
"int" to "ssize_t" to allow arrays with more
|
||||||
|
than 2 billion elements on 64-bit systems.
|
||||||
|
* Substantial improvements to the comments in
|
||||||
|
the source on how to configure/compile/run the
|
||||||
|
benchmark.
|
||||||
|
* The proprocessor variable controlling the array
|
||||||
|
size has been changed from "N" to "STREAM_ARRAY_SIZE".
|
||||||
|
* A new preprocessor variable "STREAM_TYPE" can be
|
||||||
|
used to override the data type from the default
|
||||||
|
"double" to "float".
|
||||||
|
This mechanism could also be used to change to
|
||||||
|
non-floating-point types, but several "printf"
|
||||||
|
statements would need to have their formats changed
|
||||||
|
to accomodate the modified data type.
|
||||||
|
* Some small changes in output, including printing
|
||||||
|
array sizes is GiB as well as MiB.
|
||||||
|
* Change to the default output format to print fewer
|
||||||
|
decimals for the bandwidth and more decimals for
|
||||||
|
the min/max/avg execution times.
|
||||||
|
|
||||||
|
|
||||||
|
===============================================
|
||||||
|
UPDATE: February 19 2009:
|
||||||
|
|
||||||
|
The most recent "official" versions have been renamed
|
||||||
|
"stream.f" and "stream.c" -- all other versions have
|
||||||
|
been moved to the "Versions" subdirectory and should be
|
||||||
|
considered obsolete.
|
||||||
|
|
||||||
|
The "official" timer (was "second_wall.c") has been
|
||||||
|
renamed "mysecond.c". This is embedded in the C version
|
||||||
|
("stream.c"), but still needs to be externally linked to
|
||||||
|
the FORTRAN version ("stream.f"). The new version defines
|
||||||
|
entry points both with and without trailing underscores,
|
||||||
|
so it *should* link automagically with any Fortran compiler.
|
||||||
|
|
||||||
|
===============================================
|
||||||
|
|
||||||
|
STREAM is a project of "Dr. Bandwidth":
|
||||||
|
John D. McCalpin, Ph.D.
|
||||||
|
john@mccalpin.com
|
||||||
|
|
||||||
|
===============================================
|
||||||
|
|
||||||
|
The STREAM web and ftp sites are currently hosted at
|
||||||
|
the Department of Computer Science at the University of
|
||||||
|
Virginia under the generous sponsorship of Professor Bill
|
||||||
|
Wulf and Professor Alan Batson.
|
||||||
|
|
||||||
|
===============================================
|
||||||
0
sheet3/1/READ.ME:Zone.Identifier
Normal file
0
sheet3/1/READ.ME:Zone.Identifier
Normal file
1156
sheet3/1/flops.c
Normal file
1156
sheet3/1/flops.c
Normal file
File diff suppressed because it is too large
Load diff
0
sheet3/1/flops.c:Zone.Identifier
Normal file
0
sheet3/1/flops.c:Zone.Identifier
Normal file
27
sheet3/1/mysecond.c
Normal file
27
sheet3/1/mysecond.c
Normal file
|
|
@ -0,0 +1,27 @@
|
||||||
|
/* A gettimeofday routine to give access to the wall
|
||||||
|
clock timer on most UNIX-like systems.
|
||||||
|
|
||||||
|
This version defines two entry points -- with
|
||||||
|
and without appended underscores, so it *should*
|
||||||
|
automagically link with FORTRAN */
|
||||||
|
|
||||||
|
#include <sys/time.h>
|
||||||
|
|
||||||
|
double mysecond()
|
||||||
|
{
|
||||||
|
/* struct timeval { long tv_sec;
|
||||||
|
long tv_usec; };
|
||||||
|
|
||||||
|
struct timezone { int tz_minuteswest;
|
||||||
|
int tz_dsttime; }; */
|
||||||
|
|
||||||
|
struct timeval tp;
|
||||||
|
struct timezone tzp;
|
||||||
|
int i;
|
||||||
|
|
||||||
|
i = gettimeofday(&tp,&tzp);
|
||||||
|
return ( (double) tp.tv_sec + (double) tp.tv_usec * 1.e-6 );
|
||||||
|
}
|
||||||
|
|
||||||
|
double mysecond_() {return mysecond();}
|
||||||
|
|
||||||
0
sheet3/1/mysecond.c:Zone.Identifier
Normal file
0
sheet3/1/mysecond.c:Zone.Identifier
Normal file
60
sheet3/1/output_pc1.txt
Normal file
60
sheet3/1/output_pc1.txt
Normal file
|
|
@ -0,0 +1,60 @@
|
||||||
|
rm -f *.exe *.o
|
||||||
|
gcc -O3 -c -o mysecond.o mysecond.c
|
||||||
|
gcc -O3 -c mysecond.c
|
||||||
|
gfortran -O3 -DSTREAM_ARRAY_SIZE=80000000 -DNTIMES=20 -c stream.f
|
||||||
|
gfortran -O3 stream.o mysecond.o -o stream_f.exe
|
||||||
|
gcc -O3 -DSTREAM_ARRAY_SIZE=80000000 -DNTIMES=20 stream.c -o stream_c.exe
|
||||||
|
gcc -O3 -DUNIX flops.c -o flops.exe
|
||||||
|
./stream_c.exe
|
||||||
|
-------------------------------------------------------------
|
||||||
|
STREAM version $Revision: 5.10 $
|
||||||
|
-------------------------------------------------------------
|
||||||
|
This system uses 8 bytes per array element.
|
||||||
|
-------------------------------------------------------------
|
||||||
|
Array size = 80000000 (elements), Offset = 0 (elements)
|
||||||
|
Memory per array = 610.4 MiB (= 0.6 GiB).
|
||||||
|
Total memory required = 1831.1 MiB (= 1.8 GiB).
|
||||||
|
Each kernel will be executed 20 times.
|
||||||
|
The *best* time for each kernel (excluding the first iteration)
|
||||||
|
will be used to compute the reported bandwidth.
|
||||||
|
-------------------------------------------------------------
|
||||||
|
Your clock granularity/precision appears to be 1 microseconds.
|
||||||
|
Each test below will take on the order of 46252 microseconds.
|
||||||
|
(= 46252 clock ticks)
|
||||||
|
Increase the size of the arrays if this shows that
|
||||||
|
you are not getting at least 20 clock ticks per test.
|
||||||
|
-------------------------------------------------------------
|
||||||
|
WARNING -- The above is only a rough guideline.
|
||||||
|
For best results, please be sure you know the
|
||||||
|
precision of your system timer.
|
||||||
|
-------------------------------------------------------------
|
||||||
|
Function Best Rate MB/s Avg time Min time Max time
|
||||||
|
Copy: 28478.6 0.047858 0.044946 0.054333
|
||||||
|
Scale: 20551.4 0.066044 0.062283 0.077807
|
||||||
|
Add: 22534.2 0.089671 0.085204 0.099586
|
||||||
|
Triad: 22709.5 0.088864 0.084546 0.098536
|
||||||
|
-------------------------------------------------------------
|
||||||
|
Solution Validates: avg error less than 1.000000e-13 on all three arrays
|
||||||
|
-------------------------------------------------------------
|
||||||
|
./flops.exe
|
||||||
|
|
||||||
|
FLOPS C Program (Double Precision), V2.0 18 Dec 1992
|
||||||
|
|
||||||
|
Module Error RunTime MFLOPS
|
||||||
|
(usec)
|
||||||
|
1 4.0146e-13 0.0021 6622.7552
|
||||||
|
2 -1.4166e-13 0.0006 12723.3419
|
||||||
|
3 4.7184e-14 0.0027 6253.2599
|
||||||
|
4 -1.2557e-13 0.0026 5758.6323
|
||||||
|
5 -1.3800e-13 0.0051 5740.4851
|
||||||
|
6 3.2380e-13 0.0051 5674.2511
|
||||||
|
7 -8.4583e-11 0.0031 3827.0478
|
||||||
|
8 3.4867e-13 0.0053 5610.0203
|
||||||
|
|
||||||
|
Iterations = 512000000
|
||||||
|
NullTime (usec) = 0.0000
|
||||||
|
MFLOPS(1) = 9507.3864
|
||||||
|
MFLOPS(2) = 5042.7572
|
||||||
|
MFLOPS(3) = 5597.4972
|
||||||
|
MFLOPS(4) = 5766.1547
|
||||||
|
|
||||||
585
sheet3/1/stream.c
Normal file
585
sheet3/1/stream.c
Normal file
|
|
@ -0,0 +1,585 @@
|
||||||
|
/*-----------------------------------------------------------------------*/
|
||||||
|
/* Program: STREAM */
|
||||||
|
/* Revision: $Id: stream.c,v 5.10 2013/01/17 16:01:06 mccalpin Exp mccalpin $ */
|
||||||
|
/* Original code developed by John D. McCalpin */
|
||||||
|
/* Programmers: John D. McCalpin */
|
||||||
|
/* Joe R. Zagar */
|
||||||
|
/* */
|
||||||
|
/* This program measures memory transfer rates in MB/s for simple */
|
||||||
|
/* computational kernels coded in C. */
|
||||||
|
/*-----------------------------------------------------------------------*/
|
||||||
|
/* Copyright 1991-2013: John D. McCalpin */
|
||||||
|
/*-----------------------------------------------------------------------*/
|
||||||
|
/* License: */
|
||||||
|
/* 1. You are free to use this program and/or to redistribute */
|
||||||
|
/* this program. */
|
||||||
|
/* 2. You are free to modify this program for your own use, */
|
||||||
|
/* including commercial use, subject to the publication */
|
||||||
|
/* restrictions in item 3. */
|
||||||
|
/* 3. You are free to publish results obtained from running this */
|
||||||
|
/* program, or from works that you derive from this program, */
|
||||||
|
/* with the following limitations: */
|
||||||
|
/* 3a. In order to be referred to as "STREAM benchmark results", */
|
||||||
|
/* published results must be in conformance to the STREAM */
|
||||||
|
/* Run Rules, (briefly reviewed below) published at */
|
||||||
|
/* http://www.cs.virginia.edu/stream/ref.html */
|
||||||
|
/* and incorporated herein by reference. */
|
||||||
|
/* As the copyright holder, John McCalpin retains the */
|
||||||
|
/* right to determine conformity with the Run Rules. */
|
||||||
|
/* 3b. Results based on modified source code or on runs not in */
|
||||||
|
/* accordance with the STREAM Run Rules must be clearly */
|
||||||
|
/* labelled whenever they are published. Examples of */
|
||||||
|
/* proper labelling include: */
|
||||||
|
/* "tuned STREAM benchmark results" */
|
||||||
|
/* "based on a variant of the STREAM benchmark code" */
|
||||||
|
/* Other comparable, clear, and reasonable labelling is */
|
||||||
|
/* acceptable. */
|
||||||
|
/* 3c. Submission of results to the STREAM benchmark web site */
|
||||||
|
/* is encouraged, but not required. */
|
||||||
|
/* 4. Use of this program or creation of derived works based on this */
|
||||||
|
/* program constitutes acceptance of these licensing restrictions. */
|
||||||
|
/* 5. Absolutely no warranty is expressed or implied. */
|
||||||
|
/*-----------------------------------------------------------------------*/
|
||||||
|
# include <stdio.h>
|
||||||
|
# include <unistd.h>
|
||||||
|
# include <math.h>
|
||||||
|
# include <float.h>
|
||||||
|
# include <limits.h>
|
||||||
|
# include <sys/time.h>
|
||||||
|
|
||||||
|
/*-----------------------------------------------------------------------
|
||||||
|
* INSTRUCTIONS:
|
||||||
|
*
|
||||||
|
* 1) STREAM requires different amounts of memory to run on different
|
||||||
|
* systems, depending on both the system cache size(s) and the
|
||||||
|
* granularity of the system timer.
|
||||||
|
* You should adjust the value of 'STREAM_ARRAY_SIZE' (below)
|
||||||
|
* to meet *both* of the following criteria:
|
||||||
|
* (a) Each array must be at least 4 times the size of the
|
||||||
|
* available cache memory. I don't worry about the difference
|
||||||
|
* between 10^6 and 2^20, so in practice the minimum array size
|
||||||
|
* is about 3.8 times the cache size.
|
||||||
|
* Example 1: One Xeon E3 with 8 MB L3 cache
|
||||||
|
* STREAM_ARRAY_SIZE should be >= 4 million, giving
|
||||||
|
* an array size of 30.5 MB and a total memory requirement
|
||||||
|
* of 91.5 MB.
|
||||||
|
* Example 2: Two Xeon E5's with 20 MB L3 cache each (using OpenMP)
|
||||||
|
* STREAM_ARRAY_SIZE should be >= 20 million, giving
|
||||||
|
* an array size of 153 MB and a total memory requirement
|
||||||
|
* of 458 MB.
|
||||||
|
* (b) The size should be large enough so that the 'timing calibration'
|
||||||
|
* output by the program is at least 20 clock-ticks.
|
||||||
|
* Example: most versions of Windows have a 10 millisecond timer
|
||||||
|
* granularity. 20 "ticks" at 10 ms/tic is 200 milliseconds.
|
||||||
|
* If the chip is capable of 10 GB/s, it moves 2 GB in 200 msec.
|
||||||
|
* This means the each array must be at least 1 GB, or 128M elements.
|
||||||
|
*
|
||||||
|
* Version 5.10 increases the default array size from 2 million
|
||||||
|
* elements to 10 million elements in response to the increasing
|
||||||
|
* size of L3 caches. The new default size is large enough for caches
|
||||||
|
* up to 20 MB.
|
||||||
|
* Version 5.10 changes the loop index variables from "register int"
|
||||||
|
* to "ssize_t", which allows array indices >2^32 (4 billion)
|
||||||
|
* on properly configured 64-bit systems. Additional compiler options
|
||||||
|
* (such as "-mcmodel=medium") may be required for large memory runs.
|
||||||
|
*
|
||||||
|
* Array size can be set at compile time without modifying the source
|
||||||
|
* code for the (many) compilers that support preprocessor definitions
|
||||||
|
* on the compile line. E.g.,
|
||||||
|
* gcc -O -DSTREAM_ARRAY_SIZE=100000000 stream.c -o stream.100M
|
||||||
|
* will override the default size of 10M with a new size of 100M elements
|
||||||
|
* per array.
|
||||||
|
*/
|
||||||
|
#ifndef STREAM_ARRAY_SIZE
|
||||||
|
# define STREAM_ARRAY_SIZE 10000000
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* 2) STREAM runs each kernel "NTIMES" times and reports the *best* result
|
||||||
|
* for any iteration after the first, therefore the minimum value
|
||||||
|
* for NTIMES is 2.
|
||||||
|
* There are no rules on maximum allowable values for NTIMES, but
|
||||||
|
* values larger than the default are unlikely to noticeably
|
||||||
|
* increase the reported performance.
|
||||||
|
* NTIMES can also be set on the compile line without changing the source
|
||||||
|
* code using, for example, "-DNTIMES=7".
|
||||||
|
*/
|
||||||
|
#ifdef NTIMES
|
||||||
|
#if NTIMES<=1
|
||||||
|
# define NTIMES 10
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
#ifndef NTIMES
|
||||||
|
# define NTIMES 10
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Users are allowed to modify the "OFFSET" variable, which *may* change the
|
||||||
|
* relative alignment of the arrays (though compilers may change the
|
||||||
|
* effective offset by making the arrays non-contiguous on some systems).
|
||||||
|
* Use of non-zero values for OFFSET can be especially helpful if the
|
||||||
|
* STREAM_ARRAY_SIZE is set to a value close to a large power of 2.
|
||||||
|
* OFFSET can also be set on the compile line without changing the source
|
||||||
|
* code using, for example, "-DOFFSET=56".
|
||||||
|
*/
|
||||||
|
#ifndef OFFSET
|
||||||
|
# define OFFSET 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* 3) Compile the code with optimization. Many compilers generate
|
||||||
|
* unreasonably bad code before the optimizer tightens things up.
|
||||||
|
* If the results are unreasonably good, on the other hand, the
|
||||||
|
* optimizer might be too smart for me!
|
||||||
|
*
|
||||||
|
* For a simple single-core version, try compiling with:
|
||||||
|
* cc -O stream.c -o stream
|
||||||
|
* This is known to work on many, many systems....
|
||||||
|
*
|
||||||
|
* To use multiple cores, you need to tell the compiler to obey the OpenMP
|
||||||
|
* directives in the code. This varies by compiler, but a common example is
|
||||||
|
* gcc -O -fopenmp stream.c -o stream_omp
|
||||||
|
* The environment variable OMP_NUM_THREADS allows runtime control of the
|
||||||
|
* number of threads/cores used when the resulting "stream_omp" program
|
||||||
|
* is executed.
|
||||||
|
*
|
||||||
|
* To run with single-precision variables and arithmetic, simply add
|
||||||
|
* -DSTREAM_TYPE=float
|
||||||
|
* to the compile line.
|
||||||
|
* Note that this changes the minimum array sizes required --- see (1) above.
|
||||||
|
*
|
||||||
|
* The preprocessor directive "TUNED" does not do much -- it simply causes the
|
||||||
|
* code to call separate functions to execute each kernel. Trivial versions
|
||||||
|
* of these functions are provided, but they are *not* tuned -- they just
|
||||||
|
* provide predefined interfaces to be replaced with tuned code.
|
||||||
|
*
|
||||||
|
*
|
||||||
|
* 4) Optional: Mail the results to mccalpin@cs.virginia.edu
|
||||||
|
* Be sure to include info that will help me understand:
|
||||||
|
* a) the computer hardware configuration (e.g., processor model, memory type)
|
||||||
|
* b) the compiler name/version and compilation flags
|
||||||
|
* c) any run-time information (such as OMP_NUM_THREADS)
|
||||||
|
* d) all of the output from the test case.
|
||||||
|
*
|
||||||
|
* Thanks!
|
||||||
|
*
|
||||||
|
*-----------------------------------------------------------------------*/
|
||||||
|
|
||||||
|
# define HLINE "-------------------------------------------------------------\n"
|
||||||
|
|
||||||
|
# ifndef MIN
|
||||||
|
# define MIN(x,y) ((x)<(y)?(x):(y))
|
||||||
|
# endif
|
||||||
|
# ifndef MAX
|
||||||
|
# define MAX(x,y) ((x)>(y)?(x):(y))
|
||||||
|
# endif
|
||||||
|
|
||||||
|
#ifndef STREAM_TYPE
|
||||||
|
#define STREAM_TYPE double
|
||||||
|
#endif
|
||||||
|
|
||||||
|
static STREAM_TYPE a[STREAM_ARRAY_SIZE+OFFSET],
|
||||||
|
b[STREAM_ARRAY_SIZE+OFFSET],
|
||||||
|
c[STREAM_ARRAY_SIZE+OFFSET];
|
||||||
|
|
||||||
|
static double avgtime[4] = {0}, maxtime[4] = {0},
|
||||||
|
mintime[4] = {FLT_MAX,FLT_MAX,FLT_MAX,FLT_MAX};
|
||||||
|
|
||||||
|
static char *label[4] = {"Copy: ", "Scale: ",
|
||||||
|
"Add: ", "Triad: "};
|
||||||
|
|
||||||
|
static double bytes[4] = {
|
||||||
|
2 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE,
|
||||||
|
2 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE,
|
||||||
|
3 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE,
|
||||||
|
3 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE
|
||||||
|
};
|
||||||
|
|
||||||
|
extern double mysecond();
|
||||||
|
extern void checkSTREAMresults();
|
||||||
|
#ifdef TUNED
|
||||||
|
extern void tuned_STREAM_Copy();
|
||||||
|
extern void tuned_STREAM_Scale(STREAM_TYPE scalar);
|
||||||
|
extern void tuned_STREAM_Add();
|
||||||
|
extern void tuned_STREAM_Triad(STREAM_TYPE scalar);
|
||||||
|
#endif
|
||||||
|
#ifdef _OPENMP
|
||||||
|
extern int omp_get_num_threads();
|
||||||
|
#endif
|
||||||
|
int
|
||||||
|
main()
|
||||||
|
{
|
||||||
|
int quantum, checktick();
|
||||||
|
int BytesPerWord;
|
||||||
|
int k;
|
||||||
|
ssize_t j;
|
||||||
|
STREAM_TYPE scalar;
|
||||||
|
double t, times[4][NTIMES];
|
||||||
|
|
||||||
|
/* --- SETUP --- determine precision and check timing --- */
|
||||||
|
|
||||||
|
printf(HLINE);
|
||||||
|
printf("STREAM version $Revision: 5.10 $\n");
|
||||||
|
printf(HLINE);
|
||||||
|
BytesPerWord = sizeof(STREAM_TYPE);
|
||||||
|
printf("This system uses %d bytes per array element.\n",
|
||||||
|
BytesPerWord);
|
||||||
|
|
||||||
|
printf(HLINE);
|
||||||
|
#ifdef N
|
||||||
|
printf("***** WARNING: ******\n");
|
||||||
|
printf(" It appears that you set the preprocessor variable N when compiling this code.\n");
|
||||||
|
printf(" This version of the code uses the preprocesor variable STREAM_ARRAY_SIZE to control the array size\n");
|
||||||
|
printf(" Reverting to default value of STREAM_ARRAY_SIZE=%llu\n",(unsigned long long) STREAM_ARRAY_SIZE);
|
||||||
|
printf("***** WARNING: ******\n");
|
||||||
|
#endif
|
||||||
|
|
||||||
|
printf("Array size = %llu (elements), Offset = %d (elements)\n" , (unsigned long long) STREAM_ARRAY_SIZE, OFFSET);
|
||||||
|
printf("Memory per array = %.1f MiB (= %.1f GiB).\n",
|
||||||
|
BytesPerWord * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024.0),
|
||||||
|
BytesPerWord * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024.0/1024.0));
|
||||||
|
printf("Total memory required = %.1f MiB (= %.1f GiB).\n",
|
||||||
|
(3.0 * BytesPerWord) * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024.),
|
||||||
|
(3.0 * BytesPerWord) * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024./1024.));
|
||||||
|
printf("Each kernel will be executed %d times.\n", NTIMES);
|
||||||
|
printf(" The *best* time for each kernel (excluding the first iteration)\n");
|
||||||
|
printf(" will be used to compute the reported bandwidth.\n");
|
||||||
|
|
||||||
|
#ifdef _OPENMP
|
||||||
|
printf(HLINE);
|
||||||
|
#pragma omp parallel
|
||||||
|
{
|
||||||
|
#pragma omp master
|
||||||
|
{
|
||||||
|
k = omp_get_num_threads();
|
||||||
|
printf ("Number of Threads requested = %i\n",k);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef _OPENMP
|
||||||
|
k = 0;
|
||||||
|
#pragma omp parallel
|
||||||
|
#pragma omp atomic
|
||||||
|
k++;
|
||||||
|
printf ("Number of Threads counted = %i\n",k);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Get initial value for system clock. */
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
|
||||||
|
a[j] = 1.0;
|
||||||
|
b[j] = 2.0;
|
||||||
|
c[j] = 0.0;
|
||||||
|
}
|
||||||
|
|
||||||
|
printf(HLINE);
|
||||||
|
|
||||||
|
if ( (quantum = checktick()) >= 1)
|
||||||
|
printf("Your clock granularity/precision appears to be "
|
||||||
|
"%d microseconds.\n", quantum);
|
||||||
|
else {
|
||||||
|
printf("Your clock granularity appears to be "
|
||||||
|
"less than one microsecond.\n");
|
||||||
|
quantum = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
t = mysecond();
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j = 0; j < STREAM_ARRAY_SIZE; j++)
|
||||||
|
a[j] = 2.0E0 * a[j];
|
||||||
|
t = 1.0E6 * (mysecond() - t);
|
||||||
|
|
||||||
|
printf("Each test below will take on the order"
|
||||||
|
" of %d microseconds.\n", (int) t );
|
||||||
|
printf(" (= %d clock ticks)\n", (int) (t/quantum) );
|
||||||
|
printf("Increase the size of the arrays if this shows that\n");
|
||||||
|
printf("you are not getting at least 20 clock ticks per test.\n");
|
||||||
|
|
||||||
|
printf(HLINE);
|
||||||
|
|
||||||
|
printf("WARNING -- The above is only a rough guideline.\n");
|
||||||
|
printf("For best results, please be sure you know the\n");
|
||||||
|
printf("precision of your system timer.\n");
|
||||||
|
printf(HLINE);
|
||||||
|
|
||||||
|
/* --- MAIN LOOP --- repeat test cases NTIMES times --- */
|
||||||
|
|
||||||
|
scalar = 3.0;
|
||||||
|
for (k=0; k<NTIMES; k++)
|
||||||
|
{
|
||||||
|
times[0][k] = mysecond();
|
||||||
|
#ifdef TUNED
|
||||||
|
tuned_STREAM_Copy();
|
||||||
|
#else
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
c[j] = a[j];
|
||||||
|
#endif
|
||||||
|
times[0][k] = mysecond() - times[0][k];
|
||||||
|
|
||||||
|
times[1][k] = mysecond();
|
||||||
|
#ifdef TUNED
|
||||||
|
tuned_STREAM_Scale(scalar);
|
||||||
|
#else
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
b[j] = scalar*c[j];
|
||||||
|
#endif
|
||||||
|
times[1][k] = mysecond() - times[1][k];
|
||||||
|
|
||||||
|
times[2][k] = mysecond();
|
||||||
|
#ifdef TUNED
|
||||||
|
tuned_STREAM_Add();
|
||||||
|
#else
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
c[j] = a[j]+b[j];
|
||||||
|
#endif
|
||||||
|
times[2][k] = mysecond() - times[2][k];
|
||||||
|
|
||||||
|
times[3][k] = mysecond();
|
||||||
|
#ifdef TUNED
|
||||||
|
tuned_STREAM_Triad(scalar);
|
||||||
|
#else
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
a[j] = b[j]+scalar*c[j];
|
||||||
|
#endif
|
||||||
|
times[3][k] = mysecond() - times[3][k];
|
||||||
|
}
|
||||||
|
|
||||||
|
/* --- SUMMARY --- */
|
||||||
|
|
||||||
|
for (k=1; k<NTIMES; k++) /* note -- skip first iteration */
|
||||||
|
{
|
||||||
|
for (j=0; j<4; j++)
|
||||||
|
{
|
||||||
|
avgtime[j] = avgtime[j] + times[j][k];
|
||||||
|
mintime[j] = MIN(mintime[j], times[j][k]);
|
||||||
|
maxtime[j] = MAX(maxtime[j], times[j][k]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
printf("Function Best Rate MB/s Avg time Min time Max time\n");
|
||||||
|
for (j=0; j<4; j++) {
|
||||||
|
avgtime[j] = avgtime[j]/(double)(NTIMES-1);
|
||||||
|
|
||||||
|
printf("%s%12.1f %11.6f %11.6f %11.6f\n", label[j],
|
||||||
|
1.0E-06 * bytes[j]/mintime[j],
|
||||||
|
avgtime[j],
|
||||||
|
mintime[j],
|
||||||
|
maxtime[j]);
|
||||||
|
}
|
||||||
|
printf(HLINE);
|
||||||
|
|
||||||
|
/* --- Check Results --- */
|
||||||
|
checkSTREAMresults();
|
||||||
|
printf(HLINE);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
# define M 20
|
||||||
|
|
||||||
|
int
|
||||||
|
checktick()
|
||||||
|
{
|
||||||
|
int i, minDelta, Delta;
|
||||||
|
double t1, t2, timesfound[M];
|
||||||
|
|
||||||
|
/* Collect a sequence of M unique time values from the system. */
|
||||||
|
|
||||||
|
for (i = 0; i < M; i++) {
|
||||||
|
t1 = mysecond();
|
||||||
|
while( ((t2=mysecond()) - t1) < 1.0E-6 )
|
||||||
|
;
|
||||||
|
timesfound[i] = t1 = t2;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Determine the minimum difference between these M values.
|
||||||
|
* This result will be our estimate (in microseconds) for the
|
||||||
|
* clock granularity.
|
||||||
|
*/
|
||||||
|
|
||||||
|
minDelta = 1000000;
|
||||||
|
for (i = 1; i < M; i++) {
|
||||||
|
Delta = (int)( 1.0E6 * (timesfound[i]-timesfound[i-1]));
|
||||||
|
minDelta = MIN(minDelta, MAX(Delta,0));
|
||||||
|
}
|
||||||
|
|
||||||
|
return(minDelta);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* A gettimeofday routine to give access to the wall
|
||||||
|
clock timer on most UNIX-like systems. */
|
||||||
|
|
||||||
|
#include <sys/time.h>
|
||||||
|
|
||||||
|
double mysecond()
|
||||||
|
{
|
||||||
|
struct timeval tp;
|
||||||
|
struct timezone tzp;
|
||||||
|
int i;
|
||||||
|
|
||||||
|
i = gettimeofday(&tp,&tzp);
|
||||||
|
return ( (double) tp.tv_sec + (double) tp.tv_usec * 1.e-6 );
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifndef abs
|
||||||
|
#define abs(a) ((a) >= 0 ? (a) : -(a))
|
||||||
|
#endif
|
||||||
|
void checkSTREAMresults ()
|
||||||
|
{
|
||||||
|
STREAM_TYPE aj,bj,cj,scalar;
|
||||||
|
STREAM_TYPE aSumErr,bSumErr,cSumErr;
|
||||||
|
STREAM_TYPE aAvgErr,bAvgErr,cAvgErr;
|
||||||
|
double epsilon;
|
||||||
|
ssize_t j;
|
||||||
|
int k,ierr,err;
|
||||||
|
|
||||||
|
/* reproduce initialization */
|
||||||
|
aj = 1.0;
|
||||||
|
bj = 2.0;
|
||||||
|
cj = 0.0;
|
||||||
|
/* a[] is modified during timing check */
|
||||||
|
aj = 2.0E0 * aj;
|
||||||
|
/* now execute timing loop */
|
||||||
|
scalar = 3.0;
|
||||||
|
for (k=0; k<NTIMES; k++)
|
||||||
|
{
|
||||||
|
cj = aj;
|
||||||
|
bj = scalar*cj;
|
||||||
|
cj = aj+bj;
|
||||||
|
aj = bj+scalar*cj;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* accumulate deltas between observed and expected results */
|
||||||
|
aSumErr = 0.0;
|
||||||
|
bSumErr = 0.0;
|
||||||
|
cSumErr = 0.0;
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
|
||||||
|
aSumErr += abs(a[j] - aj);
|
||||||
|
bSumErr += abs(b[j] - bj);
|
||||||
|
cSumErr += abs(c[j] - cj);
|
||||||
|
// if (j == 417) printf("Index 417: c[j]: %f, cj: %f\n",c[j],cj); // MCCALPIN
|
||||||
|
}
|
||||||
|
aAvgErr = aSumErr / (STREAM_TYPE) STREAM_ARRAY_SIZE;
|
||||||
|
bAvgErr = bSumErr / (STREAM_TYPE) STREAM_ARRAY_SIZE;
|
||||||
|
cAvgErr = cSumErr / (STREAM_TYPE) STREAM_ARRAY_SIZE;
|
||||||
|
|
||||||
|
if (sizeof(STREAM_TYPE) == 4) {
|
||||||
|
epsilon = 1.e-6;
|
||||||
|
}
|
||||||
|
else if (sizeof(STREAM_TYPE) == 8) {
|
||||||
|
epsilon = 1.e-13;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
printf("WEIRD: sizeof(STREAM_TYPE) = %lu\n",sizeof(STREAM_TYPE));
|
||||||
|
epsilon = 1.e-6;
|
||||||
|
}
|
||||||
|
|
||||||
|
err = 0;
|
||||||
|
if (abs(aAvgErr/aj) > epsilon) {
|
||||||
|
err++;
|
||||||
|
printf ("Failed Validation on array a[], AvgRelAbsErr > epsilon (%e)\n",epsilon);
|
||||||
|
printf (" Expected Value: %e, AvgAbsErr: %e, AvgRelAbsErr: %e\n",aj,aAvgErr,abs(aAvgErr)/aj);
|
||||||
|
ierr = 0;
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
|
||||||
|
if (abs(a[j]/aj-1.0) > epsilon) {
|
||||||
|
ierr++;
|
||||||
|
#ifdef VERBOSE
|
||||||
|
if (ierr < 10) {
|
||||||
|
printf(" array a: index: %ld, expected: %e, observed: %e, relative error: %e\n",
|
||||||
|
j,aj,a[j],abs((aj-a[j])/aAvgErr));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
}
|
||||||
|
printf(" For array a[], %d errors were found.\n",ierr);
|
||||||
|
}
|
||||||
|
if (abs(bAvgErr/bj) > epsilon) {
|
||||||
|
err++;
|
||||||
|
printf ("Failed Validation on array b[], AvgRelAbsErr > epsilon (%e)\n",epsilon);
|
||||||
|
printf (" Expected Value: %e, AvgAbsErr: %e, AvgRelAbsErr: %e\n",bj,bAvgErr,abs(bAvgErr)/bj);
|
||||||
|
printf (" AvgRelAbsErr > Epsilon (%e)\n",epsilon);
|
||||||
|
ierr = 0;
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
|
||||||
|
if (abs(b[j]/bj-1.0) > epsilon) {
|
||||||
|
ierr++;
|
||||||
|
#ifdef VERBOSE
|
||||||
|
if (ierr < 10) {
|
||||||
|
printf(" array b: index: %ld, expected: %e, observed: %e, relative error: %e\n",
|
||||||
|
j,bj,b[j],abs((bj-b[j])/bAvgErr));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
}
|
||||||
|
printf(" For array b[], %d errors were found.\n",ierr);
|
||||||
|
}
|
||||||
|
if (abs(cAvgErr/cj) > epsilon) {
|
||||||
|
err++;
|
||||||
|
printf ("Failed Validation on array c[], AvgRelAbsErr > epsilon (%e)\n",epsilon);
|
||||||
|
printf (" Expected Value: %e, AvgAbsErr: %e, AvgRelAbsErr: %e\n",cj,cAvgErr,abs(cAvgErr)/cj);
|
||||||
|
printf (" AvgRelAbsErr > Epsilon (%e)\n",epsilon);
|
||||||
|
ierr = 0;
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
|
||||||
|
if (abs(c[j]/cj-1.0) > epsilon) {
|
||||||
|
ierr++;
|
||||||
|
#ifdef VERBOSE
|
||||||
|
if (ierr < 10) {
|
||||||
|
printf(" array c: index: %ld, expected: %e, observed: %e, relative error: %e\n",
|
||||||
|
j,cj,c[j],abs((cj-c[j])/cAvgErr));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
}
|
||||||
|
printf(" For array c[], %d errors were found.\n",ierr);
|
||||||
|
}
|
||||||
|
if (err == 0) {
|
||||||
|
printf ("Solution Validates: avg error less than %e on all three arrays\n",epsilon);
|
||||||
|
}
|
||||||
|
#ifdef VERBOSE
|
||||||
|
printf ("Results Validation Verbose Results: \n");
|
||||||
|
printf (" Expected a(1), b(1), c(1): %f %f %f \n",aj,bj,cj);
|
||||||
|
printf (" Observed a(1), b(1), c(1): %f %f %f \n",a[1],b[1],c[1]);
|
||||||
|
printf (" Rel Errors on a, b, c: %e %e %e \n",abs(aAvgErr/aj),abs(bAvgErr/bj),abs(cAvgErr/cj));
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef TUNED
|
||||||
|
/* stubs for "tuned" versions of the kernels */
|
||||||
|
void tuned_STREAM_Copy()
|
||||||
|
{
|
||||||
|
ssize_t j;
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
c[j] = a[j];
|
||||||
|
}
|
||||||
|
|
||||||
|
void tuned_STREAM_Scale(STREAM_TYPE scalar)
|
||||||
|
{
|
||||||
|
ssize_t j;
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
b[j] = scalar*c[j];
|
||||||
|
}
|
||||||
|
|
||||||
|
void tuned_STREAM_Add()
|
||||||
|
{
|
||||||
|
ssize_t j;
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
c[j] = a[j]+b[j];
|
||||||
|
}
|
||||||
|
|
||||||
|
void tuned_STREAM_Triad(STREAM_TYPE scalar)
|
||||||
|
{
|
||||||
|
ssize_t j;
|
||||||
|
#pragma omp parallel for
|
||||||
|
for (j=0; j<STREAM_ARRAY_SIZE; j++)
|
||||||
|
a[j] = b[j]+scalar*c[j];
|
||||||
|
}
|
||||||
|
/* end of stubs for the "tuned" versions of the kernels */
|
||||||
|
#endif
|
||||||
0
sheet3/1/stream.c:Zone.Identifier
Normal file
0
sheet3/1/stream.c:Zone.Identifier
Normal file
462
sheet3/1/stream.f
Normal file
462
sheet3/1/stream.f
Normal file
|
|
@ -0,0 +1,462 @@
|
||||||
|
*=======================================================================
|
||||||
|
* Program: STREAM
|
||||||
|
* Programmer: John D. McCalpin
|
||||||
|
* RCS Revision: $Id: stream.f,v 5.6 2005/10/04 00:20:48 mccalpin Exp mccalpin $
|
||||||
|
*-----------------------------------------------------------------------
|
||||||
|
* Copyright 1991-2003: John D. McCalpin
|
||||||
|
*-----------------------------------------------------------------------
|
||||||
|
* License:
|
||||||
|
* 1. You are free to use this program and/or to redistribute
|
||||||
|
* this program.
|
||||||
|
* 2. You are free to modify this program for your own use,
|
||||||
|
* including commercial use, subject to the publication
|
||||||
|
* restrictions in item 3.
|
||||||
|
* 3. You are free to publish results obtained from running this
|
||||||
|
* program, or from works that you derive from this program,
|
||||||
|
* with the following limitations:
|
||||||
|
* 3a. In order to be referred to as "STREAM benchmark results",
|
||||||
|
* published results must be in conformance to the STREAM
|
||||||
|
* Run Rules, (briefly reviewed below) published at
|
||||||
|
* http://www.cs.virginia.edu/stream/ref.html
|
||||||
|
* and incorporated herein by reference.
|
||||||
|
* As the copyright holder, John McCalpin retains the
|
||||||
|
* right to determine conformity with the Run Rules.
|
||||||
|
* 3b. Results based on modified source code or on runs not in
|
||||||
|
* accordance with the STREAM Run Rules must be clearly
|
||||||
|
* labelled whenever they are published. Examples of
|
||||||
|
* proper labelling include:
|
||||||
|
* "tuned STREAM benchmark results"
|
||||||
|
* "based on a variant of the STREAM benchmark code"
|
||||||
|
* Other comparable, clear and reasonable labelling is
|
||||||
|
* acceptable.
|
||||||
|
* 3c. Submission of results to the STREAM benchmark web site
|
||||||
|
* is encouraged, but not required.
|
||||||
|
* 4. Use of this program or creation of derived works based on this
|
||||||
|
* program constitutes acceptance of these licensing restrictions.
|
||||||
|
* 5. Absolutely no warranty is expressed or implied.
|
||||||
|
*-----------------------------------------------------------------------
|
||||||
|
* This program measures sustained memory transfer rates in MB/s for
|
||||||
|
* simple computational kernels coded in FORTRAN.
|
||||||
|
*
|
||||||
|
* The intent is to demonstrate the extent to which ordinary user
|
||||||
|
* code can exploit the main memory bandwidth of the system under
|
||||||
|
* test.
|
||||||
|
*=======================================================================
|
||||||
|
* The STREAM web page is at:
|
||||||
|
* http://www.streambench.org
|
||||||
|
*
|
||||||
|
* Most of the content is currently hosted at:
|
||||||
|
* http://www.cs.virginia.edu/stream/
|
||||||
|
*
|
||||||
|
* BRIEF INSTRUCTIONS:
|
||||||
|
* 0) See http://www.cs.virginia.edu/stream/ref.html for details
|
||||||
|
* 1) STREAM requires a timing function called mysecond().
|
||||||
|
* Several examples are provided in this directory.
|
||||||
|
* "CPU" timers are only allowed for uniprocessor runs.
|
||||||
|
* "Wall-clock" timers are required for all multiprocessor runs.
|
||||||
|
* 2) The STREAM array sizes must be set to size the test.
|
||||||
|
* The value "N" must be chosen so that each of the three
|
||||||
|
* arrays is at least 4x larger than the sum of all the last-
|
||||||
|
* level caches used in the run, or 1 million elements, which-
|
||||||
|
* ever is larger.
|
||||||
|
* ------------------------------------------------------------
|
||||||
|
* Note that you are free to use any array length and offset
|
||||||
|
* that makes each array 4x larger than the last-level cache.
|
||||||
|
* The intent is to determine the *best* sustainable bandwidth
|
||||||
|
* available with this simple coding. Of course, lower values
|
||||||
|
* are usually fairly easy to obtain on cached machines, but
|
||||||
|
* by keeping the test to the *best* results, the answers are
|
||||||
|
* easier to interpret.
|
||||||
|
* You may put the arrays in common or not, at your discretion.
|
||||||
|
* There is a commented-out COMMON statement below.
|
||||||
|
* Fortran90 "allocatable" arrays are fine, too.
|
||||||
|
* ------------------------------------------------------------
|
||||||
|
* 3) Compile the code with full optimization. Many compilers
|
||||||
|
* generate unreasonably bad code before the optimizer tightens
|
||||||
|
* things up. If the results are unreasonably good, on the
|
||||||
|
* other hand, the optimizer might be too smart for me
|
||||||
|
* Please let me know if this happens.
|
||||||
|
* 4) Mail the results to mccalpin@cs.virginia.edu
|
||||||
|
* Be sure to include:
|
||||||
|
* a) computer hardware model number and software revision
|
||||||
|
* b) the compiler flags
|
||||||
|
* c) all of the output from the test case.
|
||||||
|
* Please let me know if you do not want your name posted along
|
||||||
|
* with the submitted results.
|
||||||
|
* 5) See the web page for more comments about the run rules and
|
||||||
|
* about interpretation of the results.
|
||||||
|
*
|
||||||
|
* Thanks,
|
||||||
|
* Dr. Bandwidth
|
||||||
|
*=========================================================================
|
||||||
|
*
|
||||||
|
PROGRAM stream
|
||||||
|
* IMPLICIT NONE
|
||||||
|
C .. Parameters ..
|
||||||
|
INTEGER n,offset,ndim,ntimes
|
||||||
|
PARAMETER (n=2000000,offset=0,ndim=n+offset,ntimes=10)
|
||||||
|
C ..
|
||||||
|
C .. Local Scalars ..
|
||||||
|
DOUBLE PRECISION scalar,t
|
||||||
|
INTEGER j,k,nbpw,quantum
|
||||||
|
C ..
|
||||||
|
C .. Local Arrays ..
|
||||||
|
DOUBLE PRECISION maxtime(4),mintime(4),avgtime(4),
|
||||||
|
$ times(4,ntimes)
|
||||||
|
INTEGER bytes(4)
|
||||||
|
CHARACTER label(4)*11
|
||||||
|
C ..
|
||||||
|
C .. External Functions ..
|
||||||
|
DOUBLE PRECISION mysecond
|
||||||
|
INTEGER checktick,realsize
|
||||||
|
EXTERNAL mysecond,checktick,realsize
|
||||||
|
!$ INTEGER omp_get_num_threads
|
||||||
|
!$ EXTERNAL omp_get_num_threads
|
||||||
|
C ..
|
||||||
|
C .. Intrinsic Functions ..
|
||||||
|
C
|
||||||
|
INTRINSIC dble,max,min,nint,sqrt
|
||||||
|
C ..
|
||||||
|
C .. Arrays in Common ..
|
||||||
|
DOUBLE PRECISION a(ndim),b(ndim),c(ndim)
|
||||||
|
C ..
|
||||||
|
C .. Common blocks ..
|
||||||
|
* COMMON a,b,c
|
||||||
|
C ..
|
||||||
|
C .. Data statements ..
|
||||||
|
DATA avgtime/4*0.0D0/,mintime/4*1.0D+36/,maxtime/4*0.0D0/
|
||||||
|
DATA label/'Copy: ','Scale: ','Add: ',
|
||||||
|
$ 'Triad: '/
|
||||||
|
DATA bytes/2,2,3,3/
|
||||||
|
C ..
|
||||||
|
|
||||||
|
* --- SETUP --- determine precision and check timing ---
|
||||||
|
|
||||||
|
nbpw = realsize()
|
||||||
|
|
||||||
|
PRINT *,'----------------------------------------------'
|
||||||
|
PRINT *,'STREAM Version $Revision: 5.6 $'
|
||||||
|
PRINT *,'----------------------------------------------'
|
||||||
|
WRITE (*,FMT=9010) 'Array size = ',n
|
||||||
|
WRITE (*,FMT=9010) 'Offset = ',offset
|
||||||
|
WRITE (*,FMT=9020) 'The total memory requirement is ',
|
||||||
|
$ 3*nbpw*n/ (1024*1024),' MB'
|
||||||
|
WRITE (*,FMT=9030) 'You are running each test ',ntimes,' times'
|
||||||
|
WRITE (*,FMT=9030) '--'
|
||||||
|
WRITE (*,FMT=9030) 'The *best* time for each test is used'
|
||||||
|
WRITE (*,FMT=9030) '*EXCLUDING* the first and last iterations'
|
||||||
|
|
||||||
|
!$OMP PARALLEL
|
||||||
|
!$OMP MASTER
|
||||||
|
PRINT *,'----------------------------------------------'
|
||||||
|
!$ PRINT *,'Number of Threads = ',OMP_GET_NUM_THREADS()
|
||||||
|
!$OMP END MASTER
|
||||||
|
!$OMP END PARALLEL
|
||||||
|
|
||||||
|
PRINT *,'----------------------------------------------'
|
||||||
|
!$OMP PARALLEL
|
||||||
|
PRINT *,'Printing one line per active thread....'
|
||||||
|
!$OMP END PARALLEL
|
||||||
|
|
||||||
|
!$OMP PARALLEL DO
|
||||||
|
DO 10 j = 1,n
|
||||||
|
a(j) = 2.0d0
|
||||||
|
b(j) = 0.5D0
|
||||||
|
c(j) = 0.0D0
|
||||||
|
10 CONTINUE
|
||||||
|
t = mysecond()
|
||||||
|
!$OMP PARALLEL DO
|
||||||
|
DO 20 j = 1,n
|
||||||
|
a(j) = 0.5d0*a(j)
|
||||||
|
20 CONTINUE
|
||||||
|
t = mysecond() - t
|
||||||
|
PRINT *,'----------------------------------------------------'
|
||||||
|
quantum = checktick()
|
||||||
|
WRITE (*,FMT=9000)
|
||||||
|
$ 'Your clock granularity/precision appears to be ',quantum,
|
||||||
|
$ ' microseconds'
|
||||||
|
PRINT *,'----------------------------------------------------'
|
||||||
|
|
||||||
|
* --- MAIN LOOP --- repeat test cases NTIMES times ---
|
||||||
|
scalar = 0.5d0*a(1)
|
||||||
|
DO 70 k = 1,ntimes
|
||||||
|
|
||||||
|
t = mysecond()
|
||||||
|
a(1) = a(1) + t
|
||||||
|
!$OMP PARALLEL DO
|
||||||
|
DO 30 j = 1,n
|
||||||
|
c(j) = a(j)
|
||||||
|
30 CONTINUE
|
||||||
|
t = mysecond() - t
|
||||||
|
c(n) = c(n) + t
|
||||||
|
times(1,k) = t
|
||||||
|
|
||||||
|
t = mysecond()
|
||||||
|
c(1) = c(1) + t
|
||||||
|
!$OMP PARALLEL DO
|
||||||
|
DO 40 j = 1,n
|
||||||
|
b(j) = scalar*c(j)
|
||||||
|
40 CONTINUE
|
||||||
|
t = mysecond() - t
|
||||||
|
b(n) = b(n) + t
|
||||||
|
times(2,k) = t
|
||||||
|
|
||||||
|
t = mysecond()
|
||||||
|
a(1) = a(1) + t
|
||||||
|
!$OMP PARALLEL DO
|
||||||
|
DO 50 j = 1,n
|
||||||
|
c(j) = a(j) + b(j)
|
||||||
|
50 CONTINUE
|
||||||
|
t = mysecond() - t
|
||||||
|
c(n) = c(n) + t
|
||||||
|
times(3,k) = t
|
||||||
|
|
||||||
|
t = mysecond()
|
||||||
|
b(1) = b(1) + t
|
||||||
|
!$OMP PARALLEL DO
|
||||||
|
DO 60 j = 1,n
|
||||||
|
a(j) = b(j) + scalar*c(j)
|
||||||
|
60 CONTINUE
|
||||||
|
t = mysecond() - t
|
||||||
|
a(n) = a(n) + t
|
||||||
|
times(4,k) = t
|
||||||
|
70 CONTINUE
|
||||||
|
|
||||||
|
* --- SUMMARY ---
|
||||||
|
DO 90 k = 2,ntimes
|
||||||
|
DO 80 j = 1,4
|
||||||
|
avgtime(j) = avgtime(j) + times(j,k)
|
||||||
|
mintime(j) = min(mintime(j),times(j,k))
|
||||||
|
maxtime(j) = max(maxtime(j),times(j,k))
|
||||||
|
80 CONTINUE
|
||||||
|
90 CONTINUE
|
||||||
|
WRITE (*,FMT=9040)
|
||||||
|
DO 100 j = 1,4
|
||||||
|
avgtime(j) = avgtime(j)/dble(ntimes-1)
|
||||||
|
WRITE (*,FMT=9050) label(j),n*bytes(j)*nbpw/mintime(j)/1.0D6,
|
||||||
|
$ avgtime(j),mintime(j),maxtime(j)
|
||||||
|
100 CONTINUE
|
||||||
|
PRINT *,'----------------------------------------------------'
|
||||||
|
CALL checksums (a,b,c,n,ntimes)
|
||||||
|
PRINT *,'----------------------------------------------------'
|
||||||
|
|
||||||
|
9000 FORMAT (1x,a,i6,a)
|
||||||
|
9010 FORMAT (1x,a,i10)
|
||||||
|
9020 FORMAT (1x,a,i4,a)
|
||||||
|
9030 FORMAT (1x,a,i3,a,a)
|
||||||
|
9040 FORMAT ('Function',5x,'Rate (MB/s) Avg time Min time Max time'
|
||||||
|
$ )
|
||||||
|
9050 FORMAT (a,4 (f10.4,2x))
|
||||||
|
END
|
||||||
|
|
||||||
|
*-------------------------------------
|
||||||
|
* INTEGER FUNCTION dblesize()
|
||||||
|
*
|
||||||
|
* A semi-portable way to determine the precision of DOUBLE PRECISION
|
||||||
|
* in Fortran.
|
||||||
|
* Here used to guess how many bytes of storage a DOUBLE PRECISION
|
||||||
|
* number occupies.
|
||||||
|
*
|
||||||
|
INTEGER FUNCTION realsize()
|
||||||
|
* IMPLICIT NONE
|
||||||
|
|
||||||
|
C .. Local Scalars ..
|
||||||
|
DOUBLE PRECISION result,test
|
||||||
|
INTEGER j,ndigits
|
||||||
|
C ..
|
||||||
|
C .. Local Arrays ..
|
||||||
|
DOUBLE PRECISION ref(30)
|
||||||
|
C ..
|
||||||
|
C .. External Subroutines ..
|
||||||
|
EXTERNAL confuse
|
||||||
|
C ..
|
||||||
|
C .. Intrinsic Functions ..
|
||||||
|
INTRINSIC abs,acos,log10,sqrt
|
||||||
|
C ..
|
||||||
|
|
||||||
|
C Test #1 - compare single(1.0d0+delta) to 1.0d0
|
||||||
|
|
||||||
|
10 DO 20 j = 1,30
|
||||||
|
ref(j) = 1.0d0 + 10.0d0** (-j)
|
||||||
|
20 CONTINUE
|
||||||
|
|
||||||
|
DO 30 j = 1,30
|
||||||
|
test = ref(j)
|
||||||
|
ndigits = j
|
||||||
|
CALL confuse(test,result)
|
||||||
|
IF (test.EQ.1.0D0) THEN
|
||||||
|
GO TO 40
|
||||||
|
END IF
|
||||||
|
30 CONTINUE
|
||||||
|
GO TO 50
|
||||||
|
|
||||||
|
40 WRITE (*,FMT='(a)')
|
||||||
|
$ '----------------------------------------------'
|
||||||
|
WRITE (*,FMT='(1x,a,i2,a)') 'Double precision appears to have ',
|
||||||
|
$ ndigits,' digits of accuracy'
|
||||||
|
IF (ndigits.LE.8) THEN
|
||||||
|
realsize = 4
|
||||||
|
ELSE
|
||||||
|
realsize = 8
|
||||||
|
END IF
|
||||||
|
WRITE (*,FMT='(1x,a,i1,a)') 'Assuming ',realsize,
|
||||||
|
$ ' bytes per DOUBLE PRECISION word'
|
||||||
|
WRITE (*,FMT='(a)')
|
||||||
|
$ '----------------------------------------------'
|
||||||
|
RETURN
|
||||||
|
|
||||||
|
50 PRINT *,'Hmmmm. I am unable to determine the size.'
|
||||||
|
PRINT *,'Please enter the number of Bytes per DOUBLE PRECISION',
|
||||||
|
$ ' number : '
|
||||||
|
READ (*,FMT=*) realsize
|
||||||
|
IF (realsize.NE.4 .AND. realsize.NE.8) THEN
|
||||||
|
PRINT *,'Your answer ',realsize,' does not make sense.'
|
||||||
|
PRINT *,'Try again.'
|
||||||
|
PRINT *,'Please enter the number of Bytes per ',
|
||||||
|
$ 'DOUBLE PRECISION number : '
|
||||||
|
READ (*,FMT=*) realsize
|
||||||
|
END IF
|
||||||
|
PRINT *,'You have manually entered a size of ',realsize,
|
||||||
|
$ ' bytes per DOUBLE PRECISION number'
|
||||||
|
WRITE (*,FMT='(a)')
|
||||||
|
$ '----------------------------------------------'
|
||||||
|
END
|
||||||
|
|
||||||
|
SUBROUTINE confuse(q,r)
|
||||||
|
* IMPLICIT NONE
|
||||||
|
C .. Scalar Arguments ..
|
||||||
|
DOUBLE PRECISION q,r
|
||||||
|
C ..
|
||||||
|
C .. Intrinsic Functions ..
|
||||||
|
INTRINSIC cos
|
||||||
|
C ..
|
||||||
|
r = cos(q)
|
||||||
|
RETURN
|
||||||
|
END
|
||||||
|
|
||||||
|
* A semi-portable way to determine the clock granularity
|
||||||
|
* Adapted from a code by John Henning of Digital Equipment Corporation
|
||||||
|
*
|
||||||
|
INTEGER FUNCTION checktick()
|
||||||
|
* IMPLICIT NONE
|
||||||
|
|
||||||
|
C .. Parameters ..
|
||||||
|
INTEGER n
|
||||||
|
PARAMETER (n=20)
|
||||||
|
C ..
|
||||||
|
C .. Local Scalars ..
|
||||||
|
DOUBLE PRECISION t1,t2
|
||||||
|
INTEGER i,j,jmin
|
||||||
|
C ..
|
||||||
|
C .. Local Arrays ..
|
||||||
|
DOUBLE PRECISION timesfound(n)
|
||||||
|
C ..
|
||||||
|
C .. External Functions ..
|
||||||
|
DOUBLE PRECISION mysecond
|
||||||
|
EXTERNAL mysecond
|
||||||
|
C ..
|
||||||
|
C .. Intrinsic Functions ..
|
||||||
|
INTRINSIC max,min,nint
|
||||||
|
C ..
|
||||||
|
i = 0
|
||||||
|
|
||||||
|
10 t2 = mysecond()
|
||||||
|
IF (t2.EQ.t1) GO TO 10
|
||||||
|
|
||||||
|
t1 = t2
|
||||||
|
i = i + 1
|
||||||
|
timesfound(i) = t1
|
||||||
|
IF (i.LT.n) GO TO 10
|
||||||
|
|
||||||
|
jmin = 1000000
|
||||||
|
DO 20 i = 2,n
|
||||||
|
j = nint((timesfound(i)-timesfound(i-1))*1d6)
|
||||||
|
jmin = min(jmin,max(j,0))
|
||||||
|
20 CONTINUE
|
||||||
|
|
||||||
|
IF (jmin.GT.0) THEN
|
||||||
|
checktick = jmin
|
||||||
|
ELSE
|
||||||
|
PRINT *,'Your clock granularity appears to be less ',
|
||||||
|
$ 'than one microsecond'
|
||||||
|
checktick = 1
|
||||||
|
END IF
|
||||||
|
RETURN
|
||||||
|
|
||||||
|
* PRINT 14, timesfound(1)*1d6
|
||||||
|
* DO 20 i=2,n
|
||||||
|
* PRINT 14, timesfound(i)*1d6,
|
||||||
|
* & nint((timesfound(i)-timesfound(i-1))*1d6)
|
||||||
|
* 14 FORMAT (1X, F18.4, 1X, i8)
|
||||||
|
* 20 CONTINUE
|
||||||
|
|
||||||
|
END
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
SUBROUTINE checksums(a,b,c,n,ntimes)
|
||||||
|
* IMPLICIT NONE
|
||||||
|
C ..
|
||||||
|
C .. Arguments ..
|
||||||
|
DOUBLE PRECISION a(*),b(*),c(*)
|
||||||
|
INTEGER n,ntimes
|
||||||
|
C ..
|
||||||
|
C .. Local Scalars ..
|
||||||
|
DOUBLE PRECISION aa,bb,cc,scalar,suma,sumb,sumc,epsilon
|
||||||
|
INTEGER k
|
||||||
|
C ..
|
||||||
|
|
||||||
|
C Repeat the main loop, but with scalars only.
|
||||||
|
C This is done to check the sum & make sure all
|
||||||
|
C iterations have been executed correctly.
|
||||||
|
|
||||||
|
aa = 2.0D0
|
||||||
|
bb = 0.5D0
|
||||||
|
cc = 0.0D0
|
||||||
|
aa = 0.5D0*aa
|
||||||
|
scalar = 0.5d0*aa
|
||||||
|
DO k = 1,ntimes
|
||||||
|
cc = aa
|
||||||
|
bb = scalar*cc
|
||||||
|
cc = aa + bb
|
||||||
|
aa = bb + scalar*cc
|
||||||
|
END DO
|
||||||
|
aa = aa*DBLE(n-2)
|
||||||
|
bb = bb*DBLE(n-2)
|
||||||
|
cc = cc*DBLE(n-2)
|
||||||
|
|
||||||
|
C Now sum up the arrays, excluding the first and last
|
||||||
|
C elements, which are modified using the timing results
|
||||||
|
C to confuse aggressive optimizers.
|
||||||
|
|
||||||
|
suma = 0.0d0
|
||||||
|
sumb = 0.0d0
|
||||||
|
sumc = 0.0d0
|
||||||
|
!$OMP PARALLEL DO REDUCTION(+:suma,sumb,sumc)
|
||||||
|
DO 110 j = 2,n-1
|
||||||
|
suma = suma + a(j)
|
||||||
|
sumb = sumb + b(j)
|
||||||
|
sumc = sumc + c(j)
|
||||||
|
110 CONTINUE
|
||||||
|
|
||||||
|
epsilon = 1.D-6
|
||||||
|
|
||||||
|
IF (ABS(suma-aa)/suma .GT. epsilon) THEN
|
||||||
|
PRINT *,'Failed Validation on array a()'
|
||||||
|
PRINT *,'Target Sum of a is = ',aa
|
||||||
|
PRINT *,'Computed Sum of a is = ',suma
|
||||||
|
ELSEIF (ABS(sumb-bb)/sumb .GT. epsilon) THEN
|
||||||
|
PRINT *,'Failed Validation on array b()'
|
||||||
|
PRINT *,'Target Sum of b is = ',bb
|
||||||
|
PRINT *,'Computed Sum of b is = ',sumb
|
||||||
|
ELSEIF (ABS(sumc-cc)/sumc .GT. epsilon) THEN
|
||||||
|
PRINT *,'Failed Validation on array c()'
|
||||||
|
PRINT *,'Target Sum of c is = ',cc
|
||||||
|
PRINT *,'Computed Sum of c is = ',sumc
|
||||||
|
ELSE
|
||||||
|
PRINT *,'Solution Validates!'
|
||||||
|
ENDIF
|
||||||
|
|
||||||
|
END
|
||||||
|
|
||||||
0
sheet3/1/stream.f:Zone.Identifier
Normal file
0
sheet3/1/stream.f:Zone.Identifier
Normal file
17
sheet3/2.txt
Normal file
17
sheet3/2.txt
Normal file
|
|
@ -0,0 +1,17 @@
|
||||||
|
Memory needed
|
||||||
|
A) 2Vectors + Result: (2N+1)*sizeof(datatype)
|
||||||
|
B) Matrix + Vector + Resultvector: (N*M+N+M)*sizeof(datatype)
|
||||||
|
C) Matrix + Matrix + Resultmatrix: (M*L+L*N+M*N)*sizeof(datatype)
|
||||||
|
D) Coefficients + Vector + Result: (p+1+2N)*sizeof(datatype)
|
||||||
|
|
||||||
|
Number of floating point operations
|
||||||
|
A) N mult N add =>2*N
|
||||||
|
B) M times skalar prod => 2*M*N
|
||||||
|
C) (Matrix vector product of M*L Matrix with an L Vector) N times => 2*M*N*L
|
||||||
|
D) N times(p times * and p times +/- [with Horner's method]) => 2*N*p
|
||||||
|
|
||||||
|
Number of Read/Write operations
|
||||||
|
A) Read: 2*N Write: 1
|
||||||
|
B) Read: 2*M*N Write: M
|
||||||
|
C) Read: 2*M*N*L Write: M*N
|
||||||
|
D) Read: N*p Write: N
|
||||||
6
sheet3/345/.vscode/settings.json
vendored
Normal file
6
sheet3/345/.vscode/settings.json
vendored
Normal file
|
|
@ -0,0 +1,6 @@
|
||||||
|
{
|
||||||
|
"files.associations": {
|
||||||
|
"ostream": "cpp",
|
||||||
|
"iostream": "cpp"
|
||||||
|
}
|
||||||
|
}
|
||||||
2563
sheet3/345/Doxyfile
Normal file
2563
sheet3/345/Doxyfile
Normal file
File diff suppressed because it is too large
Load diff
0
sheet3/345/Doxyfile:Zone.Identifier
Normal file
0
sheet3/345/Doxyfile:Zone.Identifier
Normal file
30
sheet3/345/Makefile
Normal file
30
sheet3/345/Makefile
Normal file
|
|
@ -0,0 +1,30 @@
|
||||||
|
#
|
||||||
|
# use GNU-Compiler tools
|
||||||
|
COMPILER=GCC_
|
||||||
|
# alternatively from the shell
|
||||||
|
# export COMPILER=GCC_
|
||||||
|
# or, alternatively from the shell
|
||||||
|
# make COMPILER=GCC_
|
||||||
|
|
||||||
|
# use Intel compilers
|
||||||
|
#COMPILER=ICC_
|
||||||
|
|
||||||
|
# use PGI compilers
|
||||||
|
# COMPILER=PGI_
|
||||||
|
|
||||||
|
|
||||||
|
SOURCES = main.cpp mylib.cpp benchmark.cpp
|
||||||
|
OBJECTS = $(SOURCES:.cpp=.o)
|
||||||
|
|
||||||
|
PROGRAM = main.${COMPILER}
|
||||||
|
|
||||||
|
# uncomment the next to lines for debugging and detailed performance analysis
|
||||||
|
CXXFLAGS += -g
|
||||||
|
LINKFLAGS += -g
|
||||||
|
# do not use -pg with PGI compilers
|
||||||
|
|
||||||
|
ifndef COMPILER
|
||||||
|
COMPILER=GCC_
|
||||||
|
endif
|
||||||
|
|
||||||
|
include ../${COMPILER}default.mk
|
||||||
0
sheet3/345/Makefile:Zone.Identifier
Normal file
0
sheet3/345/Makefile:Zone.Identifier
Normal file
127
sheet3/345/benchmark.cpp
Normal file
127
sheet3/345/benchmark.cpp
Normal file
|
|
@ -0,0 +1,127 @@
|
||||||
|
#include <iostream>
|
||||||
|
#include <vector>
|
||||||
|
#include <cmath>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
|
||||||
|
// Inner product
|
||||||
|
double benchmark_A(const vector<double> &x, const vector<double> &y)
|
||||||
|
{
|
||||||
|
double sum = 0.0;
|
||||||
|
for (unsigned int i = 0; i < x.size(); i++)
|
||||||
|
{
|
||||||
|
sum += x[i]*y[i];
|
||||||
|
}
|
||||||
|
return sum;
|
||||||
|
}
|
||||||
|
|
||||||
|
//Matrix-vector product
|
||||||
|
vector<double> benchmark_B(const vector<double> &A, const vector<double> &x)
|
||||||
|
{
|
||||||
|
unsigned int N = x.size();
|
||||||
|
unsigned int M = A.size() / N;
|
||||||
|
vector<double> b(M, 0.0);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < M; i++)
|
||||||
|
{
|
||||||
|
double bi = 0.0;
|
||||||
|
for (unsigned int j = 0; j < N; j++)
|
||||||
|
{
|
||||||
|
bi += A[i*N+j]*x[j];
|
||||||
|
}
|
||||||
|
b[i] = bi;
|
||||||
|
}
|
||||||
|
|
||||||
|
return b;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//Matrix-Matrix product
|
||||||
|
vector<double> benchmark_C(const vector<double> &A, const vector<double> &B, unsigned int M)
|
||||||
|
{
|
||||||
|
unsigned int L = A.size()/M;
|
||||||
|
unsigned int N = B.size()/L;
|
||||||
|
vector<double> C(M*N,0.0);
|
||||||
|
for (unsigned int i = 0; i < M; i++)
|
||||||
|
{
|
||||||
|
for (unsigned int j = 0; j < N; j++)
|
||||||
|
{
|
||||||
|
double sum = 0.0;
|
||||||
|
for (unsigned int k = 0; k < L; k++)
|
||||||
|
{
|
||||||
|
sum += A[i*L+k]*B[k*N+j];
|
||||||
|
}
|
||||||
|
C[i*N+j] = sum;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return C;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
//polynomial evaluation
|
||||||
|
vector<double> benchmark_D(const vector<double>& coeff, const vector<double>& x)
|
||||||
|
{
|
||||||
|
unsigned int p = coeff.size(); // p coefficients, degree p-1
|
||||||
|
unsigned int N = x.size();
|
||||||
|
vector<double> y(N);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < N; i++){
|
||||||
|
double yi = coeff[p-1];
|
||||||
|
double xi = x[i];
|
||||||
|
for(int j=p-2; j>=0; --j)
|
||||||
|
{
|
||||||
|
yi = yi*xi+coeff[j];
|
||||||
|
}
|
||||||
|
y[i] = yi;
|
||||||
|
}
|
||||||
|
return y;
|
||||||
|
}
|
||||||
|
|
||||||
|
//TASK 5
|
||||||
|
double norm2(const vector<double>& x)
|
||||||
|
{
|
||||||
|
double s = 0.0;
|
||||||
|
for (unsigned int i = 0; i < x.size(); ++i)
|
||||||
|
s += x[i]*x[i];
|
||||||
|
return sqrt(s);
|
||||||
|
}
|
||||||
|
|
||||||
|
double scalar_kahan(const vector<double>& x, const vector<double>& y)
|
||||||
|
{
|
||||||
|
double sum = 0.0;
|
||||||
|
double c = 0.0;
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < x.size(); i++)
|
||||||
|
{
|
||||||
|
double prod = x[i]*y[i];
|
||||||
|
double yk = prod - c;
|
||||||
|
double t = sum+yk;
|
||||||
|
c= (t - sum) - yk;
|
||||||
|
sum = t;
|
||||||
|
}
|
||||||
|
return sum;
|
||||||
|
}
|
||||||
|
|
||||||
|
//Matrix-Matrix product
|
||||||
|
vector<double> matrixMultColumnWise(const vector<double> &A, const vector<double> &B, unsigned int M)
|
||||||
|
{
|
||||||
|
unsigned int L = A.size()/M;
|
||||||
|
unsigned int N = B.size()/L;
|
||||||
|
vector<double> C(M*N,0.0);
|
||||||
|
for (unsigned int i = 0; i < M; i++)
|
||||||
|
{
|
||||||
|
for (unsigned int j = 0; j < N; j++)
|
||||||
|
{
|
||||||
|
double sum = 0.0;
|
||||||
|
for (unsigned int k = 0; k < L; k++)
|
||||||
|
{
|
||||||
|
sum += A[k*L+i]*B[k*N+j];
|
||||||
|
}
|
||||||
|
C[i*N+j] = sum;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return C;
|
||||||
|
|
||||||
|
}
|
||||||
29
sheet3/345/benchmark.h
Normal file
29
sheet3/345/benchmark.h
Normal file
|
|
@ -0,0 +1,29 @@
|
||||||
|
#ifndef BENCHMARK_H
|
||||||
|
#define BENCHMARK_H
|
||||||
|
|
||||||
|
#include <vector>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
double benchmark_A(const vector<double> &x,
|
||||||
|
const vector<double> &y);
|
||||||
|
|
||||||
|
vector<double> benchmark_B(const vector<double> &A,
|
||||||
|
const vector<double> &x);
|
||||||
|
|
||||||
|
vector<double> benchmark_C(const vector<double> &A,
|
||||||
|
const vector<double> &B,
|
||||||
|
unsigned int M);
|
||||||
|
|
||||||
|
vector<double> benchmark_D(const vector<double> &coefficients,
|
||||||
|
const vector<double> &x);
|
||||||
|
|
||||||
|
|
||||||
|
double norm2(const vector<double>& x);
|
||||||
|
double scalar_kahan(const vector<double>& x, const vector<double>& y);
|
||||||
|
|
||||||
|
vector<double> matrixMultColumnWise(const vector<double> &A,
|
||||||
|
const vector<double> &B,
|
||||||
|
unsigned int M);
|
||||||
|
|
||||||
|
|
||||||
|
#endif
|
||||||
BIN
sheet3/345/main
Executable file
BIN
sheet3/345/main
Executable file
Binary file not shown.
286
sheet3/345/main.cpp
Normal file
286
sheet3/345/main.cpp
Normal file
|
|
@ -0,0 +1,286 @@
|
||||||
|
#include "mylib.h"
|
||||||
|
#include <cassert>
|
||||||
|
#include <chrono> // timing
|
||||||
|
#include <cmath> // sqrt()
|
||||||
|
#include <cstdlib> // atoi()
|
||||||
|
#include <cstring> // strncmp()
|
||||||
|
#include <ctime>
|
||||||
|
#include <iostream>
|
||||||
|
#include <sstream>
|
||||||
|
#include "benchmark.h"
|
||||||
|
using namespace std;
|
||||||
|
using namespace std::chrono; // timing
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
const unsigned int NA = 1400000;
|
||||||
|
const unsigned int NLOOPSA = 2000;
|
||||||
|
//const unsigned int NLOOPS = 10;
|
||||||
|
|
||||||
|
const unsigned int MC = 1000;
|
||||||
|
int const NLOOPSC = 5;
|
||||||
|
// ---------- Benchmark A ----------
|
||||||
|
|
||||||
|
{
|
||||||
|
|
||||||
|
|
||||||
|
vector<double> xA(NA), yA(NA);
|
||||||
|
for (unsigned int i = 0; i < NA; ++i)
|
||||||
|
{
|
||||||
|
double xi= (i % 219) + 1;
|
||||||
|
xA[i] = xi;
|
||||||
|
yA[i] = 1.0 / xi;
|
||||||
|
}
|
||||||
|
|
||||||
|
auto tA1 = system_clock::now();
|
||||||
|
double sA = 0.0, sumA = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSA; ++loop)
|
||||||
|
{
|
||||||
|
sA = benchmark_A(xA, yA);
|
||||||
|
sumA += sA;
|
||||||
|
}
|
||||||
|
auto tA2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durA = duration_cast<microseconds>(tA2 - tA1);
|
||||||
|
double tA = static_cast<double>(durA.count()) / 1e6 / NLOOPSA; //duration per loop seconds
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark A =====\n";
|
||||||
|
cout << "<xA,yA> = " << sA << endl;
|
||||||
|
cout << "Timing in sec. : " << tA << endl;
|
||||||
|
cout << "GFLOPS : " << 2.0 * NA / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : "
|
||||||
|
<< 2.0 * NA * sizeof(xA[0]) / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ---------- Benchmark B----------
|
||||||
|
|
||||||
|
{
|
||||||
|
const unsigned int MB = 1700;
|
||||||
|
const unsigned int NB = MB;
|
||||||
|
const unsigned int NLOOPSB = 200;//50;
|
||||||
|
|
||||||
|
vector<double> AB(MB * NB);
|
||||||
|
vector<double> xB(NB);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < MB; ++i)
|
||||||
|
for (unsigned int j = 0; j < NB; ++j)
|
||||||
|
AB[i * NB + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
for (unsigned int j = 0; j < NB; ++j)
|
||||||
|
{
|
||||||
|
|
||||||
|
xB[j] = 1.0 / AB[17*NB+j];
|
||||||
|
}
|
||||||
|
|
||||||
|
vector<double> bB;
|
||||||
|
auto tB1 = system_clock::now();
|
||||||
|
double guardB = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSB; ++loop)
|
||||||
|
{
|
||||||
|
bB = benchmark_B(AB, xB);
|
||||||
|
guardB += bB[17];
|
||||||
|
}
|
||||||
|
auto tB2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durB = duration_cast<microseconds>(tB2 - tB1);
|
||||||
|
double tB = static_cast<double>(durB.count()) / 1e6 / NLOOPSB;
|
||||||
|
|
||||||
|
double flopsB = 2.0 * MB * NB;
|
||||||
|
double bytesB = (MB * NB + NB + MB) * sizeof(double);
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark B =====\n";
|
||||||
|
cout << guardB << endl;
|
||||||
|
cout << "bytes: " << bytesB << endl;
|
||||||
|
cout << "Timing in sec. : " << tB << endl;
|
||||||
|
cout << "GFLOPS : " << flopsB / tB / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : " << bytesB / tB / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ---------- Benchmark C ----------
|
||||||
|
|
||||||
|
{
|
||||||
|
|
||||||
|
const unsigned int LC = MC;
|
||||||
|
const unsigned int NC = MC;
|
||||||
|
|
||||||
|
|
||||||
|
vector<double> AC(MC * LC), BC(LC * NC);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < MC; ++i)
|
||||||
|
for (unsigned int j = 0; j < LC; ++j)
|
||||||
|
AC[i * LC + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < LC; ++i)
|
||||||
|
for (unsigned int j = 0; j < NC; ++j)
|
||||||
|
BC[i * NC + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
vector<double> CC;
|
||||||
|
auto tC1 = system_clock::now();
|
||||||
|
double guardC = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSC; ++loop)
|
||||||
|
{
|
||||||
|
CC = benchmark_C(AC, BC, MC);
|
||||||
|
guardC += CC[0];
|
||||||
|
}
|
||||||
|
auto tC2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durC = duration_cast<microseconds>(tC2 - tC1);
|
||||||
|
double tC = static_cast<double>(durC.count()) / 1e6 / NLOOPSC;
|
||||||
|
|
||||||
|
double flopsC = 2.0 * MC * LC * NC;
|
||||||
|
double bytesC = (MC * LC + LC * NC + MC * NC)* sizeof(double);
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark C =====\n";
|
||||||
|
cout << "bytes: " << bytesC << endl;
|
||||||
|
cout << "Timing in sec. : " << tC << endl;
|
||||||
|
cout << "GFLOPS : " << flopsC / tC / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : " << bytesC / tC / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ---------- Benchmark D----------
|
||||||
|
|
||||||
|
|
||||||
|
{
|
||||||
|
const unsigned int ND = 2000000;
|
||||||
|
const unsigned int p = 14; // degree p-1 = 15
|
||||||
|
const unsigned int NLOOPSD = 100;
|
||||||
|
vector<double> coeff(p, 0.0);
|
||||||
|
vector<double> xD(ND);
|
||||||
|
|
||||||
|
for (unsigned int k = 0; k < p; ++k)
|
||||||
|
coeff[k] = k%219+1;
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < ND; ++i)
|
||||||
|
xD[i] = i%219+1;
|
||||||
|
|
||||||
|
vector<double> yD;
|
||||||
|
auto tD1 = system_clock::now();
|
||||||
|
double guardD = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSD; ++loop)
|
||||||
|
{
|
||||||
|
|
||||||
|
yD = benchmark_D(coeff, xD);
|
||||||
|
guardD += yD[0];
|
||||||
|
}
|
||||||
|
auto tD2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durD = duration_cast<microseconds>(tD2 - tD1);
|
||||||
|
double tD = static_cast<double>(durD.count()) / 1e6 / NLOOPSD;
|
||||||
|
|
||||||
|
|
||||||
|
double flopsD = ND * 2 * p;
|
||||||
|
double bytesD = (p + 2 * ND)*sizeof(double);
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark D =====\n";
|
||||||
|
cout << "bytes: " << bytesD << endl;
|
||||||
|
cout << "Timing in sec. : " << tD << endl;
|
||||||
|
cout << "GFLOPS : " << flopsD / tD / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : " << bytesD / tD / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//-------------TASK 5
|
||||||
|
{
|
||||||
|
|
||||||
|
|
||||||
|
vector<double> xA(NA);
|
||||||
|
for (unsigned int i = 0; i < NA; ++i)
|
||||||
|
{
|
||||||
|
double xi= (i % 219) + 1;
|
||||||
|
xA[i] = xi;
|
||||||
|
}
|
||||||
|
|
||||||
|
auto tA1 = system_clock::now();
|
||||||
|
double sA = 0.0, sumA = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSA; ++loop)
|
||||||
|
{
|
||||||
|
sA = norm2(xA);
|
||||||
|
sumA += sA;
|
||||||
|
}
|
||||||
|
auto tA2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durA = duration_cast<microseconds>(tA2 - tA1);
|
||||||
|
double tA = static_cast<double>(durA.count()) / 1e6 / NLOOPSA; //duration per loop seconds
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark 5A =====\n";
|
||||||
|
cout << "NORM = " << sA << endl;
|
||||||
|
cout << "Timing in sec. : " << tA << endl;
|
||||||
|
cout << "GFLOPS : " << 2.0 * NA / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : "
|
||||||
|
<< NA * sizeof(xA[0]) / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
{
|
||||||
|
|
||||||
|
|
||||||
|
vector<double> xA(NA), yA(NA);
|
||||||
|
for (unsigned int i = 0; i < NA; ++i)
|
||||||
|
{
|
||||||
|
double xi= (i % 219) + 1;
|
||||||
|
xA[i] = xi;
|
||||||
|
yA[i] = 1.0 / xi;
|
||||||
|
}
|
||||||
|
|
||||||
|
auto tA1 = system_clock::now();
|
||||||
|
double sA = 0.0, sumA = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSA; ++loop)
|
||||||
|
{
|
||||||
|
sA = scalar_kahan(xA, yA);
|
||||||
|
sumA += sA;
|
||||||
|
}
|
||||||
|
auto tA2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durA = duration_cast<microseconds>(tA2 - tA1);
|
||||||
|
double tA = static_cast<double>(durA.count()) / 1e6 / NLOOPSA; //duration per loop seconds
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark 5B =====\n";
|
||||||
|
cout << "<xA,yA> = " << sA << endl;
|
||||||
|
cout << "Timing in sec. : " << tA << endl;
|
||||||
|
cout << "GFLOPS : " << 5.0 * NA / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : "
|
||||||
|
<< 2.0 * NA * sizeof(xA[0]) / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
{
|
||||||
|
|
||||||
|
const unsigned int LC = MC;
|
||||||
|
const unsigned int NC = MC;
|
||||||
|
|
||||||
|
vector<double> AC(MC * LC), BC(LC * NC);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < MC; ++i)
|
||||||
|
for (unsigned int j = 0; j < LC; ++j)
|
||||||
|
AC[i * LC + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < LC; ++i)
|
||||||
|
for (unsigned int j = 0; j < NC; ++j)
|
||||||
|
BC[i * NC + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
vector<double> CC;
|
||||||
|
auto tC1 = system_clock::now();
|
||||||
|
double guardC = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSC; ++loop)
|
||||||
|
{
|
||||||
|
CC = matrixMultColumnWise(AC, BC, MC);
|
||||||
|
guardC += CC[0];
|
||||||
|
}
|
||||||
|
auto tC2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durC = duration_cast<microseconds>(tC2 - tC1);
|
||||||
|
double tC = static_cast<double>(durC.count()) / 1e6 / NLOOPSC;
|
||||||
|
|
||||||
|
double flopsC = 2.0 * MC * LC * NC;
|
||||||
|
double bytesC = (MC * LC + LC * NC + MC * NC)* sizeof(double);
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark 5C =====\n";
|
||||||
|
cout << "bytes: " << bytesC << endl;
|
||||||
|
cout << "Timing in sec. : " << tC << endl;
|
||||||
|
cout << "GFLOPS : " << flopsC / tC / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : " << bytesC / tC / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
} // memory for x and y will be deallocated by their destructors
|
||||||
0
sheet3/345/main.cpp:Zone.Identifier
Normal file
0
sheet3/345/main.cpp:Zone.Identifier
Normal file
65
sheet3/345/mylib.cpp
Normal file
65
sheet3/345/mylib.cpp
Normal file
|
|
@ -0,0 +1,65 @@
|
||||||
|
#include "mylib.h"
|
||||||
|
#include <cassert> // assert()
|
||||||
|
#include <cmath>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
#ifdef __INTEL_CLANG_COMPILER
|
||||||
|
#pragma message(" ########## Use of MKL ###############")
|
||||||
|
#include <mkl.h>
|
||||||
|
#else
|
||||||
|
#pragma message(" ########## Use of CBLAS ###############")
|
||||||
|
//extern "C"
|
||||||
|
//{
|
||||||
|
#include <cblas.h> // cBLAS Library
|
||||||
|
#include <lapacke.h> // Lapack
|
||||||
|
//}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
double scalar(vector<double> const &x, vector<double> const &y)
|
||||||
|
{
|
||||||
|
assert(x.size() == y.size()); // switch off via compile flag: -DNDEBUG
|
||||||
|
size_t const N = x.size();
|
||||||
|
double sum = 0.0;
|
||||||
|
for (size_t i = 0; i < N; ++i)
|
||||||
|
{
|
||||||
|
sum += x[i] * y[i];
|
||||||
|
//sum += exp(x[i])*log(y[i]);
|
||||||
|
}
|
||||||
|
return sum;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
double scalar_cblas(vector<double> const &x, vector<double> const &y)
|
||||||
|
{
|
||||||
|
int const asize = static_cast<int>(size(x));
|
||||||
|
int const bsize = static_cast<int>(size(y));
|
||||||
|
assert(asize == bsize); // switch off via compile flag: -DNDEBUG
|
||||||
|
return cblas_ddot(asize,x.data(),1,y.data(),1);
|
||||||
|
//assert(x.size() == y.size()); // switch off via compile flag: -DNDEBUG
|
||||||
|
//return cblas_ddot(x.size(),x.data(),1,y.data(),1);
|
||||||
|
}
|
||||||
|
|
||||||
|
float scalar_cblas(vector<float> const &x, vector<float> const &y)
|
||||||
|
{
|
||||||
|
int const asize = static_cast<int>(size(x));
|
||||||
|
int const bsize = static_cast<int>(size(y));
|
||||||
|
assert(asize == bsize); // switch off via compile flag: -DNDEBUG
|
||||||
|
return cblas_sdot(asize,x.data(),1,y.data(),1);
|
||||||
|
//assert(x.size() == y.size()); // switch off via compile flag: -DNDEBUG
|
||||||
|
//return cblas_ddot(x.size(),x.data(),1,y.data(),1);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
double norm(vector<double> const &x)
|
||||||
|
{
|
||||||
|
size_t const N = x.size();
|
||||||
|
double sum = 0.0;
|
||||||
|
for (size_t i = 0; i < N; ++i)
|
||||||
|
{
|
||||||
|
sum += x[i] * x[i];
|
||||||
|
}
|
||||||
|
return std::sqrt(sum);
|
||||||
|
}
|
||||||
|
|
||||||
0
sheet3/345/mylib.cpp:Zone.Identifier
Normal file
0
sheet3/345/mylib.cpp:Zone.Identifier
Normal file
30
sheet3/345/mylib.h
Normal file
30
sheet3/345/mylib.h
Normal file
|
|
@ -0,0 +1,30 @@
|
||||||
|
#ifndef FILE_MYLIB
|
||||||
|
#define FILE_MYLIB
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
/** Inner product
|
||||||
|
@param[in] x vector
|
||||||
|
@param[in] y vector
|
||||||
|
@return resulting Euclidian inner product <x,y>
|
||||||
|
*/
|
||||||
|
double scalar(std::vector<double> const &x, std::vector<double> const &y);
|
||||||
|
|
||||||
|
/** Inner product using BLAS routines
|
||||||
|
@param[in] x vector
|
||||||
|
@param[in] y vector
|
||||||
|
@return resulting Euclidian inner product <x,y>
|
||||||
|
*/
|
||||||
|
double scalar_cblas(std::vector<double> const &x, std::vector<double> const &y);
|
||||||
|
float scalar_cblas(std::vector<float> const &x, std::vector<float> const &y);
|
||||||
|
|
||||||
|
|
||||||
|
/** L_2 Norm of a vector
|
||||||
|
@param[in] x vector
|
||||||
|
@return resulting Euclidian norm <x,y>
|
||||||
|
*/
|
||||||
|
double norm(std::vector<double> const &x);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#endif
|
||||||
0
sheet3/345/mylib.h:Zone.Identifier
Normal file
0
sheet3/345/mylib.h:Zone.Identifier
Normal file
1826
sheet3/345/small_Doxyfile
Normal file
1826
sheet3/345/small_Doxyfile
Normal file
File diff suppressed because it is too large
Load diff
0
sheet3/345/small_Doxyfile:Zone.Identifier
Normal file
0
sheet3/345/small_Doxyfile:Zone.Identifier
Normal file
6
sheet3/6/.vscode/settings.json
vendored
Normal file
6
sheet3/6/.vscode/settings.json
vendored
Normal file
|
|
@ -0,0 +1,6 @@
|
||||||
|
{
|
||||||
|
"files.associations": {
|
||||||
|
"ostream": "cpp",
|
||||||
|
"iostream": "cpp"
|
||||||
|
}
|
||||||
|
}
|
||||||
0
sheet3/6/.vscode/settings.json:Zone.Identifier
vendored
Normal file
0
sheet3/6/.vscode/settings.json:Zone.Identifier
vendored
Normal file
2563
sheet3/6/Doxyfile
Normal file
2563
sheet3/6/Doxyfile
Normal file
File diff suppressed because it is too large
Load diff
31
sheet3/6/Makefile
Normal file
31
sheet3/6/Makefile
Normal file
|
|
@ -0,0 +1,31 @@
|
||||||
|
#
|
||||||
|
# use GNU-Compiler tools
|
||||||
|
COMPILER=GCC_
|
||||||
|
# alternatively from the shell
|
||||||
|
# export COMPILER=GCC_
|
||||||
|
# or, alternatively from the shell
|
||||||
|
# make COMPILER=GCC_
|
||||||
|
|
||||||
|
# use Intel compilers
|
||||||
|
#COMPILER=ICC_
|
||||||
|
|
||||||
|
# use PGI compilers
|
||||||
|
# COMPILER=PGI_
|
||||||
|
|
||||||
|
LIBS = -lopenblas
|
||||||
|
|
||||||
|
SOURCES = main.cpp mylib.cpp benchmark.cpp
|
||||||
|
OBJECTS = $(SOURCES:.cpp=.o)
|
||||||
|
|
||||||
|
PROGRAM = main.${COMPILER}
|
||||||
|
|
||||||
|
# uncomment the next to lines for debugging and detailed performance analysis
|
||||||
|
CXXFLAGS += -g
|
||||||
|
LINKFLAGS += -g
|
||||||
|
# do not use -pg with PGI compilers
|
||||||
|
|
||||||
|
ifndef COMPILER
|
||||||
|
COMPILER=GCC_
|
||||||
|
endif
|
||||||
|
|
||||||
|
include ../${COMPILER}default.mk
|
||||||
43
sheet3/6/benchmark.cpp
Normal file
43
sheet3/6/benchmark.cpp
Normal file
|
|
@ -0,0 +1,43 @@
|
||||||
|
#include <iostream>
|
||||||
|
#include <vector>
|
||||||
|
#include <cmath>
|
||||||
|
using namespace std;
|
||||||
|
#include <cblas.h>
|
||||||
|
|
||||||
|
// Inner product
|
||||||
|
double benchmark_A(const vector<double> &x, const vector<double> &y)
|
||||||
|
{
|
||||||
|
|
||||||
|
|
||||||
|
return cblas_ddot(x.size(),x.data(),1,y.data(),1);
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
//Matrix-vector product
|
||||||
|
vector<double> benchmark_B(const vector<double> &A, const vector<double> &x)
|
||||||
|
{
|
||||||
|
unsigned int N = x.size();
|
||||||
|
unsigned int M = A.size() / N;
|
||||||
|
vector<double> b(M, 0.0);
|
||||||
|
|
||||||
|
cblas_dgemv(CblasRowMajor,CblasNoTrans,M,N,1,A.data(),N,x.data(),1,0.0,b.data(),1);
|
||||||
|
|
||||||
|
return b;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//Matrix-Matrix product
|
||||||
|
vector<double> benchmark_C(const vector<double> &A, const vector<double> &B, unsigned int M)
|
||||||
|
{
|
||||||
|
unsigned int L = A.size()/M;
|
||||||
|
unsigned int N = B.size()/L;
|
||||||
|
vector<double> C(M*N,0.0);
|
||||||
|
|
||||||
|
cblas_dgemm(CblasRowMajor,CblasNoTrans,CblasNoTrans,M,N,L,1.0,A.data(),L,B.data(),N,0.0,C.data(),N);
|
||||||
|
|
||||||
|
return C;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
21
sheet3/6/benchmark.h
Normal file
21
sheet3/6/benchmark.h
Normal file
|
|
@ -0,0 +1,21 @@
|
||||||
|
#ifndef BENCHMARK_H
|
||||||
|
#define BENCHMARK_H
|
||||||
|
|
||||||
|
|
||||||
|
#include <vector>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
double benchmark_A(const vector<double> &x,
|
||||||
|
const vector<double> &y);
|
||||||
|
|
||||||
|
vector<double> benchmark_B(const vector<double> &A,
|
||||||
|
const vector<double> &x);
|
||||||
|
|
||||||
|
vector<double> benchmark_C(const vector<double> &A,
|
||||||
|
const vector<double> &B,
|
||||||
|
unsigned int M);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#endif
|
||||||
BIN
sheet3/6/main
Normal file
BIN
sheet3/6/main
Normal file
Binary file not shown.
142
sheet3/6/main.cpp
Normal file
142
sheet3/6/main.cpp
Normal file
|
|
@ -0,0 +1,142 @@
|
||||||
|
#include "mylib.h"
|
||||||
|
#include <cassert>
|
||||||
|
#include <chrono> // timing
|
||||||
|
#include <cmath> // sqrt()
|
||||||
|
#include <cstdlib> // atoi()
|
||||||
|
#include <cstring> // strncmp()
|
||||||
|
#include <ctime>
|
||||||
|
#include <iostream>
|
||||||
|
#include <sstream>
|
||||||
|
#include "benchmark.h"
|
||||||
|
using namespace std;
|
||||||
|
using namespace std::chrono; // timing
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
const unsigned int NA = 1400000;
|
||||||
|
const unsigned int NLOOPSA = 10000;
|
||||||
|
//const unsigned int NLOOPS = 10;
|
||||||
|
|
||||||
|
const unsigned int MC = 1000;
|
||||||
|
int const NLOOPSC = 1000;
|
||||||
|
// ---------- Benchmark A ----------
|
||||||
|
|
||||||
|
{
|
||||||
|
|
||||||
|
|
||||||
|
vector<double> xA(NA), yA(NA);
|
||||||
|
for (unsigned int i = 0; i < NA; ++i)
|
||||||
|
{
|
||||||
|
double xi= (i % 219) + 1;
|
||||||
|
xA[i] = xi;
|
||||||
|
yA[i] = 1.0 / xi;
|
||||||
|
}
|
||||||
|
|
||||||
|
auto tA1 = system_clock::now();
|
||||||
|
double sA = 0.0, sumA = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSA; ++loop)
|
||||||
|
{
|
||||||
|
sA = benchmark_A(xA, yA);
|
||||||
|
sumA += sA;
|
||||||
|
}
|
||||||
|
auto tA2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durA = duration_cast<microseconds>(tA2 - tA1);
|
||||||
|
double tA = static_cast<double>(durA.count()) / 1e6 / NLOOPSA; //duration per loop seconds
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark A =====\n";
|
||||||
|
cout << "<xA,yA> = " << sA << endl;
|
||||||
|
cout << "Timing in sec. : " << tA << endl;
|
||||||
|
cout << "GFLOPS : " << 2.0 * NA / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : "
|
||||||
|
<< 2.0 * NA * sizeof(xA[0]) / tA / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ---------- Benchmark B----------
|
||||||
|
|
||||||
|
{
|
||||||
|
const unsigned int MB = 1700;
|
||||||
|
const unsigned int NB = MB;
|
||||||
|
const unsigned int NLOOPSB = 10000;//50;
|
||||||
|
|
||||||
|
vector<double> AB(MB * NB);
|
||||||
|
vector<double> xB(NB);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < MB; ++i)
|
||||||
|
for (unsigned int j = 0; j < NB; ++j)
|
||||||
|
AB[i * NB + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
for (unsigned int j = 0; j < NB; ++j)
|
||||||
|
{
|
||||||
|
|
||||||
|
xB[j] = 1.0 / AB[17*NB+j];
|
||||||
|
}
|
||||||
|
|
||||||
|
vector<double> bB;
|
||||||
|
auto tB1 = system_clock::now();
|
||||||
|
double guardB = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSB; ++loop)
|
||||||
|
{
|
||||||
|
bB = benchmark_B(AB, xB);
|
||||||
|
guardB += bB[17];
|
||||||
|
}
|
||||||
|
auto tB2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durB = duration_cast<microseconds>(tB2 - tB1);
|
||||||
|
double tB = static_cast<double>(durB.count()) / 1e6 / NLOOPSB;
|
||||||
|
|
||||||
|
double flopsB = 2.0 * MB * NB;
|
||||||
|
double bytesB = (MB * NB + NB + MB) * sizeof(double);
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark B =====\n";
|
||||||
|
cout << guardB << endl;
|
||||||
|
cout << "bytes: " << bytesB << endl;
|
||||||
|
cout << "Timing in sec. : " << tB << endl;
|
||||||
|
cout << "GFLOPS : " << flopsB / tB / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : " << bytesB / tB / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ---------- Benchmark C ----------
|
||||||
|
|
||||||
|
{
|
||||||
|
|
||||||
|
const unsigned int LC = MC;
|
||||||
|
const unsigned int NC = MC;
|
||||||
|
|
||||||
|
|
||||||
|
vector<double> AC(MC * LC), BC(LC * NC);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < MC; ++i)
|
||||||
|
for (unsigned int j = 0; j < LC; ++j)
|
||||||
|
AC[i * LC + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < LC; ++i)
|
||||||
|
for (unsigned int j = 0; j < NC; ++j)
|
||||||
|
BC[i * NC + j] = (i+j) %219 +1;
|
||||||
|
|
||||||
|
vector<double> CC;
|
||||||
|
auto tC1 = system_clock::now();
|
||||||
|
double guardC = 0.0;
|
||||||
|
for (unsigned int loop = 0; loop < NLOOPSC; ++loop)
|
||||||
|
{
|
||||||
|
CC = benchmark_C(AC, BC, MC);
|
||||||
|
guardC += CC[0];
|
||||||
|
}
|
||||||
|
auto tC2 = system_clock::now();
|
||||||
|
|
||||||
|
auto durC = duration_cast<microseconds>(tC2 - tC1);
|
||||||
|
double tC = static_cast<double>(durC.count()) / 1e6 / NLOOPSC;
|
||||||
|
|
||||||
|
double flopsC = 2.0 * MC * LC * NC;
|
||||||
|
double bytesC = (MC * LC + LC * NC + MC * NC)* sizeof(double);
|
||||||
|
|
||||||
|
cout << "\n===== Benchmark C =====\n";
|
||||||
|
cout << "bytes: " << bytesC << endl;
|
||||||
|
cout << "Timing in sec. : " << tC << endl;
|
||||||
|
cout << "GFLOPS : " << flopsC / tC / 1024 / 1024 / 1024 << endl;
|
||||||
|
cout << "GiByte/s : " << bytesC / tC / 1024 / 1024 / 1024 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
} // memory for x and y will be deallocated by their destructors
|
||||||
65
sheet3/6/mylib.cpp
Normal file
65
sheet3/6/mylib.cpp
Normal file
|
|
@ -0,0 +1,65 @@
|
||||||
|
#include "mylib.h"
|
||||||
|
#include <cassert> // assert()
|
||||||
|
#include <cmath>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
#ifdef __INTEL_CLANG_COMPILER
|
||||||
|
#pragma message(" ########## Use of MKL ###############")
|
||||||
|
#include <mkl.h>
|
||||||
|
#else
|
||||||
|
#pragma message(" ########## Use of CBLAS ###############")
|
||||||
|
//extern "C"
|
||||||
|
//{
|
||||||
|
#include <cblas.h> // cBLAS Library
|
||||||
|
#include <lapacke.h> // Lapack
|
||||||
|
//}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
double scalar(vector<double> const &x, vector<double> const &y)
|
||||||
|
{
|
||||||
|
assert(x.size() == y.size()); // switch off via compile flag: -DNDEBUG
|
||||||
|
size_t const N = x.size();
|
||||||
|
double sum = 0.0;
|
||||||
|
for (size_t i = 0; i < N; ++i)
|
||||||
|
{
|
||||||
|
sum += x[i] * y[i];
|
||||||
|
//sum += exp(x[i])*log(y[i]);
|
||||||
|
}
|
||||||
|
return sum;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
double scalar_cblas(vector<double> const &x, vector<double> const &y)
|
||||||
|
{
|
||||||
|
int const asize = static_cast<int>(size(x));
|
||||||
|
int const bsize = static_cast<int>(size(y));
|
||||||
|
assert(asize == bsize); // switch off via compile flag: -DNDEBUG
|
||||||
|
return cblas_ddot(asize,x.data(),1,y.data(),1);
|
||||||
|
//assert(x.size() == y.size()); // switch off via compile flag: -DNDEBUG
|
||||||
|
//return cblas_ddot(x.size(),x.data(),1,y.data(),1);
|
||||||
|
}
|
||||||
|
|
||||||
|
float scalar_cblas(vector<float> const &x, vector<float> const &y)
|
||||||
|
{
|
||||||
|
int const asize = static_cast<int>(size(x));
|
||||||
|
int const bsize = static_cast<int>(size(y));
|
||||||
|
assert(asize == bsize); // switch off via compile flag: -DNDEBUG
|
||||||
|
return cblas_sdot(asize,x.data(),1,y.data(),1);
|
||||||
|
//assert(x.size() == y.size()); // switch off via compile flag: -DNDEBUG
|
||||||
|
//return cblas_ddot(x.size(),x.data(),1,y.data(),1);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
double norm(vector<double> const &x)
|
||||||
|
{
|
||||||
|
size_t const N = x.size();
|
||||||
|
double sum = 0.0;
|
||||||
|
for (size_t i = 0; i < N; ++i)
|
||||||
|
{
|
||||||
|
sum += x[i] * x[i];
|
||||||
|
}
|
||||||
|
return std::sqrt(sum);
|
||||||
|
}
|
||||||
|
|
||||||
30
sheet3/6/mylib.h
Normal file
30
sheet3/6/mylib.h
Normal file
|
|
@ -0,0 +1,30 @@
|
||||||
|
#ifndef FILE_MYLIB
|
||||||
|
#define FILE_MYLIB
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
/** Inner product
|
||||||
|
@param[in] x vector
|
||||||
|
@param[in] y vector
|
||||||
|
@return resulting Euclidian inner product <x,y>
|
||||||
|
*/
|
||||||
|
double scalar(std::vector<double> const &x, std::vector<double> const &y);
|
||||||
|
|
||||||
|
/** Inner product using BLAS routines
|
||||||
|
@param[in] x vector
|
||||||
|
@param[in] y vector
|
||||||
|
@return resulting Euclidian inner product <x,y>
|
||||||
|
*/
|
||||||
|
double scalar_cblas(std::vector<double> const &x, std::vector<double> const &y);
|
||||||
|
float scalar_cblas(std::vector<float> const &x, std::vector<float> const &y);
|
||||||
|
|
||||||
|
|
||||||
|
/** L_2 Norm of a vector
|
||||||
|
@param[in] x vector
|
||||||
|
@return resulting Euclidian norm <x,y>
|
||||||
|
*/
|
||||||
|
double norm(std::vector<double> const &x);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#endif
|
||||||
1826
sheet3/6/small_Doxyfile
Normal file
1826
sheet3/6/small_Doxyfile
Normal file
File diff suppressed because it is too large
Load diff
6
sheet3/7/.vscode/settings.json
vendored
Normal file
6
sheet3/7/.vscode/settings.json
vendored
Normal file
|
|
@ -0,0 +1,6 @@
|
||||||
|
{
|
||||||
|
"files.associations": {
|
||||||
|
"ostream": "cpp",
|
||||||
|
"iostream": "cpp"
|
||||||
|
}
|
||||||
|
}
|
||||||
0
sheet3/7/.vscode/settings.json:Zone - Kopie.Identifier
vendored
Normal file
0
sheet3/7/.vscode/settings.json:Zone - Kopie.Identifier
vendored
Normal file
0
sheet3/7/.vscode/settings.json:Zone - Kopie.Identifier:Zone.Identifier
vendored
Normal file
0
sheet3/7/.vscode/settings.json:Zone - Kopie.Identifier:Zone.Identifier
vendored
Normal file
0
sheet3/7/.vscode/settings.json:Zone.Identifier
vendored
Normal file
0
sheet3/7/.vscode/settings.json:Zone.Identifier
vendored
Normal file
BIN
sheet3/7/5main
Executable file
BIN
sheet3/7/5main
Executable file
Binary file not shown.
2563
sheet3/7/Doxyfile
Normal file
2563
sheet3/7/Doxyfile
Normal file
File diff suppressed because it is too large
Load diff
33
sheet3/7/Makefile
Normal file
33
sheet3/7/Makefile
Normal file
|
|
@ -0,0 +1,33 @@
|
||||||
|
#
|
||||||
|
# use GNU-Compiler tools
|
||||||
|
COMPILER=GCC_
|
||||||
|
# alternatively from the shell
|
||||||
|
# export COMPILER=GCC_
|
||||||
|
# or, alternatively from the shell
|
||||||
|
# make COMPILER=GCC_
|
||||||
|
|
||||||
|
# use Intel compilers
|
||||||
|
#COMPILER=ICC_
|
||||||
|
|
||||||
|
# use PGI compilers
|
||||||
|
# COMPILER=PGI_
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
SOURCES = main.cpp
|
||||||
|
OBJECTS = $(SOURCES:.cpp=.o)
|
||||||
|
|
||||||
|
PROGRAM = main.${COMPILER}
|
||||||
|
|
||||||
|
# uncomment the next to lines for debugging and detailed performance analysis
|
||||||
|
CXXFLAGS += -g
|
||||||
|
LINKFLAGS += -g
|
||||||
|
# do not use -pg with PGI compilers
|
||||||
|
|
||||||
|
ifndef COMPILER
|
||||||
|
COMPILER=GCC_
|
||||||
|
endif
|
||||||
|
|
||||||
|
include ../${COMPILER}default.mk
|
||||||
|
$(PROGRAM): $(OBJECTS)
|
||||||
|
$(CXX) $(CXXFLAGS) $(OBJECTS) -llapacke -lopenblas -o $(PROGRAM)
|
||||||
BIN
sheet3/7/benchmark.o
Normal file
BIN
sheet3/7/benchmark.o
Normal file
Binary file not shown.
BIN
sheet3/7/main
Executable file
BIN
sheet3/7/main
Executable file
Binary file not shown.
68
sheet3/7/main.cpp
Normal file
68
sheet3/7/main.cpp
Normal file
|
|
@ -0,0 +1,68 @@
|
||||||
|
#include <cassert>
|
||||||
|
#include <chrono> // timing
|
||||||
|
#include <cmath> // sqrt()
|
||||||
|
#include <cstdlib> // atoi()
|
||||||
|
#include <cstring> // strncmp()
|
||||||
|
#include <ctime>
|
||||||
|
#include <iostream>
|
||||||
|
#include <sstream>
|
||||||
|
#include <vector>
|
||||||
|
#include <lapacke.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
using namespace std::chrono; // timing
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
unsigned int n= 10;
|
||||||
|
unsigned int nhrs = 1;
|
||||||
|
|
||||||
|
vector<double> M(n*n,4.0);
|
||||||
|
|
||||||
|
for(unsigned int i=0; i<n; i++)
|
||||||
|
{
|
||||||
|
for(unsigned int j=0; j<n; j++)
|
||||||
|
{
|
||||||
|
if(i!=j)
|
||||||
|
{
|
||||||
|
double diff = i-j;
|
||||||
|
M[i*n+j] = 1.0/(diff*diff);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
vector<int> ipiv(n); //pivots
|
||||||
|
LAPACKE_dgetrf(LAPACK_ROW_MAJOR,n,n, M.data(),n,ipiv.data()); //M=PLU
|
||||||
|
|
||||||
|
|
||||||
|
unsigned int runtimes[] = {1,2,4,8,16,32};
|
||||||
|
|
||||||
|
for(unsigned int i=0; i < 6;i++)
|
||||||
|
{
|
||||||
|
nhrs = runtimes[i];
|
||||||
|
vector<double> b(n*nhrs,0.0);
|
||||||
|
for (unsigned int j=0; j<n; j++)
|
||||||
|
{
|
||||||
|
for (unsigned int k=0; k<nhrs; k++)
|
||||||
|
{
|
||||||
|
b[j*nhrs+k] = j*nhrs+k;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
LAPACKE_dgetrs(LAPACK_ROW_MAJOR,'N',n,nhrs,M.data(),n,ipiv.data(),b.data(),nhrs);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
|
||||||
|
}
|
||||||
BIN
sheet3/7/mylib.o
Normal file
BIN
sheet3/7/mylib.o
Normal file
Binary file not shown.
1826
sheet3/7/small_Doxyfile
Normal file
1826
sheet3/7/small_Doxyfile
Normal file
File diff suppressed because it is too large
Load diff
124
sheet3/CLANG_default.mk
Normal file
124
sheet3/CLANG_default.mk
Normal file
|
|
@ -0,0 +1,124 @@
|
||||||
|
# Basic Defintions for using GNU-compiler suite sequentially
|
||||||
|
# requires setting of COMPILER=CLANG_
|
||||||
|
|
||||||
|
#CLANGPATH=//usr/lib/llvm-10/bin/
|
||||||
|
CC = ${CLANGPATH}clang
|
||||||
|
CXX = ${CLANGPATH}clang++
|
||||||
|
#CXX = ${CLANGPATH}clang++ -lomptarget -fopenmp-targets=nvptx64-nvidia-cuda --cuda-path=/opt/pgi/linux86-64/2017/cuda/8.0
|
||||||
|
#F77 = gfortran
|
||||||
|
LINKER = ${CXX}
|
||||||
|
|
||||||
|
#http://clang.llvm.org/docs/UsersManual.html#options-to-control-error-and-warning-messages
|
||||||
|
WARNINGS += -Weverything
|
||||||
|
WARNINGS += -Wno-c++98-compat -Wno-c++98-compat-pedantic -Wno-sign-conversion -Wno-date-time -Wno-shorten-64-to-32 -Wno-padded
|
||||||
|
WARNINGS += -Wdocumentation -Wconversion -Wshadow -Wfloat-conversion -pedantic -ferror-limit=1
|
||||||
|
#-fsyntax-only -Wdocumentation -Wconversion -Wshadow -Wfloat-conversion -pedantic
|
||||||
|
|
||||||
|
CXXFLAGS += -O3 -std=c++17 -ferror-limit=1 ${WARNINGS}
|
||||||
|
# don't use -Ofast
|
||||||
|
# -ftrapv
|
||||||
|
LINKFLAGS += -O3
|
||||||
|
|
||||||
|
# different libraries in Ubuntu or manajaró
|
||||||
|
ifndef UBUNTU
|
||||||
|
UBUNTU=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
# BLAS, LAPACK
|
||||||
|
LINKFLAGS += -llapack -lblas
|
||||||
|
# -lopenblas
|
||||||
|
ifeq ($(UBUNTU),1)
|
||||||
|
# ubuntu
|
||||||
|
else
|
||||||
|
# on archlinux
|
||||||
|
LINKFLAGS += -lcblas
|
||||||
|
endif
|
||||||
|
|
||||||
|
# interprocedural optimization
|
||||||
|
CXXFLAGS += -flto
|
||||||
|
LINKFLAGS += -flto
|
||||||
|
|
||||||
|
# very good check
|
||||||
|
# http://clang.llvm.org/extra/clang-tidy/
|
||||||
|
# good check, see: http://llvm.org/docs/CodingStandards.html#include-style
|
||||||
|
SWITCH_OFF=,-readability-magic-numbers,-readability-redundant-control-flow,-readability-redundant-member-init
|
||||||
|
SWITCH_OFF+=,-readability-redundant-member-init,-readability-isolate-declaration
|
||||||
|
#READABILITY=,readability*${SWITCH_OFF}
|
||||||
|
#TIDYFLAGS = -checks=llvm-*,-llvm-header-guard -header-filter=.* -enable-check-profile -extra-arg="-std=c++17" -extra-arg="-fopenmp"
|
||||||
|
TIDYFLAGS = -checks=llvm-*,-llvm-header-guard${READABILITY} -header-filter=.* -enable-check-profile -extra-arg="-std=c++17" -extra-arg="-fopenmp"
|
||||||
|
#TIDYFLAGS += -checks='modernize*
|
||||||
|
# ???
|
||||||
|
#TIDYFLAGS = -checks='cert*' -header-filter=.*
|
||||||
|
# MPI checks ??
|
||||||
|
#TIDYFLAGS = -checks='mpi*'
|
||||||
|
# ??
|
||||||
|
#TIDYFLAGS = -checks='performance*' -header-filter=.*
|
||||||
|
#TIDYFLAGS = -checks='portability-*' -header-filter=.*
|
||||||
|
#TIDYFLAGS = -checks='readability-*' -header-filter=.*
|
||||||
|
|
||||||
|
default: ${PROGRAM}
|
||||||
|
|
||||||
|
${PROGRAM}: ${OBJECTS}
|
||||||
|
$(LINKER) $^ ${LINKFLAGS} -o $@
|
||||||
|
|
||||||
|
clean:
|
||||||
|
@rm -f ${PROGRAM} ${OBJECTS}
|
||||||
|
|
||||||
|
clean_all:: clean
|
||||||
|
@rm -f *_ *~ *.bak *.log *.out *.tar
|
||||||
|
|
||||||
|
codecheck: tidy_check
|
||||||
|
tidy_check:
|
||||||
|
clang-tidy ${SOURCES} ${TIDYFLAGS} -- ${SOURCES}
|
||||||
|
# see also http://clang-developers.42468.n3.nabble.com/Error-while-trying-to-load-a-compilation-database-td4049722.html
|
||||||
|
|
||||||
|
run: clean ${PROGRAM}
|
||||||
|
# time ./${PROGRAM} ${PARAMS}
|
||||||
|
./${PROGRAM} ${PARAMS}
|
||||||
|
|
||||||
|
# tar the current directory
|
||||||
|
MY_DIR = `basename ${PWD}`
|
||||||
|
tar: clean_all
|
||||||
|
@echo "Tar the directory: " ${MY_DIR}
|
||||||
|
@cd .. ;\
|
||||||
|
tar cf ${MY_DIR}.tar ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
# tar cf `basename ${PWD}`.tar *
|
||||||
|
|
||||||
|
doc:
|
||||||
|
doxygen Doxyfile
|
||||||
|
|
||||||
|
#########################################################################
|
||||||
|
|
||||||
|
.cpp.o:
|
||||||
|
$(CXX) -c $(CXXFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.c.o:
|
||||||
|
$(CC) -c $(CFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.f.o:
|
||||||
|
$(F77) -c $(FFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
##################################################################################################
|
||||||
|
# some tools
|
||||||
|
# Cache behaviour (CXXFLAGS += -g tracks down to source lines; no -pg in linkflags)
|
||||||
|
cache: ${PROGRAM}
|
||||||
|
valgrind --tool=callgrind --simulate-cache=yes ./$^ ${PARAMS}
|
||||||
|
# kcachegrind callgrind.out.<pid> &
|
||||||
|
kcachegrind `ls -1tr callgrind.out.* |tail -1`
|
||||||
|
|
||||||
|
# Check for wrong memory accesses, memory leaks, ...
|
||||||
|
# use smaller data sets
|
||||||
|
mem: ${PROGRAM}
|
||||||
|
valgrind -v --leak-check=yes --tool=memcheck --undef-value-errors=yes --track-origins=yes --log-file=$^.addr.out --show-reachable=yes ./$^ ${PARAMS}
|
||||||
|
|
||||||
|
# Simple run time profiling of your code
|
||||||
|
# CXXFLAGS += -g -pg
|
||||||
|
# LINKFLAGS += -pg
|
||||||
|
prof: ${PROGRAM}
|
||||||
|
perf record ./$^ ${PARAMS}
|
||||||
|
perf report
|
||||||
|
# gprof -b ./$^ > gp.out
|
||||||
|
# kprof -f gp.out -p gprof &
|
||||||
|
|
||||||
|
codecheck: tidy_check
|
||||||
183
sheet3/GCC_default.mk
Normal file
183
sheet3/GCC_default.mk
Normal file
|
|
@ -0,0 +1,183 @@
|
||||||
|
# Basic Defintions for using GNU-compiler suite sequentially
|
||||||
|
# requires setting of COMPILER=GCC_
|
||||||
|
|
||||||
|
CC = gcc
|
||||||
|
CXX = g++
|
||||||
|
F77 = gfortran
|
||||||
|
LINKER = ${CXX}
|
||||||
|
|
||||||
|
#LINKFLAGS += -lblas
|
||||||
|
# The <cblas.h> header requires extern "C".
|
||||||
|
|
||||||
|
WARNINGS = -Wall -pedantic -Wextra -Weffc++ -Woverloaded-virtual -Wfloat-equal -Wshadow \
|
||||||
|
-Wredundant-decls -Winline -fmax-errors=1
|
||||||
|
# -Wunreachable-code
|
||||||
|
#CXXFLAGS += -ffast-math -march=native ${WARNINGS}
|
||||||
|
CXXFLAGS += -O0 -funroll-all-loops -std=c++17 ${WARNINGS}
|
||||||
|
#-msse3
|
||||||
|
# -ftree-vectorizer-verbose=2 -DNDEBUG
|
||||||
|
# -ftree-vectorizer-verbose=5
|
||||||
|
# -ftree-vectorize -fdump-tree-vect-blocks=foo.dump -fdump-tree-pre=stderr
|
||||||
|
|
||||||
|
# CFLAGS = -ffast-math -O0 -DNDEBUG -msse3 -fopenmp -fdump-tree-vect-details
|
||||||
|
# CFLAGS = -ffast-math -O0 -funroll-loops -DNDEBUG -msse3 -fopenmp -ftree-vectorizer-verbose=2
|
||||||
|
# #CFLAGS = -ffast-math -O0 -DNDEBUG -msse3 -fopenmp
|
||||||
|
# FFLAGS = -ffast-math -O0 -DNDEBUG -msse3 -fopenmp
|
||||||
|
# LFLAGS = -ffast-math -O0 -DNDEBUG -msse3 -fopenmp
|
||||||
|
LINKFLAGS += -O0
|
||||||
|
|
||||||
|
#architecture
|
||||||
|
#CPU = -march=znver2
|
||||||
|
CXXFLAGS += ${CPU}
|
||||||
|
LINKFLAGS += ${CPU}
|
||||||
|
|
||||||
|
# different libraries in Ubuntu or manajaró
|
||||||
|
ifndef UBUNTU
|
||||||
|
UBUNTU=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
# BLAS, LAPACK
|
||||||
|
ifeq ($(UBUNTU),1)
|
||||||
|
LINKFLAGS += -llapack -lblas
|
||||||
|
# -lopenblas
|
||||||
|
else
|
||||||
|
# on archlinux
|
||||||
|
LINKFLAGS += -llapack -lopenblas -lcblas
|
||||||
|
endif
|
||||||
|
|
||||||
|
# interprocedural optimization
|
||||||
|
CXXFLAGS += -flto
|
||||||
|
LINKFLAGS += -flto
|
||||||
|
|
||||||
|
# for debugging purpose (save code)
|
||||||
|
# -fsanitize=leak # only one out the three can be used
|
||||||
|
# -fsanitize=address
|
||||||
|
# -fsanitize=thread
|
||||||
|
SANITARY = -fsanitize=address -fsanitize=undefined -fsanitize=null -fsanitize=return \
|
||||||
|
-fsanitize=bounds -fsanitize=alignment -fsanitize=float-divide-by-zero -fsanitize=float-cast-overflow \
|
||||||
|
-fsanitize=bool -fsanitize=enum -fsanitize=vptr
|
||||||
|
#CXXFLAGS += ${SANITARY}
|
||||||
|
#LINKFLAGS += ${SANITARY}
|
||||||
|
|
||||||
|
# profiling tools
|
||||||
|
#CXXFLAGS += -pg
|
||||||
|
#LINKFLAGS += -pg
|
||||||
|
|
||||||
|
default: ${PROGRAM}
|
||||||
|
|
||||||
|
${PROGRAM}: ${OBJECTS}
|
||||||
|
$(LINKER) $^ ${LINKFLAGS} -o $@
|
||||||
|
|
||||||
|
clean:
|
||||||
|
@rm -f ${PROGRAM} ${OBJECTS}
|
||||||
|
|
||||||
|
clean_all:: clean
|
||||||
|
-@rm -f *_ *~ *.bak *.log *.out *.tar *.orig *.optrpt
|
||||||
|
-@rm -rf html
|
||||||
|
|
||||||
|
run: clean ${PROGRAM}
|
||||||
|
#run: ${PROGRAM}
|
||||||
|
# time ./${PROGRAM} ${PARAMS}
|
||||||
|
./${PROGRAM} ${PARAMS}
|
||||||
|
|
||||||
|
# tar the current directory
|
||||||
|
MY_DIR = `basename ${PWD}`
|
||||||
|
tar: clean_all
|
||||||
|
@echo "Tar the directory: " ${MY_DIR}
|
||||||
|
@cd .. ;\
|
||||||
|
tar cf ${MY_DIR}.tar ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
# tar cf `basename ${PWD}`.tar *
|
||||||
|
|
||||||
|
zip: clean
|
||||||
|
@echo "Zip the directory: " ${MY_DIR}
|
||||||
|
@cd .. ;\
|
||||||
|
zip -r ${MY_DIR}.zip ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
|
||||||
|
doc:
|
||||||
|
doxygen Doxyfile
|
||||||
|
|
||||||
|
#########################################################################
|
||||||
|
.SUFFIXES: .f90
|
||||||
|
|
||||||
|
.cpp.o:
|
||||||
|
$(CXX) -c $(CXXFLAGS) -o $@ $<
|
||||||
|
# $(CXX) -c $(CXXFLAGS) -o $@ $< 2>&1 | tee -a $<.log
|
||||||
|
# $(CXX) -c $(CXXFLAGS) -o $@ $< 2>&1 | tee -a $(<:.cpp=.log)
|
||||||
|
|
||||||
|
.c.o:
|
||||||
|
$(CC) -c $(CFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.f.o:
|
||||||
|
$(F77) -c $(FFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.f90.o:
|
||||||
|
$(F77) -c $(FFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
##################################################################################################
|
||||||
|
# some tools
|
||||||
|
# Cache behaviour (CXXFLAGS += -g tracks down to source lines; no -pg in linkflags)
|
||||||
|
cache: ${PROGRAM}
|
||||||
|
valgrind --tool=callgrind --simulate-cache=yes ./$^ ${PARAMS}
|
||||||
|
# kcachegrind callgrind.out.<pid> &
|
||||||
|
kcachegrind `ls -1tr callgrind.out.* |tail -1`
|
||||||
|
|
||||||
|
# Check for wrong memory accesses, memory leaks, ...
|
||||||
|
# use smaller data sets
|
||||||
|
# no "-pg" in compile/link options
|
||||||
|
mem: ${PROGRAM}
|
||||||
|
valgrind -v --leak-check=yes --tool=memcheck --undef-value-errors=yes --track-origins=yes --log-file=$^.addr.out --show-reachable=yes ./$^ ${PARAMS}
|
||||||
|
# Graphical interface
|
||||||
|
# valkyrie
|
||||||
|
|
||||||
|
# Simple run time profiling of your code
|
||||||
|
# CXXFLAGS += -g -pg
|
||||||
|
# LINKFLAGS += -pg
|
||||||
|
prof: ${PROGRAM}
|
||||||
|
perf record ./$^ ${PARAMS}
|
||||||
|
perf report
|
||||||
|
# gprof -b ./$^ > gp.out
|
||||||
|
# kprof -f gp.out -p gprof &
|
||||||
|
|
||||||
|
# perf in Ubuntu 20.04: https://www.howtoforge.com/how-to-install-perf-performance-analysis-tool-on-ubuntu-20-04/
|
||||||
|
# * install
|
||||||
|
# * sudo vi /etc/sysctl.conf
|
||||||
|
# add kernel.perf_event_paranoid = 0
|
||||||
|
|
||||||
|
#Trace your heap:
|
||||||
|
#> heaptrack ./main.GCC_
|
||||||
|
#> heaptrack_gui heaptrack.main.GCC_.<pid>.gz
|
||||||
|
heap: ${PROGRAM}
|
||||||
|
heaptrack ./$^ ${PARAMS} 11
|
||||||
|
heaptrack_gui `ls -1tr heaptrack.$^.* |tail -1` &
|
||||||
|
|
||||||
|
codecheck: $(SOURCES)
|
||||||
|
cppcheck --enable=all --inconclusive --std=c++17 --suppress=missingIncludeSystem $^
|
||||||
|
|
||||||
|
|
||||||
|
########################################################################
|
||||||
|
# get the detailed status of all optimization flags
|
||||||
|
info:
|
||||||
|
echo "detailed status of all optimization flags"
|
||||||
|
$(CXX) --version
|
||||||
|
$(CXX) -Q $(CXXFLAGS) --help=optimizers
|
||||||
|
lscpu
|
||||||
|
inxi -C
|
||||||
|
lstopo
|
||||||
|
|
||||||
|
# Excellent hardware info
|
||||||
|
# hardinfo
|
||||||
|
# Life monitoring of CPU frequency etc.
|
||||||
|
# sudo i7z
|
||||||
|
|
||||||
|
# Memory consumption
|
||||||
|
# vmstat -at -SM 3
|
||||||
|
# xfce4-taskmanager
|
||||||
|
|
||||||
|
|
||||||
|
# https://www.tecmint.com/check-linux-cpu-information/
|
||||||
|
#https://www.tecmint.com/monitor-cpu-and-gpu-temperature-in-ubuntu/
|
||||||
|
|
||||||
|
# Debugging:
|
||||||
|
# https://wiki.archlinux.org/index.php/Debugging
|
||||||
125
sheet3/ICC_default.mk
Normal file
125
sheet3/ICC_default.mk
Normal file
|
|
@ -0,0 +1,125 @@
|
||||||
|
# Basic Defintions for using INTEL compiler suite sequentially
|
||||||
|
# requires setting of COMPILER=ICC_
|
||||||
|
|
||||||
|
#BINDIR = /opt/intel/bin/
|
||||||
|
|
||||||
|
CC = ${BINDIR}icc
|
||||||
|
CXX = ${BINDIR}icpc
|
||||||
|
F77 = ${BINDIR}ifort
|
||||||
|
LINKER = ${CXX}
|
||||||
|
|
||||||
|
|
||||||
|
WARNINGS = -Wall -Weffc++ -Woverloaded-virtual -Wfloat-equal -Wshadow -wd2015,2012 -wn3
|
||||||
|
# -Winline -Wredundant-decls -Wunreachable-code
|
||||||
|
CXXFLAGS += -O3 -fargument-noalias -std=c++17 -DNDEBUG ${WARNINGS} -mkl
|
||||||
|
# profiling tools
|
||||||
|
#CXXFLAGS += -pg
|
||||||
|
#LINKFLAGS += -pg
|
||||||
|
# -vec-report=3
|
||||||
|
# -qopt-report=5 -qopt-report-phase=vec
|
||||||
|
# -guide -parallel
|
||||||
|
# -guide-opts=string -guide-par[=n] -guide-vec[=n]
|
||||||
|
# -auto-p32 -simd -msse3
|
||||||
|
|
||||||
|
LINKFLAGS += -O3
|
||||||
|
|
||||||
|
# LAPACK, BLAS: use MKL by INTEL
|
||||||
|
# LINKFLAGS += -L${BINDIR}../composer_xe_2013.1.117/mkl/lib/intel64 -lmkl_intel_lp64 -lmkl_sequential -lmkl_core -lpthread
|
||||||
|
CXXFLAGS += -mkl
|
||||||
|
LINKFLAGS += -mkl
|
||||||
|
|
||||||
|
# interprocedural optimization
|
||||||
|
#CXXFLAGS += -ipo
|
||||||
|
#LINKFLAGS += -ipo
|
||||||
|
|
||||||
|
# annotated assembler file
|
||||||
|
ANNOTED = -fsource-asm -S
|
||||||
|
|
||||||
|
default: ${PROGRAM}
|
||||||
|
|
||||||
|
${PROGRAM}: ${OBJECTS}
|
||||||
|
$(LINKER) $^ ${LINKFLAGS} -o $@
|
||||||
|
|
||||||
|
clean:
|
||||||
|
rm -f ${PROGRAM} ${OBJECTS}
|
||||||
|
|
||||||
|
clean_all:: clean
|
||||||
|
@rm -f *_ *~ *.bak *.log *.out *.tar
|
||||||
|
|
||||||
|
run: clean ${PROGRAM}
|
||||||
|
./${PROGRAM}
|
||||||
|
|
||||||
|
# tar the current directory
|
||||||
|
MY_DIR = `basename ${PWD}`
|
||||||
|
tar: clean_all
|
||||||
|
@echo "Tar the directory: " ${MY_DIR}
|
||||||
|
@cd .. ;\
|
||||||
|
tar cf ${MY_DIR}.tar ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
# tar cf `basename ${PWD}`.tar *
|
||||||
|
|
||||||
|
doc:
|
||||||
|
doxygen Doxyfile
|
||||||
|
|
||||||
|
#########################################################################
|
||||||
|
|
||||||
|
.cpp.o:
|
||||||
|
$(CXX) -c $(CXXFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.c.o:
|
||||||
|
$(CC) -c $(CFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.f.o:
|
||||||
|
$(F77) -c $(FFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
##################################################################################################
|
||||||
|
# # some tools
|
||||||
|
# # Cache behaviour (CXXFLAGS += -g tracks down to source lines)
|
||||||
|
# cache: ${PROGRAM}
|
||||||
|
# valgrind --tool=callgrind --simulate-cache=yes ./$^
|
||||||
|
# # kcachegrind callgrind.out.<pid> &
|
||||||
|
#
|
||||||
|
# # Check for wrong memory accesses, memory leaks, ...
|
||||||
|
# # use smaller data sets
|
||||||
|
# mem: ${PROGRAM}
|
||||||
|
# valgrind -v --leak-check=yes --tool=memcheck --undef-value-errors=yes --track-origins=yes --log-file=$^.addr.out --show-reachable=yes ./$^
|
||||||
|
#
|
||||||
|
# # Simple run time profiling of your code
|
||||||
|
# # CXXFLAGS += -g -pg
|
||||||
|
# # LINKFLAGS += -pg
|
||||||
|
# prof: ${PROGRAM}
|
||||||
|
# ./$^
|
||||||
|
# gprof -b ./$^ > gp.out
|
||||||
|
# # kprof -f gp.out -p gprof &
|
||||||
|
#
|
||||||
|
|
||||||
|
|
||||||
|
mem: inspector
|
||||||
|
prof: amplifier
|
||||||
|
cache: amplifier
|
||||||
|
|
||||||
|
gap_par_report:
|
||||||
|
${CXX} -c -guide -parallel $(SOURCES) 2> gap.txt
|
||||||
|
|
||||||
|
# GUI for performance report
|
||||||
|
amplifier: ${PROGRAM}
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/yama/ptrace_scope
|
||||||
|
# alternatively to the solution abouve:
|
||||||
|
#edit file /etc/sysctl.d/10-ptrace.conf and set variable kernel.yama.ptrace_scope variable to 0 .
|
||||||
|
vtune-gui &
|
||||||
|
|
||||||
|
# GUI for Memory and Thread analyzer (race condition)
|
||||||
|
inspector: ${PROGRAM}
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/yama/ptrace_scope
|
||||||
|
inspxe-gui &
|
||||||
|
|
||||||
|
advisor:
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/yama/ptrace_scope
|
||||||
|
vtune-gui &
|
||||||
|
|
||||||
|
icc-info:
|
||||||
|
icpc -# main.cpp
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
0
sheet3/Neues Textdokument.txt
Normal file
0
sheet3/Neues Textdokument.txt
Normal file
176
sheet3/ONEAPI_default.mk
Normal file
176
sheet3/ONEAPI_default.mk
Normal file
|
|
@ -0,0 +1,176 @@
|
||||||
|
# Basic Defintions for using INTEL compiler suite sequentially
|
||||||
|
# requires setting of COMPILER=ONEAPI_
|
||||||
|
|
||||||
|
# https://software.intel.com/content/www/us/en/develop/tools/oneapi/components/onemkl/link-line-advisor.html
|
||||||
|
# requires
|
||||||
|
# source /opt/intel/oneapi/setvars.sh
|
||||||
|
# on AMD: export MKL_DEBUG_CPU_TYPE=5
|
||||||
|
|
||||||
|
#BINDIR = /opt/intel/oneapi/compiler/latest/linux/bin/
|
||||||
|
#MKL_ROOT = /opt/intel/oneapi/mkl/latest/
|
||||||
|
#export KMP_AFFINITY=verbose,compact
|
||||||
|
|
||||||
|
CC = ${BINDIR}icc
|
||||||
|
CXX = ${BINDIR}dpcpp
|
||||||
|
F77 = ${BINDIR}ifort
|
||||||
|
LINKER = ${CXX}
|
||||||
|
|
||||||
|
## Compiler flags
|
||||||
|
WARNINGS = -Wall -Weffc++ -Woverloaded-virtual -Wfloat-equal -Wshadow -pedantic
|
||||||
|
WARNINGS += -Wpessimizing-move -Wredundant-move
|
||||||
|
#-wd2015,2012,2014 -wn3
|
||||||
|
# -Winline -Wredundant-decls -Wunreachable-code
|
||||||
|
# -qopt-subscript-in-range
|
||||||
|
# -vec-threshold0
|
||||||
|
|
||||||
|
CXXFLAGS += -O3 -std=c++17 ${WARNINGS}
|
||||||
|
#CXXFLAGS += -DMKL_ILP64 -I"${MKLROOT}/include"
|
||||||
|
#CXXFLAGS += -DMKL_ILP32 -I"${MKLROOT}/include"
|
||||||
|
LINKFLAGS += -O3
|
||||||
|
|
||||||
|
# interprocedural optimization
|
||||||
|
CXXFLAGS += -ipo
|
||||||
|
LINKFLAGS += -ipo
|
||||||
|
LINKFLAGS += -flto
|
||||||
|
|
||||||
|
# annotated Assembler file
|
||||||
|
ANNOTED = -fsource-asm -S
|
||||||
|
|
||||||
|
#architecture
|
||||||
|
CPU = -march=core-avx2
|
||||||
|
#CPU += -mtp=zen
|
||||||
|
# -xCORE-AVX2
|
||||||
|
# -axcode COMMON-AVX512 -axcode MIC-AVX512 -axcode CORE-AVX512 -axcode CORE-AVX2
|
||||||
|
CXXFLAGS += ${CPU}
|
||||||
|
LINKFLAGS += ${CPU}
|
||||||
|
|
||||||
|
# use MKL by INTEL
|
||||||
|
# https://software.intel.com/content/www/us/en/develop/tools/oneapi/components/onemkl/link-line-advisor.html
|
||||||
|
# sequential MKL
|
||||||
|
# use the 32 bit interface (LP64) instead of 64 bit interface (ILP64)
|
||||||
|
CXXFLAGS += -qmkl=sequential -UMKL_ILP64
|
||||||
|
LINKFLAGS += -O3 -qmkl=sequential -lmkl_intel_lp64 -lmkl_sequential -lmkl_core -lpthread
|
||||||
|
#LINKFLAGS += -O3 -lmkl_intel_lp64 -lmkl_sequential -lmkl_core -lpthread
|
||||||
|
|
||||||
|
# shared libs: https://aur.archlinux.org/packages/intel-oneapi-compiler-static
|
||||||
|
# install intel-oneapi-compiler-static
|
||||||
|
# or
|
||||||
|
LINKFLAGS += -shared-intel
|
||||||
|
|
||||||
|
|
||||||
|
OPENMP = -qopenmp
|
||||||
|
CXXFLAGS += ${OPENMP}
|
||||||
|
LINKFLAGS += ${OPENMP}
|
||||||
|
|
||||||
|
|
||||||
|
# profiling tools
|
||||||
|
#CXXFLAGS += -pg
|
||||||
|
#LINKFLAGS += -pg
|
||||||
|
# -vec-report=3
|
||||||
|
# -qopt-report=5 -qopt-report-phase=vec -qopt-report-phase=openmp
|
||||||
|
# -guide -parallel
|
||||||
|
# -guide-opts=string -guide-par[=n] -guide-vec[=n]
|
||||||
|
# -auto-p32 -simd
|
||||||
|
|
||||||
|
# Reports: https://software.intel.com/en-us/articles/getting-the-most-out-of-your-intel-compiler-with-the-new-optimization-reports
|
||||||
|
#CXXFLAGS += -qopt-report=5 -qopt-report-phase=vec,par
|
||||||
|
#CXXFLAGS += -qopt-report=5 -qopt-report-phase=cg
|
||||||
|
# Redirect report from *.optrpt to stderr
|
||||||
|
# -qopt-report-file=stderr
|
||||||
|
# Guided paralellization
|
||||||
|
# -guide -parallel
|
||||||
|
# -guide-opts=string -guide-par[=n] -guide-vec[=n]
|
||||||
|
# -auto-p32 -simd
|
||||||
|
|
||||||
|
## run time checks
|
||||||
|
# https://www.intel.com/content/www/us/en/develop/documentation/fortran-compiler-oneapi-dev-guide-and-reference/top/compiler-reference/compiler-options/offload-openmp-and-parallel-processing-options/par-runtime-control-qpar-runtime-control.html
|
||||||
|
|
||||||
|
|
||||||
|
default: ${PROGRAM}
|
||||||
|
|
||||||
|
${PROGRAM}: ${OBJECTS}
|
||||||
|
$(LINKER) $^ ${LINKFLAGS} -o $@
|
||||||
|
|
||||||
|
clean:
|
||||||
|
rm -f ${PROGRAM} ${OBJECTS} *.optrpt
|
||||||
|
|
||||||
|
clean_all:: clean
|
||||||
|
@rm -f *_ *~ *.bak *.log *.out *.tar
|
||||||
|
|
||||||
|
run: clean ${PROGRAM}
|
||||||
|
./${PROGRAM}
|
||||||
|
|
||||||
|
# tar the current directory
|
||||||
|
MY_DIR = `basename ${PWD}`
|
||||||
|
tar: clean_all
|
||||||
|
@echo "Tar the directory: " ${MY_DIR}
|
||||||
|
@cd .. ;\
|
||||||
|
tar cf ${MY_DIR}.tar ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
# tar cf `basename ${PWD}`.tar *
|
||||||
|
|
||||||
|
doc:
|
||||||
|
doxygen Doxyfile
|
||||||
|
|
||||||
|
#########################################################################
|
||||||
|
|
||||||
|
.cpp.o:
|
||||||
|
$(CXX) -c $(CXXFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.c.o:
|
||||||
|
$(CC) -c $(CFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.f.o:
|
||||||
|
$(F77) -c $(FFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
##################################################################################################
|
||||||
|
# some tools
|
||||||
|
# Cache behaviour (CXXFLAGS += -g tracks down to source lines)
|
||||||
|
# https://software.intel.com/content/www/us/en/develop/documentation/vtune-help/top/analyze-performance/microarchitecture-analysis-group/memory-access-analysis.html
|
||||||
|
|
||||||
|
mem: inspector
|
||||||
|
prof: vtune
|
||||||
|
cache: inspector
|
||||||
|
|
||||||
|
gap_par_report:
|
||||||
|
${CXX} -c -guide -parallel $(SOURCES) 2> gap.txt
|
||||||
|
|
||||||
|
# GUI for performance report
|
||||||
|
amplifier: ${PROGRAM}
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/yama/ptrace_scope
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/perf_event_paranoid
|
||||||
|
amplxe-gui &
|
||||||
|
|
||||||
|
# GUI for Memory and Thread analyzer (race condition)
|
||||||
|
inspector: ${PROGRAM}
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/yama/ptrace_scope
|
||||||
|
# inspxe-gui &
|
||||||
|
vtune-gui ./${PROGRAM} &
|
||||||
|
|
||||||
|
advisor:
|
||||||
|
source /opt/intel/oneapi/advisor/2021.2.0/advixe-vars.sh
|
||||||
|
# /opt/intel/oneapi/advisor/latest/bin64/advixe-gui &
|
||||||
|
advisor --collect=survey ./${PROGRAM}
|
||||||
|
# advisor --collect=roofline ./${PROGRAM}
|
||||||
|
advisor --report=survey --project-dir=./ src:r=./ --format=csv --report-output=./out/survey.csv
|
||||||
|
|
||||||
|
vtune:
|
||||||
|
echo 0 | sudo tee /proc/sys/kernel/yama/ptrace_scope
|
||||||
|
# https://software.intel.com/en-us/articles/intel-advisor-2017-update-1-what-s-new
|
||||||
|
export ADVIXE_EXPERIMENTAL=roofline
|
||||||
|
vtune -collect hotspots ./${PROGRAM}
|
||||||
|
vtune -report hotspots -r r000hs > vtune.out
|
||||||
|
# vtune-gui ./${PROGRAM} &
|
||||||
|
|
||||||
|
icc-info:
|
||||||
|
icpc -# main.cpp
|
||||||
|
|
||||||
|
# MKL on AMD
|
||||||
|
# https://www.computerbase.de/2019-11/mkl-workaround-erhoeht-leistung-auf-amd-ryzen/
|
||||||
|
#
|
||||||
|
# https://sites.google.com/a/uci.edu/mingru-yang/programming/mkl-has-bad-performance-on-an-amd-cpu
|
||||||
|
# export MKL_DEBUG_CPU_TYPE=5
|
||||||
|
# export MKL_NUM_THRAEDS=1
|
||||||
|
# export MKL_DYNAMIC=false
|
||||||
|
# on Intel compiler
|
||||||
|
# http://publicclu2.blogspot.com/2013/05/intel-complier-suite-reference-card.html
|
||||||
94
sheet3/PGI_default.mk
Normal file
94
sheet3/PGI_default.mk
Normal file
|
|
@ -0,0 +1,94 @@
|
||||||
|
# Basic Defintions for using PGI-compiler suite sequentially
|
||||||
|
# requires setting of COMPILER=PGI_
|
||||||
|
# OPTIRUN = optirun
|
||||||
|
|
||||||
|
|
||||||
|
CC = pgcc
|
||||||
|
CXX = pgc++
|
||||||
|
F77 = pgfortran
|
||||||
|
LINKER = ${CXX}
|
||||||
|
|
||||||
|
#LINKFLAGS += -llapack -lblas
|
||||||
|
# on mephisto:
|
||||||
|
#CXXFLAGS += -I/share/apps/atlas/include
|
||||||
|
#LINKFLAGS += -L/share/apps/atlas/lib
|
||||||
|
#LINKFLAGS += -lcblas -latlas
|
||||||
|
|
||||||
|
#LINKFLAGS += -lblas
|
||||||
|
# Der <cblas.h> Header muss mit extern "C" versehen werden, damit g++ alles findet.
|
||||||
|
|
||||||
|
WARNINGS = -Minform=warn
|
||||||
|
# -Wall -pedantic -Wextra -Weffc++ -Woverloaded-virtual -W -Wfloat-equal -Wshadow -Wredundant-decls
|
||||||
|
# -pedantic -Wunreachable-code -Wextra -Winline
|
||||||
|
# -Wunreachable-code
|
||||||
|
|
||||||
|
#PGI_PROFILING = -Minfo=ccff,loop,vect,opt,intensity,mp,accel
|
||||||
|
PGI_PROFILING = -Minfo=ccff,accel,ipa,loop,lre,mp,opt,par,unified,vect,intensity
|
||||||
|
# -Minfo
|
||||||
|
# -Mprof=time
|
||||||
|
# -Mprof=lines
|
||||||
|
# take care with option -Msafeptr
|
||||||
|
CXXFLAGS += -O3 -std=c++17 ${WARNINGS}
|
||||||
|
#CXXFLAGS += -O3 -std=c++11 -DNDEBUG ${PGI_PROFILING} ${WARNINGS}
|
||||||
|
# -fastsse -fargument-noalias ${WARNINGS} -msse3 -vec-report=3
|
||||||
|
|
||||||
|
default: ${PROGRAM}
|
||||||
|
|
||||||
|
${PROGRAM}: ${OBJECTS}
|
||||||
|
$(LINKER) $^ ${LINKFLAGS} -o $@
|
||||||
|
|
||||||
|
clean:
|
||||||
|
@rm -f ${PROGRAM} ${OBJECTS}
|
||||||
|
|
||||||
|
clean_all:: clean
|
||||||
|
@rm -f *_ *~ *.bak *.log *.out *.tar
|
||||||
|
|
||||||
|
run: clean ${PROGRAM}
|
||||||
|
./${PROGRAM}
|
||||||
|
|
||||||
|
# tar the current directory
|
||||||
|
MY_DIR = `basename ${PWD}`
|
||||||
|
tar: clean_all
|
||||||
|
@echo "Tar the directory: " ${MY_DIR}
|
||||||
|
@cd .. ;\
|
||||||
|
tar cf ${MY_DIR}.tar ${MY_DIR} *default.mk ;\
|
||||||
|
cd ${MY_DIR}
|
||||||
|
# tar cf `basename ${PWD}`.tar *
|
||||||
|
|
||||||
|
doc:
|
||||||
|
doxygen Doxyfile
|
||||||
|
|
||||||
|
#########################################################################
|
||||||
|
|
||||||
|
.cpp.o:
|
||||||
|
$(CXX) -c $(CXXFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.c.o:
|
||||||
|
$(CC) -c $(CFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
.f.o:
|
||||||
|
$(F77) -c $(FFLAGS) -o $@ $<
|
||||||
|
|
||||||
|
##################################################################################################
|
||||||
|
# # some tools
|
||||||
|
# # Simple run time profiling of your code
|
||||||
|
# # CXXFLAGS += -g -pg
|
||||||
|
# # LINKFLAGS += -pg
|
||||||
|
|
||||||
|
|
||||||
|
# Profiling options PGI, see: pgcollect -help
|
||||||
|
# CPU_PROF = -allcache
|
||||||
|
CPU_PROF = -time
|
||||||
|
# GPU_PROF = -cuda=gmem,branch,cc13 -cudainit
|
||||||
|
#GPU_PROF = -cuda=branch:cc20
|
||||||
|
#
|
||||||
|
PROF_FILE = pgprof.out
|
||||||
|
|
||||||
|
cache: prof
|
||||||
|
|
||||||
|
prof: ${PROGRAM}
|
||||||
|
${OPTIRUN} ${BINDIR}pgcollect $(CPU_PROF) ./$^
|
||||||
|
${OPTIRUN} ${BINDIR}pgprof -exe ./$^ $(PROF_FILE) &
|
||||||
|
|
||||||
|
info:
|
||||||
|
pgaccelinfo -v
|
||||||
Loading…
Add table
Add a link
Reference in a new issue