Person in charge: | (-) |
Others: | (-) |
Credits | Dept. |
---|---|
7.5 (6.0 ECTS) | AC |
Person in charge: | (-) |
Others: | (-) |
In this subject, students should gain an understanding of the basic concepts of multiprocessors: their terminology, structure and most common problems, as well as the most common solutions. The aim is for students to get to know and learn how to use current systems. Students must develop a critical approach to the analysis of the true functioning of these systems, so as to improve their performance.
Estimated time (hours):
T | P | L | Alt | Ext. L | Stu | A. time |
Theory | Problems | Laboratory | Other activities | External Laboratory | Study | Additional time |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
4,0 | 4,0 | 0 | 0 | 0 | 4,0 | 0 | 12,0 | |||
Description of the language
Example of the impact of each directive on each thread. Implementation: Compiler and run time. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
4,0 | 4,0 | 0 | 0 | 0 | 4,0 | 0 | 12,0 | |||
Description of primitives: Collective communication primitives and point-to-point primitives.
Example of the impact of the primitives on each process. Run-time implementation. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
6,0 | 6,0 | 0 | 0 | 0 | 6,0 | 0 | 18,0 | |||
Issue: the concept of time.
Basic solutions to guarantee coherence in bus-based systems and directory-based systems. Advanced solutions: buffering calls, multi-level caches, simple buses (shared clock-cycle). |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
2,0 | 2,0 | 0 | 0 | 0 | 2,0 | 0 | 6,0 | |||
Synchronisation algorithms (mutual exclusion, point-to-point barriers) and their interaction with the coherence mechanism.
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
4,0 | 4,0 | 0 | 0 | 0 | 4,0 | 0 | 12,0 | |||
Components.
Topologies. Routing algorithms. Commutation strategies. Flow control. Network interface. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
2,0 | 2,0 | 0 | 0 | 0 | 2,0 | 0 | 6,0 | |||
Maleability.
Policies for planning long-term jobs. Planning policies for short/medium-term processes. Co-ordination between levels. Memory management: page collocation. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
4,0 | 0 | 0 | 0 | 8,0 | 0 | 0 | 12,0 | |||
Selection of a pair of current multiprocessors and description of their structure and workings in relation to the concepts dealt with in the course.
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | 6,0 | 0 | 0 | 6,0 | 0 | 12,0 | |||
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | 6,0 | 0 | 0 | 6,0 | 0 | 12,0 | |||
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | 6,0 | 0 | 0 | 6,0 | 0 | 12,0 | |||
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | 6,0 | 0 | 6,0 | 0 | 0 | 12,0 |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
6,0 | 4,0 | 0 | 0 | 0 | 6,0 | 0 | 16,0 | |||
Description of advanced aspects of all of the foregoing themes: Multi-level parallelism in OpenMP, One-sided Communications in MPI, MPI+OpenMP, Relaxed consistency systems, SDSM.
|
Total per kind | T | P | L | Alt | Ext. L | Stu | A. time | Total |
34,0 | 28,0 | 24,0 | 0 | 14,0 | 48,0 | 0 | 148,0 | |
Avaluation additional hours | 4,0 | |||||||
Total work hours for student | 152,0 |
(-)
A course exam will be held. Students will be permitted to use notes during one part, lasting an hour. Notes will not be allowed during the remainder of the exam. The grade awarded will range between 0 and 10.
A short report must be submitted for each of the three practical assignments. An integer grade ranging between 0 and 3 will be awarded. The grade will be based on each report and on work in the lab class. The overall grade for the practical work will be the average of those for the three assignments.
The final grade will be calculated as follows:
- If the three practical assignments have been submitted and the average grade exceeds 0, then:
Final = min(10, exam + Practical work/2)
- If this is not the case (i.e., failure to submit all three assignments, or a zero grade for the three):
Final = Exam / 2
(-)