Faculty of Information Technology, BUT

Course details

Design of Computer Systems

INP Acad. year 2018/2019 Winter semester 6 credits

Principles of a processor. Von Neumann computer. Data types, formats and coding. Instructions, formats, coding and addressing, instruction set architecture. VHDL models of algorithms and subsystems. Pipelining. Arithmetic and logic operations. Sequencer: basic function, hard-wired and microprogram implementation. Memories: types, organization, control. Memory hierarchy, cache memory. Peripheral units, buses and bus control. Performance evaluation. Reliability of computer systems. Introduction to parallel architectures.

Guarantor

Deputy Guarantor

Bidlo Michal, Ing., Ph.D. (DCSY FIT BUT)

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

39 hrs lectures, 12 hrs exercises, 14 hrs projects

Assessment points

52 exam, 15 half-term test, 33 projects

Department

Lecturer

Instructor

Subject specific learning outcomes and competences

Students are able to describe functionality of the operation, memory and control units and their communication in a computer. They are familiar with VHDL.

Generic learning outcomes and competences

Understanding of development trends and possibilities of computer technology.

Learning objectives

To give the students knowledge of organization and functioning of a (single core) processor, in particular, the principles of the operation, memory and control units, the algorithms with fixed and floating point number systems, the subsystem communication level, and integration of the processor to a parallel system.

Why is the course taught

This course is essential to all engineers working in the areas of computer engineering and computer science as it explains how computers work and how they are built at the hardware level. Understanding the principles of, for example, arithmetic operations conducted in fixed point and floating point number representations, instruction execution in pipelines or memory hierarchy will allow the practitioners to develop better hardware and software. Writing high-quality code is impossible without understanding the computer organization principles.

Prerequisites

Corequisite knowledge and skills

Boolean algebra, basics of electrical circuits, basic computer elements, design of combinatorial and sequential circuits.

Study literature

  • Drábek, V: Computer organization. Lecture notes of Brno University of Technology, PC-DIR publ., Brno, 1995
  • Pinker, J., Poupa, M.: Číslicové systémy a jazyk VHDL, BEN - technická literatura, Praha, 2006
  • Hennessy, J. L., Patterson, D. A.: Computer Architecture: A Quantitative Approach, 2nd edition, Morgan Kaufmann Publ., 1996, and new editions, e.g. the 5th ed. from 2012
  • Soubor materiálů prezentovaných na přednáškách dostupný na internetových stránkách kurzu.

Fundamental literature

  • Hamacher, C., Vranesic, Z., Zaky, S.,  N. Manjikian: Computer Organization and Embedded Systems, 6th edition, McGraw Hill Education, 2011, ISBN-13: 978-0073380650

Syllabus of lectures

  • Introduction, processor and its function.
  • Data representation.
  • Instruction sets, register structures.
  • Modelling in VHDL.
  • Pipeline processing.
  • Algorithms of fixed point operations.
  • Algorithms of floating point operations, iterative algorithms.
  • Controllers.
  • Memories, cache memory.
  • Buses, peripheral interfacing and control.
  • Computer performance and performance evaluation.
  • Reliability of computer systems.
  • Introduction to parallel architectures.

Syllabus of numerical exercises

  • VHDL - introduction
  • VHDL - synthesizable code
  • Introduction to FITkit
  • Processor in VHDL
  • Huffman code, Hamming code
  • Modular arithmetic, adders
  • Multipliers
  • Division
  • Iterative algorithms
  • Performance evaluation, reliability
  • Parallel architectures

Syllabus - others, projects and individual work of students

  • Two projects will be assigned during the semester.

Progress assessment

Written final exam, mid-term exam and submitting projects in due dates.

Controlled instruction

Within this course, attendance on the lectures and demonstrations is not monitored. The knowledge of students is examined by the projects, the mid-term exam and by the final exam. The minimal number of points which can be obtained from the final exam is 20. Otherwise, no points will be assigned to a student. In the case of a reported barrier preventing the student to perform scheduled activity, the guarantor can allow the student to perform this activity on an alternative date.

Exam prerequisites

For receiving the credit and thus for entering the exam, students have to get at least 20 points during the semester.

Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

Schedule

DayTypeWeeksRoomStartEndLect.grpGroupsInfo
Monlecturelectures D105 13:0015:50 2BIA 3BIT xx
Monexam2019-01-14 D0206 D0207 D105 E104 E105 E112 G202 15:0016:50 2BIA 2BIB 3BIT řádná
Wedlecturelectures E104 E105 E112 08:0010:50 2BIB 3BIT xx
Wedexam2019-01-23 D0206 D105 09:0010:50 2BIA 2BIB 3BIT 1. oprava
Thuexam2019-01-31 D0206 D105 09:0010:50 2BIA 2BIB 3BIT 2. oprava
Thuexerciselectures D0206 D105 11:0011:50 2BIA 2BIB 3BIT xx 10 - 14 20 - 24

Course inclusion in study plans

  • Programme BIT, 2nd year of study, Compulsory
  • Programme IT-BC-3, field BIT, 2nd year of study, Compulsory
Back to top