Comp 411 Spring 2010

Today we’ll begin talking about approaches to optimizing the memory system for our computer.

Slides for today.

Study chapter 5.

Last time we learned that pipelining increases throughput and latency and we didn’t see any limits on its application. Today we’ll look at the issues that limit how much speedup we can get.

Slides for today.

This is from section 4.5-4.8 in your book. For next time read chapter 5.1-5.3.

Today we’ll cover the last piece of technology that we need to build a working computer.

Slides for today.

Readings associated with today’s and upcoming lectures include: Appendix C.10 and 4.4

In the next lecture we’ll talk about the implementation of memory.

Readings associated with this lecture can be found in C7-C9, and C12.

Slides for the next lecture.

Today we’ll talk about measures of computer system performance that help designers and users evaluate implementation issues. Read sections 1.4 to 1.9 in the 4th ed; 4.1-4.6 in 3rd.

Slides for today.

Now that we know how to add and subtract we’ll figure out how to implement multiplication and division.

Slides for today.

Study chapter 3.

In today’s lecture we’ll dive deep into the implementation of computers to explore the lowest level building blocks.

Slides for today.

Readings: Appendix C.1-C.3

and to read ahead go ahead and read: Ch. 3.1-3.2, Appendix C.5-C.6

Today we’ll talk about how assemblers and compilers prepare programs for execution.

Slides for today .

Reading 2.12-14 in 4th ed or 2.10-13 in 3rd ed.

Today we’ll begin talking about how to manage procedure call and return.

Slides for today.

Read section 2.8 in the 4th edition, 2.7 in the 3rd.