Simon Fraser University CMPT 295 CMPT295 - Assignment 9

Objectives:
 Benchmarking “branch reduction” optimization (also called “branching minimization”
optimization) using the benchmarking tool introduced in Lab 5
 Microbenchmarking array search versus linked list search using the microbenchmarking
tool introduced in Lab 6
 “Loop unrolling” optimization
 Locality and caching
Submission:
 Submit your document called Assignment_9.pdf, which must include your answers to all
of the questions in Assignment 9.
o Add your full name and student number at the top of the first page of your
document.
 Submit your assignment Assignment_9.pdf on CourSys by Friday, Dec. 3 Monday, Dec. 6
at 23:59:59.
 Late assignments will receive a grade of 0, but they will be marked (if they are submitted
before the solutions are posted on Monday) in order to provide feedback to the
student.
Marking scheme:
 Question 1 will be marked for completeness.
 Questions 2, 3, 4 and 5 will be marked for correctness.
 The amount of marks for each question is indicated as part of the question.
 A solution will be posted on Monday after the due date.
1. [2 marks] Lab 6 data sheet and graph