Instructor: Prof. Chen Ding
Office
Hours: Fri. 11am- 12pm
Office: CSB 710 Phone: 275-1373
Email: cding@cs.rochester.edu
TA: Xipeng Shen
Office Hours: Mon.+Wed. 10-11am
Office: CSB 630 Phone: 275-2569
Email: xshen@cs.rochester.edu
Update:
Nov. 6: Optmizor
Competition.
See the project webpage.
Click here for the current best results.
Nov. 20: Written Assignment I is posted below.
(due on Dec. 1st midnight)
Dec.
4: Written Assignment II is posted below. (due on Dec.
11st midnight)
Dec. 4: The final ranking of
compiler contest
is posted.
Click here.
Dec. 4: Secrete benchmarks
for evaluation of compilers can be downloaded
here.
Dec.
11: Final exam coverage is posted below.
Dec.
17: Phil Michalak and Maksim Orlovich's slides
for the fiinal compiler are posted as the following links: Phil
Michalak; Maksim
Orlovich.
Written Assignments:
Assignment I: (due
on Dec.
1st midnight) This homework lets you practice the required
material in Chapters/Sections 2, 3 (except 3.4), 5.1-5.5, 6.3, 7.2,
8.1-8.6, and 11.2. Read the textbook carefully. The answers
may be in the book.
Assignment II: (due on Dec. 11st midnight) Question. Lambda calculus. Draw the syntax tree for the following lambda expression. For call-by-value and call-by-name semantics, give the complete content of the environment at the time when subexpressions '(x a)' and '(+ a a)' are evaluated. If an environment has more than one bindings, indicate the order in which they are searched for a particular name. Give the result of the evaluation.
- Exercise 2.5.
- Let h(x,y)=ax-by, where a and b are real constants, x and y are real variables, L<= x, y <=U (L, U are real numbers and L<U ), and x<y. Give and prove the tight upper-bound of h(x,y) .
- Give an example loop nest where node splitting improves the fine-grain parallelism.
- For a program of n statements, what is the maximal number of control dependences between statements?
- Exercise 8.4.