Computer Architecture and Operating Systems

Bachelor 2021/2022

Type: Compulsory course

Area of studies: Applied Mathematics and Information Science

Delivered by: Big Data and Information Retrieval School

Where: Faculty of Computer Science

When: 2 year, 3, 4 module

Mode of studies: offline

Open to: students of one campus

Instructors: Чугунный Евгений Алексеевич, Канахин Алексей Алексеевич, Andrei Tatarnikov

Language: English

ECTS credits: 5

Contact hours: 144

Full Syllabus

Abstract

The course is classified as a compulsory subject; it is a two-module course (semester B quartiles 3 and 4). The course is divided into two logical parts. The part is given during semester B quartile 3 and is dedicated to computer architecture and assembly programming. The second part is given during semester B quartile 4 and covers operating system organisation and system programming. The syllabus is prepared for teachers responsible for the course (closely related disciplines), teaching assistants, students enrolled in the course as well as experts and statutory bodies carrying out assigned or regular accreditations.

Learning Objectives

Study foundations of computer architecture (on the example of RISC-V).
Acquire assembly language programming skills.
Study operating system organisation (on the example of Linux).
Learn how to create system software.

Expected Learning Outcomes

Understand the concepts of memory hierarchy, cache memory, and virtual memory.
Be able to create operating-system level software in the C programming language.
Translate high-level programming language code into assembly instructions and vice versa.
Understand assembly language and be able to write assembly programs.
Understand fundamental operating systems structures such as processes, system calls, scheduling, virtual memory, and file systems.
Understand fundamentals of computer architecture.
Understand fundamentals of operating system organisation.
Understand how pipelining works.

Course Contents

Computer architecture concept.
Data types. Byte ordering. Integer formats.
Computer organization. Microprocessor. RISC and RISC-V. Assembly language.
RISC-V instructions. Instruction formats. Arithmetic and load/store instructions.
Pseudo instructions, macros, and includes. Conditions, loops, and arrays.
Subroutines. Call stack. Calling conventions.
Memory-mapped I/O (MMIO).
Floating-point format. IEEE 754. Floating-point instructions.
Exceptions, traps, and interrupts.
Instruction-level parallelism: Pipelining.
Caches.
Virtual memory.
Data-level parallelism: Vector, SIMD, GPU.
Thread-level parallelism.
Optimizations.
Domain-specific architectures. Tensor Processing Unit.
Operating system architecture. Linux.
C programming language. GNU tools (GCC, Make).
System calls.
Linking and loading. Libraries and binary file format.
Strings and regular expressions.
Processes and threads.
Synchronization.
Inter-process communication.
Filesystem.
Devices and other special files.
Permissions.
Shell. I/O redirection.
SystemD services.
Sockets.
Networking.
Distributed operating systems.
Virtualization.
Security.
High-level languages and operating system.

Assessment Elements

Exam
Экзамен - устный. Прокторинг не требуется. Экзамен будет проходить в Zoom. Устная беседа в группе по 7 человек на все основные темы курса. В процессе беседы экзаменатор задаёт вопросы по темам, студенты в произвольном порядке отвечают. Пользоваться материалами и другими средствами можно, вопросы задаются на понимание.
Homeworks
Class activity
Class presence
Quizzes
Final test

Interim Assessment

2021/2022 4th module

Overall Formula

There are 2 modules $$M_i$$ (scored in the same way) and final exam $$E$$, which have an equal weight.

$$G = \frac{\sum_{i=1}^2M_i+E}{3}$$

If the final grade $$G$$ is unsatisfactory, the exam can be retaken. In situations when it does not help because of low module grades $$M_i$$, the decision about the final grade is done by the commission of faculty members, who will hold the final exam.

Module Formula

Each module score is calculated from Regular and Bonus points: $$M_i = min(10, R_i + B_i)$$

Regular Points: 10 points

$$R_i = 10\cdot (\frac{45}{100}\cdot H + \frac{10}{100}\cdot Q + \frac{10}{100}\cdot P + \frac{35}{100}\cdot F)$$

Variable	Score	Description
$$H$$	45%	Homework (practical tasks). There are deadlines. 50% penalty for being 1 week late. 75% penalty for larger delays. 100% penalty for cheating.
$$Q$$	10%	Quizzes for self-checking.
$$P$$	10%	Class presence. You need to attend more than 3/4 of classes to earn this point.
$$F$$	35%	Final test (programming assignment). 100% penalty for cheating.

Bonus Points: 2 points

$$B_i = 2\cdot \frac{\sum_k A_k}{100}$$

Variable	Score	Description
$$A_k$$	5% each	Class activity. Each time you broadcast a solution of a task during class hours, you get this point.

Exam Formula

$$G = 10\cdot \frac{P_1 + P_2}{12}$$

The exam consists of 2 parts $$P_1$$ and $$P_2$$ each containing questions that cover topics from module 3 and module 4 respectively. To get a maximal grade, a student needs to successfully answer 3 questions from each part. Each answer can give 0 to 2 relative points (0 for «-», 1 for «±», and 2 for «+»), which are then divided by maximal point 12 to give a grade. Points for each part $$P_i$$ are calculated with a function, which counts points for each of the questions and divides them by the total number of answers given by a student.

Bibliography

Recommended Core Bibliography

Harris, D. M., & Harris, S. L. (2012). Digital Design and Computer Architecture (Vol. 2nd ed). Amsterdam: Elsevier Ltd. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=472255
Архитектура компьютера, Таненбаум, Э., 2014
Компьютерные системы. Архитектура и программирование : взгляд программиста, Брайант, Р. Э., 2005
Современные операционные системы, Таненбаум, Э., 2012

Recommended Additional Bibliography

Hennessy, J. L., Asanović, K., & Patterson, D. A. (2012). Computer Architecture : A Quantitative Approach (Vol. 5th ed). Waltham, MA: Morgan Kaufmann. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=407995
Sweetman, D. (2007). See MIPS Run (Vol. 2nd ed). San Francisco, Calif: Morgan Kaufmann. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=195985
Операционная система UNIX : учеб. пособие для вузов, Робачевский, А. М., 2003

Authors

Абовьян Наталья Михайловна
TATARNIKOV ANDREY DMITRIEVICH

Course Syllabus