CSE 30 Web Page
Welcome to the CSE 30 class web page for fall 1997. Readings,
homework/project handouts, answers to clarification questions, and
other cource administrivia will be available here. I will try to give
no paper handouts to avoid killing trees;
everything from handouts to lecture notes
will be on-line, and these Web pages will be archived (or you can dump
them into a floppy) at the end of the quarter.
Be sure to check this page periodically. If you have a machine where
you are logged on continuously, remember to reload
this page to prevent your browser from displaying old information
saved in its cache. I will try to get
notes for lectures on-line within a couple of days of class. I will
also update pages with clarifications as I receive questions.
Web pages still being worked on are marked with 
. Newly
modified pages will be marked with 
.
Administrivia
Textbooks, office hours, etc are in a
separate page; changes from those noted
in the first handout will be noted
there.
Stephan will have office hours as usual, Monday Dec. 8 and Wed. 10,
9-10a, 3337A.
The midterm will be on Nov 3rd; it is open book -- you may bring your
copy of Patterson and Hennessy as well as the Larus handout -- and open
notes, except that you are restricted to 1 sheet of 8.5x11 paper (you may
write on both sides).
To prepare for the midterm, in addition to reading the web pages here,
you may also wish to
examine the web page from CSE 30 fall last year
when I previously taught this course. The previous midterm and final with
answers are available there.
On-line lecture summaries:
Unless otherwise specified, all assignments are due before class in
one week from the day they were given out.
For your amusement / edification, you may wish to read an old
story about how
``real
programmers'' used to write programs on old machines. This is
not material that will be in the midterm.
|
When you read the lecture notes, don't be shy about trying out the
stuff being discussed. You can have the Web browser window
side-by-side with xspim or a shell window and try things out as you
read the notes. Better yet, hypothesize / deduce how things should
work as you read these notes, and interactively verify them
(experimental approach).
|
See also: Emailed/Office Hour Questions and Answers
Page.
Bennet's office hours for Dec 2 is changed to be from 3:30-4:30 to make
room for another meeting.
You may, of course, come by at other times and I will help you if I am
not too busy and can be interrupted.
Course Outline
The following is a rough description, in time order, of where we are
going. This will change with available time, class interest, etc.
- One instruction computer -- a theoretical instruction set.
Introduces MACROS, instruction set encoding. Also more discussion of
RISC versus CISC, representation of negative numbers (Ch 4). Most of
this is not in the textbook.
- Compilers and assemblers.
- MIPS instruction set. Chapter 3.
- Virtual memory. Chapter 7.
- SPIM software emulator. Appendix A.
- Proofs of correctness. Not in book.
- Performance metrics. Chapter 2.
- Optimization techniques: better algorithms, strength reduction,
recoding in assembler, loop unrolling. Not in book.
- Pipelining. Chapter 6.
- Software threads. Not in book.
[
CSE home |
CSE talks |
bsy's home page |
webster i/f |
yahoo |
lycos |
altavista |
pgp key svr |
spam |
commerce
]
bsy@cse.ucsd.edu, last updated Fri Dec 12 18:54:58 PST 1997.
email bsy
