Computer Organization and Architecture, 7.5 Credits

Contents

The course consists of two parts:
Part 1 theory, 4.5 credits
This part of the course covers:
* how the performance of a computer is measured and the principal factors which limit design, such as the power wall;

* the instruction set of a modern RISC processor, including how constructs in high-level languages are realized;

* the representation of both fixed- and floating-point numbers, together with hardware algorithms for fixed-point arithmetic operations;

* basic processor organization, data and control paths,instruction-level parallelism, pipelining, and multiple issue;

* memory; storage and input-output devices and their interfacing to the processor and memory;

Part 2, laboratory, 3credits.
In the laboratory part some of the theories and techniques discussed in the theoretical part are put into practice. This part consists of a series of mandatory laboratory assignments.

Expected learning outcomes

After having completed the course the student will be able to:
* calculate the performance of a modern digital computer from parameters such as processor speed, cycles per instruction, and profiling results for various algorithms in a benchmark;

* display sterling understanding of the instruction set of a modern RISC processor;

* formulate instructions of a high-level imperative language in terms of the instruction set of a RISC processor;

* explain how fixed-point and floating-point numbers are represented in a computer;

* describe hardware algorithms for fixed-point arithmetic;

* design, implement, and document (with a user manual in English) a disassembler for a modern RISC processor which reads words from instruction memory and decomposes them into the individual fields which may be fed to an emulator;

* display wide understanding of data and control flow in a modern RISC processor;

* discuss how pipelining in a processor functions and describe how hazards are resolved in various ways, including bubbles, flushes, and forwarding;

* design, implement, and document (with a user manual in English) an emulator for a modern RISC processor; which models faithfully the flow of control;

* display wide understanding of how memory is organized and managed in a modern digital computer, including virtual and physical memory, address translation, multilevel, unified, and multi-way set-associative caches, the translation-lookaside buffer (TLB), and the page table.

* compute how large a cache must be, given the size of the index, the size of the tag, and the level of associativity;

* compute the performance of various forms of memory from given parameters;

* discuss input-output units, including in particular hard disks and solid-state disks (SSDs), how they communicate with the processor, and how their performance is computed.

Required Knowledge

To be admitted you must have 60 ECTS-credits in Computing Science or 2 years of completed studies, in both cases including the courses C-programming and Unix (5DV088), Digital Electronics (5EL006) and Introduction to Discrete Mathematics (5MA008) or equivalent. Proficiency in English equivalent to Swedish upper secondary course English A (IELTS (Academic) with a minimum overall score of 5.5 and no individual score below 5.0. TOEFL PBT (Paper-based Test) with a minimum total score of 530 and a minimum TWE score of 4. TOEFL iBT (Internet-based Test) with a minimum total score of 72 and a minimum score of 17 on the Writing Section).
Where the language of instruction is Swedish, applicants must prove proficiency in Swedish to the level required for basic eligibility for higher studies.

Form of instruction

Education consists of lectures and mandatory computer based assignments. In addition to scheduled activities, individual work with the material is also required.

Examination modes

The examination consists of a written exam in Part 1 and by grading the mandatory computer-based assignments in Part 2. In Part 1, the grades given are Fail (U), Pass (3) or Pass with Mark (4), or Pass with Distinction (5). In Part 2 the grades given are Fail (U) or Pass (G). On the course as a whole, the grades given are Fail (U), Pass (3) or Pass with Mark (4), or Pass with Distinction (5). In order to pass the course completely all mandatory parts must be passed as well. The final grade of the course is a summary assessment of the results and decided only after all mandatory parts are passed.
A student who has passed an examination may not be re-examined.

For all students who do not pass the regular examination there are additional opportunities to do the examination. A student who has taken two tests for a course or segment of a course, without passing, has the right to have another examiner appointed, unless there exist special reasons (Higher Education Ordinance Chapter 6, section 22). Requests for new examiners are made to the head of the Department of Computing Science.

Other regulations

TRANSFER OF CREDITS
This course may not be used towards a degree, in whole or in part, simultaneously with another course of similar content. If in doubt, consult the student counselors at the Department of Computing Science and / or program director of your program.

Note that this course can not be fully accounted for in an examination together with Computer architecture (5DV008).

Transfer of credits is considered individually (see the University Code of Rules and regulations for transfer of credits). An application for transfer of credits is made on a special form and should be submitted to the Faculty of Science and Technology, Umeå University.