CSCE 513: ADVANCED COMPUTER ARCHITECTURE
Catalog Course Description:
513—Advanced
Computer Architecture. (3) (Prereq: CSCE 330) Design methodology; processor design, computer
arithmetic: algorithms for addition, multiplication, floating point arithmetic;
microprogrammed control; memory organization; introduction to parallel
architectures.
Prerequisite(s) By Topic:
Introduction to Computer Organization or
Introduction to Computer Architecture
Data Structures and Algorithms
Programming Languages
Textbook(s) and Other
Required Material:
Computer Architecture: A
Quantitative Approach, 2d ed., John L. hennessy and David A. Patterson, Morgan
Kaufman, 1995.
Computing Platform: Not applicable
Course Objectives: {Assessment Methods Shown in
Braces}
Upon
completion of this course students will be able to:
1.
Describe the principles of computer organization. {tests}
2.
Describe the techniques and principles for the development of high
performance computer systems. {tests}
3.
Describe the details of extant computer architectures. {tests}
Topics Covered:
(Note: The lecture numbers represent 50-minute classes in a semester
containing a total of 42 hours of class time.)
1.
Design
methodology: system modeling, design
levels, hierarchical design (3 lectures)
2.
Processor
design: instruction sets, arithmetic operations (5 lectures)
3.
Microprogrammed
control (3 lectures)
4.
Algorithms
for computer arithmetic: addition, fast
addition, multiplication, fast multiplication, division, floating point numbers
and operations (8 lectures)
5.
Memory
organization (8 lectures)
6.
I/O
organization (4 lectures)
7.
Multiprocessor
and parallel computer architecture (4 lectures)
8.
RISC
architectures (4 lectures)
9.
Review
and examinations (3 lectures)
Syllabus
Flexibility: Moderate. The instructor
may select any textbook that covers the topics listed.
Assessment Methods:
1.
Written examinations
2.
Written homework
Relationship of Course to
Program Outcomes:
The
contribution of each course objective to meeting the program outcomes is
indicated with the following scale: 3 =
major contributor, 2 = moderate contributor, 1 = minor contributor. Blank if not related.
|
|
Program Outcomes |
||||||
|
1. To Be Completed |
2 |
3. |
4. |
5. |
6. |
7. |
|
|
1. Describe organization |
|
|
|
|
|
|
|
|
2. Describe high performance computers |
|
|
|
|
|
|
|
|
3. Describe parallel computer |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Estimated CSAB Category
Content:
Algorithms: 0
Data Structures: 0
Software Design: 0
Concepts of
Programming Languages 0
Organization and
Architecture 3 hr
Class/Laboratory Schedule:
Lecture: 3 periods of 50 minutes or 2 periods
of 75 minutes per week
Recitation: 0 periods per week
Laboratory: 0 periods per week
Modification and
Approval History
Initial description, April 1998
Revised December 2000
Detailed
Syllabus (28 Class days)
Topic Reading
Introduction
1. Overview,
class policies Ch. 1
Computer System Organization Ch. 2
2. CPU
organization 2.1
3. Memory
and storage hierarchies 2.2
4. I/O
devices 2.4
6. Bus
operation 3.4
Instruction Set Architecture Ch 5
7. Instruction
sets 5.1-5.3
8. Assembly
language programming 7.1
9. Assembly
language programming
10. Review
11. Test
12. Test post mortem
14. Addressing 5.4
15. Addressing 5.4
16. Instruction
types 5.5
17. Flow
of Control 5.6
Micro-Machine Architecture Ch 4
18. JVM 4.2
19. Pipelining,
4.4
20. Review
21. Test
22. Test post mortem
23. Cache memories 4.5
Parallel Computer Architectures Ch. 8
24. Communication
models 8.1
25. SIMD
Array and Vector processors 8.2
26. Shared
memory systems 8.3
27. Message
passing systems 8.4
28. Review
29. Exam