Syllabus and general information for MCS-284: Computer Organization (Fall 2007)


MCS-284 will cover the architecture and organization of computer hardware. We will look at the MIPS architecture as a representative modern RISC architecture and do some assembly language programming for that architecture. We'll see how numbers are represented within a computer and how the circuits that perform arithmetic operations on those numerals are organized. With a high-level overview of digital logic design to support us, we'll look at how the datapaths and control circuits of processors are designed, and in particular we'll look in some depth at pipelined processor design, which is the key organizational principle at work in most present-day processors. We'll examine the use of memory hierarchy (cache memory and virtual memory) to provide the illusion of a large fast memory from the reality of limited fast memory plus a larger but slower memory. We'll look at input/output devices and buses, networking, and parallel computers. Throughout the course there will be an emphasis on the quantitative performance characteristics of computer systems; we'll look at the influence of architecture and organization on performance, and take an introductory look at the empirical and analytical tools appropriate to the study of performance. Performance measurement will be one of the main themes reinforced through the lab assignments; the other will be assembly language programming.

Office hours

I will be available in my office (OHS 303) from 10:30-11:20 on Mondays, Tuesdays, Thursdays*, and Fridays, as well as by appointment. Or try your luck: just stop by and see whether my door is open. You may send me electronic mail at or call me at extension 7466. I'll try to put any updates to my office hours on my web page, so check there if in doubt. (*Exception: on September 20th, the time will be 2:30-3:20.)

World Wide Web

All course materials will be available through my World Wide Web page. The URL for this course is After this syllabus I will give hardcopy handouts only to those students who want them.


Our text will be the third edition of Computer Organization and Design: The Hardware/Software Interface by David A. Patterson and John L. Hennessy, published by Morgan Kaufmann.


Lab days, when we will meet in OHS 326, are marked in the syllabus. Lab 0 will actually be a special one-day demonstration experience not requiring a lab report; only labs 1 through 4 will be “real labs” with reports.

Attendance is expected for all lab days. (If you turn in a lab report early, you are excused from the remaining days devoted to that lab.) I will excuse up to two absences per student, for any reason. Use yours wisely. If you exceed this allowance, I may reduce your course grade by one letter grade.

Homework assignment policy

I will assign a collection of homework problems for each chapter. You may turn in any individual homework problem whenever you think you have it solved. I will return it to you as quickly as I can, but normally with only an indication of whether it is acceptable or needs more work. (Sometimes I may give a brief indication of what area it needs more work in.) If a problem needs more work, and you aren't sure what sort of work it still needs, you should treat that as an invitation to come talk with me about it. Once you've done the additional work, you may turn the problem in again, attached to (or clearly marked on) the original. In fact, you may turn each problem in as many times as you like, until it is marked as acceptable. Your grade for the homework portion of the course will be based on the fraction of homework problems that you eventually did acceptably.

The final deadline for rewrites of homework problems is 9am on October 10th for chapters 1-4 and appendix B, 9am on November 8th for chapters 5 and 6, and 9am on December 14th for chapters 7-9.

Unless I indicate that a particular problem must be done individually, you may work on any problem in a group of two or three students. One copy of the solution produced by the team should be turned in, with all team members' names on it. Write “we all contributed fairly to this solution” and have all team members sign under that statement.


There will be two intra-term tests and a final exam, as shown on the syllabus below. If you have a conflict with a testing time, please contact me as soon as possible to make an alternative arrangement.

Exams will be closed-book and mostly closed-notes. You may, however, use a single 8 1/2 by 11 sheet of paper with hand-written notes for reference. (Both sides of the sheet are OK.)


Students are encouraged to discuss the course, including issues raised by the assignments. However, the solutions to assignments should be individual original work unless otherwise specified. If an assignment makes you realize you don't understand the material, ask a fellow student a question designed to improve your understanding, not one designed to get the assignment done. To do otherwise is to cheat yourself out of understanding, as well as to be intolerably dishonorable.

Any substantive contribution to your solution by another person or taken from a publication should be properly acknowledged in writing. Failure to do so is plagiarism and will necessitate disciplinary action.

The same standards regarding plagiarism apply to team projects as to the work of individuals, except that the author is now the entire team rather than an individual. Anything taken from a source outside the team should be be properly cited.

One additional issue that arises from the team authorship of project reports is that all team members must stand behind all reports bearing their names. All team members have quality assurance responsibility for the entire project. If there is irreconcilable disagreement within the team it is necessary to indicate as much in the reports; this can be in the form of a “minority opinion” or “dissenting opinion” section where appropriate.

You are expected to be familiar with the college academic honesty honor code policy and to comply with that policy. If you have any questions about it, please ask.

Late lab assignments

All lab assignments are due at the beginning of class on the day indicated. Late assignments will be penalized by one “grade notch” (such as A to A- or A- to B+) for each weekday late or fraction thereof. However, no late assignments will be accepted after graded assignments are handed back.

If you are too sick to complete an assignment on time, you will not be penalized. Simply write “late due to illness” at the top of the assignment, sign your name and hand it in. Other circumstances will be evaluated on a case-by-case basis.

Grade changes

Please point out any arithmetic or clerical error I make in grading, and I will gladly fix it. You may also request reconsideration if I have been especially unjust.


The course components will contribute to your grade in the following proportion: However, I reserve the right to subjectively adjust your final grade. Please see me if you have any question how you stand. Class participation is not graded; however, it allows you to find and repair the gaps in your understanding before doing the assignments, and thus can dramatically improve your grade. You are responsible for all course material, whether or not you are present when it was covered or distributed.

Style guidelines

All assignments should be readily readable, and should not presuppose that I already know what you are trying to say. Use full English sentences where appropriate (namely almost everywhere) and clear diagrams, programs, etc. Remember that your goal is to communicate clearly, and that the appearance of these technical items plays a role in this communication process. Be sure your assignments are always stapled together and that your name is always on them.


If you have a learning, psychological, or physical disability for which a reasonable accommodation can be made, I would be happy to refer you to the college's disability services coordinator and to cooperate in the accommodation process. It is generally best if this can be done as soon as possible.


9/4 Introduction
9/5 1Computer abstractions and technology
9/6 2.1-2.6Instructions
9/7 Lab 0: Under the hood

9/10 2.7-2.8Procedures and strings in assembly
9/11 2.9-2.11More on assembly programming
9/12 A.1-A.6,A.9Assembly programming tools
9/13 2.13,2.15Assembly programming examples
9/14 Lab 1: Elementary assembly programming

9/17 Lab 1 (continued)
9/18 2.16-2.18Yet more on assembly language
9/19 No class (finish lab 1?)
9/20 No class (watch history video?)
9/21 3.1-3.3Two's complement, addition, and subtractionLab 1

9/24 Lab 2: More advanced assembly programming
9/25 3.4Multiplication
9/26 Lab 2 (continued)
9/27 3.6Floating point arithmetic
9/28 B.1-B.3Combinational Logic

10/1Lab 2 (continued)
10/2 No class (attend Nobel Conference)
10/3 No class (attend Nobel Conference)
10/4 B.7-B.11Sequential logic
10/5 More on Sequential logic

10/8 4Performance
10/9 EPA summaryEnergy and performance
10/10Review; catch-upHW rewrites (1-4, B)
10/11Intra-term test 1
10/12Lab 2 (continued)

10/155.1-5.3A simple datapath
10/165.4-p.314A single-cycle processor
10/17Lab 2 (continued)
10/185.4More on the single-cycle processor
10/195.5A multiple-cycle processorLab 2

10/22No class (reading day)
10/23No class (reading day)
10/24More on the multiple-cycle processor

10/296.2A pipelined datapth
10/306.3Pipelined control
11/1 6.5Stalls
11/2 6.6Branches

11/5 Lab 3: Processor performance
11/6 6.8-6.12Superscalar and advanced pipelining
11/7 Lab 3 (continued)
11/8 Review; catch-upHW rewrites (5-6)
11/9 Intra-term test 2

11/137.3Cache performance
11/14Lab 3 (continued)
11/157.4Virtual memory
11/16Lab 3 (continued)

11/197.5Memory hierarchies
11/207.6-7.8Example memory hierarchies
11/21No class (Thanksgiving)
11/22No class (Thanksgiving)
11/23No class (Thanksgiving)

11/26No class
11/278.1-8.2Disk storage
11/28No class
11/298.3NetworksLab 3
11/30Lab 4: Memory system performance

12/3 Lab 4 (continued)
12/4 More on networks
12/5 Lab 4 (continued)
12/6 8.4Buses
12/7 Lab 4 (continued)

12/108.5Interfacing input/output
12/119.1-9.3Bus-based MIMD architecturesLab 4
12/129.4-9.6Network-based MIMD architectures
12/139.7-9.10More on multiprocessors
12/14Review; catch-up; evaluationHW rewrites (7-9)

Course web site:
Instructor: Max Hailperin <>