New version page

CMU CS 15745 - Task 2

Documents in this Course
Lecture

Lecture

14 pages

Lecture

Lecture

19 pages

Lecture

Lecture

8 pages

Lecture

Lecture

5 pages

Lecture

Lecture

6 pages

lecture

lecture

17 pages

Lecture 3

Lecture 3

12 pages

Lecture

Lecture

17 pages

Lecture

Lecture

18 pages

lecture

lecture

14 pages

lecture

lecture

8 pages

lecture

lecture

5 pages

Lecture

Lecture

19 pages

lecture

lecture

10 pages

Lecture

Lecture

20 pages

Lecture

Lecture

8 pages

Lecture

Lecture

7 pages

lecture

lecture

59 pages

Lecture

Lecture

10 pages

Handout

Handout

18 pages

Load more
Upgrade to remove ads

This preview shows page 1 out of 2 pages.

Save
View Full Document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Upgrade to remove ads
Unformatted text preview:

15-745 Advanced Optimizing Compilers: Task 2Due 2/23/2006 5pmFebruary 10, 20061 Task DescriptionIn this assignment, you will implement at least one classical loop optimization.2 Task SpecificsPlease implement loop-invariant code motion (hoisting) as described in class. Note that this op-timization uses reaching definitions and liveness, which you should have already implemented inTask 1. Implement the optimizations on top of your existing compiler from Task 1. Implementingthis optimization will be sufficient to earn you full credit on this assignment.Additionally, we will be running a small contest during this assignment. There are eight “challengetests” (listed below) from the big subdirectory in the test suite that we will use to evaluate yourcompiler. Your performance relative to other groups in the class will determine in what orderyou get to select time slots for your project proposal presentation. You may implement any otherloop-based optimizations you want (Induction Variable Elimination, B ounds Check Elimination,Null-Check Elimination, etc). We will be posting a running leaderboard, as well as instructions forsubmitting your times, during the second week of the assignment. Details will be announced viathe website and RSS feed.• l3 test2.l3: prime number generation. simple arrays• l3 test3.l3: cellular automata. good array test• l3 test8.l3: designed specifically for bounds-check elimination• l3 test10.l3: simple loops that ac ce ss an array• l3 test11.l3: pi to 1000 digits. simple array access, plus CSE• l3 test13.l3: n-queens. array and struct element access• l3 test14.l3: n2-queens. much more demanding• l3 test20.l3: busy arrays1Use the algorithm descriptions given in class, or in Muchnick. You may work in groups of one ortwo (we suggest two). Once you have completed the task, please turn in (by email to [email protected])the a tarball of your modified source code and the results.txt file from a full test suite run (usingthe original Task 0 test


View Full Document
Download Task 2
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Task 2 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Task 2 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?