News
To get information on lessons and receive notices:
- The course will start on 27 February 2025. Please note that only this first Thursday, the class will start at 12:00, will be shorter and will end at 13:00.
- Lessons are scheduled for:
- Tuesday (14:00 - 17.00)
- Thursday (11:00 - 13.00)
- in Room T1, Edificio E (Building E) Regina Elena
Dear Students, the course will follow the same line as the last three years, focusing on advanced topics on computer architectures and an introduction and some selected topics on quantum computing. Previously, the course was called Intensive Computation, and since the name change, the topics have mainly concerned computer architectures.
In particular, the course will start from the part dedicated to computer architecture and will focus on arithmetic circuits and interconnection topologies.
The part on quantum computing will focus on quantum arithmetic circuits, to compare the classical solutions with those currently studied for quantum computers.
Lectures 2024-2025
Lecture 1, February 27th, 2025 Introduction to the course. Lecture 1 - Introduction
Lecture 2, March 4th, 2025
Summary of computer organization and architecture. Lecture 2 - Overview of Computer Architecture
Lecture 3, March 6th, 2025 Basic circuits for arithmetic operations: Ripple-carry adder and multiplier for unsigned and signed numbers.
Circuits for speeding up arithmetic operations: Carry select adder. Carry look-ahead adder. Lecture 3 - Computer arithmetic - Slides 1-43
Lecture 4, March 11th, 2025 Circuits for speeding up arithmetic operations: Pipelined addition. Pipelined unsigned and signed multiplication. Evaluation of circuit: area and delay. Lecture 4 - Computer arithmetic - Slides 44-65
Exercises on: circuit evaluation and Booth recoding.
Representations for fast arithmetic. Redundant number systems: introduction. Lecture 4 - Redundant number systems - Introduction - Slide 1-12
Lecture 5, March 13th, 2025 Representations for fast arithmetic. Redundant number systems. Lecture 5 - Redundant number systems - Slide 13-33
Lecture 6, March 18th, 2025 Redundant Number Systems: examples. Lecture 6 - Redundant number systems: examples - Slide 34-54
Exercises on: pipelined adders and multipliers, signed digit redundant representations.
Residue Number Systems: Introduction and selection of a module set. Lecture 6 - Residue Number System - Slides 1-23
Lecture 7, March 20th, 2025 Residue Number Systems: arithmetic operations, conversion, mixed radix representation. Lecture 7 - Residue Number System - Slides 24-38
Exercises: Residue Number System.
Lecture 8, March 25th, 2025 Compact formats for sparse matrices. Lecture 8 - Sparse Matrices
Exercises on Sparse Matrices.
Lecture March 27th, 2025 - cancelled
Lecture 9, April 1st, 2025 Performance and speed-up: Amdahl's law, Processor performance equation, and Gustafson-Barsis's law. Communication Performance. Lecture 9 - Performance and speed-up
Exercises on Amdhal Law and Performance Equation.
Lecture 10, April 3rd, 2025 Introduction to parallel architectures and motivations. Classification of parallel architectures. Lecture 10 - Introduction to parallel architectures: motivations and classifications
Lecture 11, April 8th, 2025 The SIMD class. Vector architectures. Lecture 11 - Vector Architectures - Slides 1 - 34
Exercises for the Midterm test.
Lecture 12, April 10th, 2024 - Midterm
Lecture 13, April 15, 2025 Vector architectures. Lecture 13 - Vector Architectures - Slides 35 - 73
Lecture 14, April 24th, 2025 Graphics Processing Units: introduction and starting notions. Lecture 14 - GPUs - Slide 1-52
Lecture 15, April 29th, 2025 Graphics Processing Units. Presentation by students Colombini and De Nicola, with a description of memory and practical examples of CUDA programming. Lecture15 - Slides, code and docker
Lecture 16, May 6th, 2025 Multiplication of matrices using CUDA. Exercises. Lecture16 - Slides and code Overview of the second part of the slides of Lecture 14. [[http://twiki.di.uniroma1.it/pub/CI/WebHome/2025-Lecture14-15-GPU.pdf][Lecture 16 - GPUs - Slides 53-end]
Lecture 17, May 8th, 2025 Interconnection networks Lecture 17 - Interconnection networks - Slides 1-43
Lecture 18, May 13th, 2025 Interconnection networks Lecture 18 - Interconnection networks - Slides 44-129
Exercises on Clos networks
Lecture 19, May 15th, 2025 Introduction to Quantum Computing. Qubits and One-qubit gates.
Lecture 18 - Quantum Computing - Slides 1-67
Read slides 68-81 before lecture of 27 May
Past year lectures
|
Exam
The exam consists of two parts:
- Written exam. Students attending the lessons can take a mid-term exam and a final exam (or a whole exam). Mid-term and final exam (or whole exam) consist in a written test and exercises.
- One of the following, at the choice of the student: oral exam/presentation of one-two papers/project.
Text of exams
Textbooks - Testi di riferimento
- Computer Architecture: A Quantitative Approach J. L. Hennessy, D. A. Patterson - Morgan Kaufmann, 2019
- Multicore and GPU Programming An Integrated Approach - G. Barlas - Morgan Kaufmann, 2014
- Programming Massively Parallel Processors: A Hands-on Approach, David B. Kirk and Wen-mei W. Hwu, Morgan Kaufmann, 2010
- Introduction to High-Performance Scientific Computing, Lloyd D. Fosdick, Elizabeth R. Jessup, Carolyn J. C. Schauble and Gitta Domik, The MIT Press, 1996
      
|
| | | |
Copyright © 2008-2025 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.