[CSC 435] The Last Midterm Problem

[Andrew J. Pounds]

So many of you have struggled with the last midterm problem and finding 
good compiler flags that work.  Let's see if I can simplify and clarify...

1. For your base run compile with -O0

2. Now pick three flags for your optimized run (not -O, -O1, -O2, -O3, 
-Os, -Og, -Ofast).  Then create a performance plot with two curves -- 
one for your baseline and one for your optimized result that was built 
using all of the flags you chose.  Indicate on the plot which flags you 
used.

As an example, on an old Xeon processor using the 11.2.0 compilers I got 
the following results...

No optimization...

    1000   554.267822
    2000   559.134399
    3000   561.197144
    4000   559.307434
    5000   561.014465
    6000   561.945557
    7000   563.093933
    8000   562.336792
    9000   561.579956
  10000   561.907227

With a selection of optimization/architecture compiler flags...

    1000   581.106140
    2000   586.146118
    3000   586.070557
    4000   581.988281
    5000   581.462219
    6000   583.838684
    7000   586.284851
    8000   586.672729
    9000   585.067749
  10000   587.153320


-- 
*/Andrew J. Pounds, Ph.D./*
/Professor of Chemistry and Computer Science/
/Director of the Computational Science Program/
/Mercer University/
/1501 Mercer University Drive, Macon, GA 31207 /
/(478) 301-5627/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://theochem.mercer.edu/pipermail/csc435/attachments/20220312/15d22c1c/attachment.html>