Computer Architecture and Lab A - E
Module Computer Architecture

Academic Year 2022/2023 - Teacher: CORRADO SANTORO

Expected Learning Outcomes

Knowledge and understanding: To acquire knowledge and understanding of fundamental concepts of computer systems architecture and of methodological principles that drive its development, in the historical perspective of their evolution.

Applying knowledge and understanding: To acquire problem solving capabilities in computer system design, by trying to solve on-purpose proposed problems, and abilities to make use of, to design and to implement software tools, such as simulators and interpreters, for abstract machines at the lowest levels of computer system organization.

Making judgements: To be able to compare and evaluate the quality of solutions to design problems for computer systems.

Communication skills: To acquire communication skills and proper language to communicate, even with nonexpert people, about problems relating to functioning, design, implementation, and evaluation of computer systems.

Learning skills: To develop the ability to adapt one's own knowledge to the rapid evolution of the discipline and to keep up-to-date through specialized sources in the field.

Course Structure

  • Classroom lectures and lab tutorials with exercises

Required Prerequisites

Nessuno

Attendance of Lessons

To attend lectures is strongly suggested

Detailed Course Content

  1. Computing machines: historical background
  2. Computing machines: functional units, architectures
  3. Algebraic structures, Boole algebra
  4. Logic gates, sequential circuits, flip-flops
  5. RISC and CISC architectures, addressing modes
  6. Type and format of instructions, examples of real assembly languages
  7. I/O operations, interrupt control and service
  8. Supporting software, assembly languages and C language, operating systems
  9. Basic structure of a processor, microarchitectures RISC and CISC
  10. High-performance processors, prediction techniques, superscalar processors
  11. Main memory devides, DMA, hierarchy of memories
  12. Efficient circuits for binary arithmetic

Textbook Information

  1. C. Hamacher, Z. Vranesic, S. Zaky & N. Manjikian : Introduzione all'architettura dei calcolatori. Third italian edition, McGraw-Hill Education (Italy), 2013
  2. Supplementary notes provided by the teacher during lecture development.

Course Planning

 SubjectsText References
1Course objectives; computing machines; historical background1: 1.7
2Computing machines: functional units, architectures1: 1.0-3, 1.6
3Algbraic structures; Boole algebra2
4Logic gates; sequential circuits; flip-flop1: A.5-6
5RISC/CISC, addressing modes, ISA1: 2.0-4, A2.1-2
6Instruction types and formats; examples of real assembly languages1: 2.8, 2.10.2, A2.4-5
7I/O operations, control and service of interrupts1: 3.0-2.5, A3.1
8Support software, assembly languages, C, operating system1: 4.0-9.2
9Structure of a processor, microarchitectures, RISC, CISC1: 5.0-4
10High-performace processors, prediction techniques, superscalar processors1: 6.6-10
11Main memory devices, DMA, memory gerarchies1: 8.0-5
12Efficient circuits for binary arithmetic1: 9.2-4, 9.6

Learning Assessment

Learning Assessment Procedures

  • Practical test
  • Oral examination
  • Optional project

Examples of frequently asked questions and / or exercises

  • binary/decimal/hexadecimal conversion
  • Two's complement sum
  • Floating point representation
  • Logic function analysis
  • Logic function synthesis, Karnaugh maps
  • Binary adder circuit
  • Multiplier and divider circuits
  • Word alignment in memory
  • Instruction-Set Architecture
  • Data Path
  • Pipeline
  • CISC Processors, microprogrammazione
  • RISC/CISC Comparison
  • Cache Memory
  • Exercises in assembly on vectors
  • Sum of vectors
  • Linear search in a vector
  • Filtering of a vector