Difference between revisions of "Fall 2015 SPO600 Compiler Options Presentation"

From CDOT Wiki
Jump to: navigation, search
(Topics)
(Topics: Added resource links)
 
(One intermediate revision by one other user not shown)
Line 67: Line 67:
 
| -fcse-follow-jumps|| || || ||
 
| -fcse-follow-jumps|| || || ||
 
|-
 
|-
| -fcse-skip-blocks|| Joseph Jaku || || ||
+
| -fcse-skip-blocks|| Joseph Jaku || || ||[http://jjakuseneca.blogspot.ca/2015/10/compiler-optimization-options.html Blog Post]
 
|-
 
|-
| -fdce|| Joseph Jaku || || ||
+
| -fdce|| Joseph Jaku || || ||[http://jjakuseneca.blogspot.ca/2015/10/compiler-optimization-options.html Blog Post]
 
|-
 
|-
 
| -fdelayed-branch|| || || ||
 
| -fdelayed-branch|| || || ||
Line 231: Line 231:
 
| -fpredictive-commoning|| || || ||
 
| -fpredictive-commoning|| || || ||
 
|-
 
|-
| -fprefetch-loop-arrays||Jayme Laso-Barros|| || ||
+
| -fprefetch-loop-arrays||Jayme Laso-Barros|| ||[https://gcc.gnu.org/onlinedocs/gcc-5.2.0/gcc/Optimize-Options.html GCC 5.2 Manual: Section 3.10]||
 
|-
 
|-
 
| -fprofile-report|| || || ||
 
| -fprofile-report|| || || ||
Line 261: Line 261:
 
| -freorder-blocks-and-partition|| || || ||
 
| -freorder-blocks-and-partition|| || || ||
 
|-
 
|-
| -freorder-functions||Jayme Laso-Barros|| || ||
+
| -freorder-functions||Jayme Laso-Barros|| ||[https://gcc.gnu.org/onlinedocs/gcc-5.2.0/gcc/Optimize-Options.html GCC 5.2 Manual: Section 3.10]||
 
|-
 
|-
 
| -frerun-cse-after-loop|| || || ||
 
| -frerun-cse-after-loop|| || || ||

Latest revision as of 19:42, 6 October 2015


Assignment

  1. Select two unrelated compiler options, below, by placing your name in the "Student" column (first come, first served - one student per topic).
  2. During week 3, research the topics and prepare a 3- to 5-minute presentation to teach the class.
  3. Be prepared to teach this presentation during week 4. You may want to draw whiteboard diagrams, use presentation slides, or have a 1-page handout. Please avoid taking more than 5 minutes in total for your presentation.

Deadlines

  • Topic selection: 1:30 pm, Tuesday, September 22 (End of the scheduled Tuesday class in Week 3)
  • Presentation ready: 11:40 am, Tuesday, September 29 (You must be prepared to present before the scheduled Tuesday class in Week 4)

FAQ

  • Q: How much detail should the presentation include?
    • A: Each of these topics is pretty small and straightforward. Provide some type of resource for future reference -- a link to an existing web resource, a 1-page handout, or a blog post or wiki page about the topic. Your presentation should include:
      1. The Option: The compiler option as described in the gcc documentation - What it is and why it is provided.
      2. The Impact: Write and compile code that is impacted by this particular compiler option. Identify the characteristics that must be present in the source code in order to benefit from this compiler option (for example: double-precision math, use of arrays, pointer math). Describe the effect of the option on performance, code size, and code readability. If there are any problems or dangers with this option, identify them.
      3. Recommendation: Make a recommendation on when this compiler option should be used and when it should not be used.
  • Q: How will this be marked?
    • A: In week 4, I will ask you to write a short blog post summarizing your presentation.
  • Q: Can we work with others preparing our topic?
    • A: Yes. In many cases, one topic is complimentary to another topic, and it would be great if you coordinated on your presentations.
  • Q: Are there any classes scheduled during Week 3?
    • A: No. Your professor will be at Linaro Connect. However, the classroom is reserved for our use, and you're welcome to use it to discuss your presentation ideas with classmates.

Topics

Compiler Option Presenter Name (Leave blank) Links to resources (Wiki page, handout, web resources) Link to blog post on this topic
-faggressive-loop-optimizations
-fassociative-math Kevin Paiva
-fauto-inc-dec
-fbranch-probabilities
-fbranch-target-load-optimize
-fbranch-target-load-optimize2
-fbtr-bb-exclusive
-fcaller-saves
-fcheck-data-deps
-fcombine-stack-adjustments
-fconserve-stack
-fcompare-elim Kevin Paiva
-fcprop-registers
-fcrossjumping
-fcse-follow-jumps
-fcse-skip-blocks Joseph Jaku Blog Post
-fdce Joseph Jaku Blog Post
-fdelayed-branch
-fdelete-null-pointer-checks Joel Aro GCC Optimize Options
-fdevirtualize Suk-Joong Han https://gcc.gnu.org/onlinedocs/gcc/Optimize-Options.html
-fdevirtualize-speculatively
-fdse
-fearly-inlining
-fipa-sra
-ffat-lto-objects
-ffast-math Miguel Dizon https://gcc.gnu.org/wiki/FloatingPointMath
-ffinite-math-only
-ffloat-store
-fexcess-precision=style
-fforward-propagate
-ffp-contract=style
-ffunction-sections
-fgcse
-fgcse-after-reload
-fgcse-las
-fgcse-lm
-fgraphite-identity
-fgcse-sm
-fhoist-adjacent-loads
-fif-conversion
-fif-conversion2
-findirect-inlining
-finline-functions Kirill Lepetinskiy GCC Docs Blog Post
-finline-functions-called-once
-finline-limit=n
-finline-small-functions Yehoshua Ghitis
-fipa-cp
-fipa-cp-clone
-fipa-pta
-fipa-profile
-fipa-pure-const
-fipa-reference
-fira-algorithm=algorithm
-fira-region=region
-fira-hoist-pressure
-fira-loop-pressure
-fno-ira-share-save-slots
-fno-ira-share-spill-slots
-fira-verbose=n
-fisolate-erroneous-paths-dereference
-fisolate-erroneous-paths-attribute
-fivopts
-fkeep-inline-functions
-fkeep-static-consts
-flive-range-shrinkage
-floop-block Dmytro Yegorov -floop-block Blog Post
-floop-interchange Dmytro Yegorov -floop-interchange Blog Post
-floop-strip-mine
-floop-nest-optimize
-floop-parallelize-all
-flto
-flto-compression-level
-flto-partition=alg
-flto-report
-flto-report-wpa
-fmerge-all-constants
-fmerge-constants
-fmodulo-sched
-fmodulo-sched-allow-regmoves
-fmove-loop-invariants Gaurav Patel https://en.wikipedia.org/wiki/Loop-invariant_code_motion
-fno-branch-count-reg
-fno-defer-pop Andy Cooc
-fno-function-cse Andy Cooc
-fno-guess-branch-probability
-fno-inline Donald Nguyen
-fno-math-errno
-fno-sched-interblock
-fno-sched-spec
-fno-signed-zeros Suk-Joong Han https://en.wikipedia.org/wiki/Signed_zero
-fno-toplevel-reorder
-fno-trapping-math
-fno-zero-initialized-in-bss
-fomit-frame-pointer
-foptimize-sibling-calls
-fpartial-inlining
-fpeel-loops James Shin
-fpredictive-commoning
-fprefetch-loop-arrays Jayme Laso-Barros GCC 5.2 Manual: Section 3.10
-fprofile-report
-fprofile-correction
-fprofile-dir=path
-fprofile-generate
-fprofile-generate=path
-fprofile-use Ramanan Manokaran
-fprofile-use=path
-fprofile-values
-fprofile-reorder-functions
-freciprocal-math
-free
-frename-registers
-freorder-blocks Ramanan Manokaran
-freorder-blocks-and-partition
-freorder-functions Jayme Laso-Barros GCC 5.2 Manual: Section 3.10
-frerun-cse-after-loop
-freschedule-modulo-scheduled-loops
-frounding-math
-fsched2-use-superblocks
-fsched-pressure
-fsched-spec-load
-fsched-spec-load-dangerous
-fsched-stalled-insns-dep[=n]
-fsched-stalled-insns[=n]
-fsched-group-heuristic
-fsched-critical-path-heuristic
-fsched-spec-insn-heuristic
-fsched-rank-heuristic
-fsched-last-insn-heuristic
-fsched-dep-count-heuristic
-fschedule-insns
-fschedule-insns2
-fsection-anchors
-fselective-scheduling / -fselective-scheduling-2
-fsel-sched-pipelining / -fsel-sched-pipelining-outer-loops
-fshrink-wrap
-fsignaling-nans
-fsingle-precision-constant
-fsplit-ivs-in-unroller
-fsplit-wide-types Shirwa Egal
-fstack-protector / -fstack-protector-all / -fstack-protector-strong
-fstrict-aliasing
-fstrict-overflow
-fthread-jumps
-ftracer
-ftree-bit-ccp
-ftree-builtin-call-dce
-ftree-ccp
-ftree-ch
-ftree-coalesce-inline-vars
-ftree-coalesce-vars
-ftree-copy-prop
-ftree-copyrename
-ftree-dce Gaurav Patel https://en.wikipedia.org/wiki/Dead_code_elimination
-ftree-dominator-opts
-ftree-dse Shirwa Egal
-ftree-forwprop
-ftree-fre
-ftree-loop-if-convert Donald Nguyen
-ftree-loop-if-convert-stores Kirill Lepetinskiy GCC Docs On CMOV Blog Post
-ftree-loop-im
-ftree-phiprop
-ftree-loop-distribution Nitish Bajaj
-ftree-loop-distribute-patterns
-ftree-loop-ivcanon
-ftree-loop-linear
-ftree-loop-optimize
-ftree-loop-vectorize
-ftree-parallelize-loops=n
-ftree-pre
-ftree-partial-pre
-ftree-pta
-ftree-reassoc
-ftree-sink
-ftree-slsr
-ftree-sra
-ftree-switch-conversion
-ftree-tail-merge
-ftree-ter
-ftree-vectorize
-ftree-vrp Nitish Bajaj
-funit-at-a-time
-funroll-all-loops Yehoshua Ghitis
-funroll-loops Joel Aro Loop Unrolling
-funsafe-loop-optimizations
-funsafe-math-optimizations James Shin
-funswitch-loops Miguel Dizon
-fvariable-expansion-in-unroller
-fvect-cost-model
-fvpt
-fweb
-fwhole-program