11/19/14 In question 3 HW6, the figure and page number should be

"Show the virtual to physical mapping with a figure drawn in a way similar to Figure 5.30 on page 441 ..."

11/17/14 The graded homeworks #4 and #5 are available for pick up from TA during his TA hours.

The graded HW#6 will be available for pick on Monday, Nov. 24 from 10:00 to 11:00 AM in TA's room.

11/17/14
The ESE345 project presentations will be held in room 246 Light Eng. Building during the first week of December:

Monday, Dec. 1st: 11:00 AM - 5:00 PM (with a lunch break from 12:30 to 1:30 PM)

Tuesday, Dec. 2nd: 1:30 PM - 5:00 PM

Wednesday, Dec. 3st: 11:00 AM - 5:00 PM (with a lunch break from 12:30 to 1:30 PM)

As a reminder, the rules are:

  1. No more than two students/project team;

  2. A project report and its electronic version (with all VHDL/Verilog code and simulation results included!) given to TA before project presentation;

  3. A project report must include a detailed project description, all results, conclusions, and all test results (showing test results on a computer display during project presentation is not enough!); 

  4. Project presentation time is 15-18 minutes. You need to use your computer for presentation.

Every team must communicate with TA to get an available time slot for presentation no later than Tuesday, Nov. 25.  

11/11/14 Midterm #2 will take place on Monday, Nov. 24, at 7:00 PM - 8:20 PM in the classroom.

It will be a CLOSED book/No notes exam.

Do not bring your paper. Please bring a pen, a pencil, an eraser to work on the block diagrams. You may bring a simple, non-programmable calculator.

The exam will cover Chapter 4 through Chapter 5 of the textbook with the emphasis on: 

  • Single-cycle processor: datapath and control

  • Multicycle datapath implementation. Finite state machines.

  • Pipelining (concept, pipelined MIPS datapath, data forwarding, all types of hazards and stalls, implications of longer/shorter pipelines and all types of hazards on CPU performance).

  • Memory hierarchy (caches, cache performance (including hit time, miss penalty, average memory access time); wide and interleaved memory organization, and their impact on performance; virtual memory, page tables, fully-associative and N-way set associative TLBs; integration of virtual memory, TLBs, and caches).

  • You will need to refresh your knowledge of the CPU performance law and and the way MIPS instructions are written in the MIPS assembly language.

For many students it is crucial to do VERY well in this exam in order to pass the course!  Be prepared!

Good luck!

11/10/14 Homework #6 is accessible on the homework problems page.   The password is

hw6_2014

The deadline for Homework #6 is Thursday, Nov. 20th (TA hours).

10/29/14 There will be NO lecture on Monday, Nov. 3 due to Instructor's family emergency circumstances.
10/28/14 Homework #5 is accessible on the homework problems page.  

The deadline for Homework #5 is Thursday, Nov. 6th (TA hours).

10/22/14 The midterm 1 exam has been graded. The grades (points) were sent to TA today. The three highest scores were 96, 96, and 82, the lowest three were 12, 13, and 13.

Students with low scores (below 50) are in danger of not passing this course.

10/19/14 Homework #4 is accessible on the homework problems page.  

The deadline for Homework #4 is Tuesday, Oct. 28th (TA hours).

10/08/14 The ESE345 project description is posted on the course website and accessible through "Project" link there. Choose your partner, if any, and start working on it!
10/06/14 First Mid-term Exam will be on Monday, Oct. 13, 7:00 PM - 8:20 PM

It will be a Closed-books, No-notes exam.  Do NOT bring any paper. A photocopy of the original "Green card" with MIPS instructions from the textbook will be provided to you by the Instructor. Bring an eraser, pens, and pencils. You may bring a small, non-programmable, no-memory calculator.  

The exam will cover Chapter 1 through Chapter 3 of the textbook with the emphasis on:

* CPU performance equations and Amdahl's law * MIPS instruction se * MIPS programming in machine (not pseudo-!) instructions * Functions and procedures * Big endian and little endian addressing * Binary arithmetic (full/half 1-bit adder, ripple carry adder, carry look ahead adder, binary multiplication (combinational and sequential) * Booth signed multiplication algorithm * The last version of the sequential divide algorithm * Floating point arithmetic (decimal to binary conversion w/o calculators, IEEE 754 FP single and double formats, FP add and multiply, rounding with guard, round, and sticky bits) *

Good luck with the exam!

9/24/14 Homework #3 is accessible on the homework problems page. 

The deadline for Homework #3 is Tuesday, Oct. 7th (TA hours).

9/8/14 Homework #2 is accessible on the homework problems page. 

The deadline for Homework #2 is Thursday, Sept. 16th (TA hours).

8/27/14 Homework #1 is accessible on the homework problems page. 

The deadline for Homework #1 is Thursday, Sept. 4th (TA hours).

8/20/14 First lecture will be on Monday Aug. 25, 2014.
If you are registered for the course, please send your e-mail address to TA (Zuoting Chen).