CSE 30 Web Page
Welcome to the CSE 30 class web page for fall 1999. 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.
Final exam statistics are now available.
Final Schedule/location: 11:30am-2:29pm Tuesday Center 115
Previous year's finals, in PostScript and PDF:
This year's final:, in PS and in PDF
Web pages still being worked on are marked with . Newly
modified pages will be marked with .
Textbooks, office hours, etc are in a
separate page; changes from those noted
in the first handout
will be noted
On-line lecture summaries:
Old midterms: Last year's, in
that from 97, in
Note: Table 3.11 in Patterson & Hennessey is
wrong; the a registers are caller preserved. A-24 and other
references agree that that is the proper convention.
Use the following timing for mult and div.
Unless otherwise specified, all assignments are due before class in
one week from the day they were given out.
Assignment Handouts / Statistics
For your amusement / edification, you may wish to read an old
story about how
programmers'' used to write programs on old machines. This is
not material that will be in the midterm.
See also: Emailed/Office Hour Questions and Answers
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 these notes. Better yet, hypothesize / deduce how things should
work as you read these notes, and interactively verify them
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.
search CSE |
CSE home |
bsy's home page |
webster i/f |
pgp key svr |
firstname.lastname@example.org, last updated Sun Dec 19 00:22:37 PST 1999. Copyright 1999 Bennet Yee.