Fall 2005

Course Syllabus, Grading Sheet Grade Statistics

EXAMINATIONS:

Test I, 10/07/05 (Friday), 8:00AM - 8:50AM, Broun 306, Statistics

This test includes Chapters 1, 2 and 3. Specifically, computer history (only what is in class notes), basic understanding and use of instruction set, register saving and restoring, two's complement arithmetic. Use of text-book, class presentations, notes, past homeworks and solutions is permitted.

Test II, 11/09/05 (Wednesday), 8:00AM - 8:50AM, Broun 306, Statistics

This test includes Chapters 4 and 5, performance, datapath and control. Use of text-book, class presentations, notes, past homeworks and solutions is permitted.

Final Exam, 12/09/05 (Friday), 11:00AM - 1:30PM, Broun 306, Statistics

Text book, notes and course website material permitted. While a student is responsible for the entire syllabus, the following hints might help the preparation. The exam will contain five multi-part questions (all to be attempted), each carrying 5 points. Specific topics of the questions are:

1. Cache memories

2. Pipeline hazards

3. Definitions and basic ideas in advanved architectures (superscalar, VLIW, etc.)

LECTURES: See webpages of most recent years.

HOMEWORKS:

Help and Consultation:

VHDL and Project: Alok Doshi, doshias@auburn.edu, Broun 309, x41864, available MWF 9:30-10:30AM

Other homeworks: Fei Hu, hufei01@auburn.edu, Broun 363, x41861

Homework 1, Problems 1.29 through 1.45, and 1.56, assigned 08/19/05, due 09/02/05.

Homework 2, Problems 2.30 and 2.31, assigned 08/26/05, due 09/09/05.

Homework 3, assigned 09/02/05, due 09/16/05.

Homework 4, assigned 09/09/05, due 09/23/05.

Homework 5, Problems 2.37, 2.38 and 3.7, assigned 09/16/05, due 09/30/05.

Homework 6, assigned 9/23/05, due 10/07/05.

Note: Use 8-bit two's complement representation for these problems.

Problem 1: Write decimal integers, 77, -77, 15, -15, in 8-bit two's complement form.

Problem 2: Evaluate 77(ten) + 77(ten).

Problem 3: Evaluate 77(ten) - 15(ten).

Problem 4: Evaluate the product -77 x 15 using the Booth multiplication algorithm.

Problem 5: Perform the division 77/15 using the non-restoring binary division algorithm.

Homework 7, Problem 3.43, assigned 9/30/05, due 10/14/05.

Homework 8, Problems 5.8 and 5.28, assigned 10/14/05, due 10/28/05.

Homework 9, Problems 5.35 and 5.51, assigned 10/21/05, due 11/4/05.

Homework 10, Problems 4.7, 4.8 and 4.11, assigned 10/28/05, due 11/11/05.

Homework 11, Problems 6.3 and 6.21, assigned 11/4/05, due 11/18/05.

TERM PAPERS AND CLASS PRESENTATIONS:

Important: Unsatisfactory completion of this part of the course can result in up to one letter grade reduction. "Satisfactory" for 6200 means talk preparation and presentation. For 5200, "satisfactory" means attendance in at least four out of six presentations.

Instructions: There will be no term paper required. Each class presentation will have 20-25 minute duration and will use up to 16 (max) powerpoint slides including the title and conclusion slides. The talk must define terms and present main concepts in the simplest possible way. Relevant formulas should be given and the use of simple diagrams and graphs is encouraged. Most relevant references should be included. Questions and discussion during presentation are encouraged. Slides will be placed at the course website, preferably before the talk. Topic assignments:

Anbumony: Superscalars, 10/24/05, slides

Chen: Multi-processor SOC, 11/14/05, slides

Jain: Virtual memory, 11/14/05, slides

Ramamurthy: CISC, 11/11/05, slides

Sheth: Performance and power benchmarks, 10/24/05, slides

Wang: VLIW, 11/11/05, slides

PREVIOUS OFFERING BY PROF. AGRAWAL:

Fall 2004