CS5113 Computer Organization and Architecture (Spring 2007)

Announcement:

Syllabus

Instructor:

Dr. Xiaolin (Andy) Li
Email: xiaolin @ cs
Offices: 223 MSCS (Stillwater, 405-744-2338), 328 NH (Tulsa, 918-594-8188)
Office Hours: T 4pm-6pm (on site); R 2pm-4pm (off site); or by appointment
URL: http://www.cs.okstate.edu/~xiaolin

TA:

Mr. Hui Kang
Email: huk @ cs.okstate.edu
Office: 204 MSCS (Stillwater, 405-744-3032)
Office Hours: T 2:30 - 4:30pm; F 2:30 - 4:30pm; or by appointment

Course Objective and Description:

Prerequisite: CS 3443 (Computer Systems). The objective of this course is to study computer architecture design by examining architectural concepts with consideration of performance, usability, reliability, and power management etc. This course covers a number of issues involved in the design and utilization of high performance computing systems. These include: Instruction Set Architecture, Performance Evaluation, Pipeline Microprocessor, Cache and Memory, Multiprocessor and Parallel Computing, Interconnection Network, and Embedded Systems.

Class Meeting Time and Place:

T 7:20pm-10:00pm; 310 MSCS (Stillwater) and 213  NCB (Tulsa).

Textbooks

(HP) John L. Hennessy and David A. Patterson,
Computer Architecture: A Quantitative Approach
Morgan Kaufmann Publishers, 4th Edition, 2006.
ISBN 0-12-370490-1  
Book website: http://textbooks.elsevier.com/0123704901
(Not required, readings will be available online)

(HJS) Mark D. Hill, Norman P. Jouppi, and Gurindar S. Sohi
Readings in Computer Architecture
Morgan Kaufmann Publishers, 2000
ISBN 1-55860-539-8
Book website: http://tinyurl.com/7e86q

Other Reference Books

Course Homepage:

http://www.cs.okstate.edu/~xiaolin/teaching/cs5113

Course Outline (tentative):

  1. Introduction
  2. Instruction Set Architecture
  3. Pipelined Processor
  4. Advanced Pipelining and Instruction-Level Parallelism
  5. Memory Systems
  6. Storage Systems and I/O
  7. Interconnection Networks
  8. Multiprocessors
  9. Parallel and Distributed Computing
  10. Wireless Sensor Networks

Grading Policies:

Class participation bonus: 5%

Programming and homework assignments: 40%

Midterm Exams (2): 20% each

Term paper and presentation: 20%

Note: Homework, term papers and program assignments are due at the beginning of class on the date they are due (unless announced in class otherwise). Late homework will not be accepted. Late program penalty is 10% per calendar day, according to the date and time on the printout. Only when verifiable extenuating circumstances can be demonstrated will make-up exams or extended assignment due dates be considered. Verifiable extenuating circumstances must be reasons beyond control of the students, such as illness or accidental injury. Poor performance in class is not an extenuating circumstance. Advise your instructor of the verifiable extenuating circumstances in advance or as soon as possible. In such situations, the date and nature of the make-up exams and the extended due dates for the assignments will be decided by the instructor.

Attendance Policy:

Attendance is strongly encouraged, but not required or monitored (except for the first two classes). Students are responsible for any material covered in class. Some of the materials covered in class will not be in the textbook. Announcements about homework, projects, programming assignments, etc. will be made in class and/or Desire2Learn or by emails. Students are encouraged to check the course webpage on Desire2Learn (or their emails in class accounts) regularly.

Collaboration Policy:

Discussion of techniques and ideas covered in class is encouraged. However, every line of on all assignments must be your own. A statement required by the university: "Care must be taken that exam answers are not seen by others, that term papers or projects are not plagiarized by others or otherwise misused by others, etc. Even passive cooperation in a dishonest enterprise is unacceptable." In programming assignments, discussion of techniques in a natural language (such as English) is allowed, but a discussion in a computer or algorithmic language is not allowed. (Computer language discussions and questions are to be limited to the language and should not concern the assignment.) Stealing, giving or receiving any code, drawings, diagrams, texts or designs is not allowed. In examinations, no discussion of any kind (except with the instructor) is allowed. No access to any type of written material is allowed. Students who do not comply with the above described collaboration policy will receive a grade of F in the course. Furthermore, the case will be reported to the University Officials.

Attachments:

            http://osu.okstate.edu/acadaffr/aa/syllabusattachment-Spr.htm

Useful Links 

Other Online Lectures

 

Primary References

 

Others