| Course Title | Parallel algorithms
|
||||||||||||||
| Faculty
|
School of Computing | ||||||||||||||
| Study Programme
|
Computer Science | ||||||||||||||
| Professor | Stevan Milinković | Contact (e-mail address) | smilinkovic@raf.rs | ||||||||||||
| Code | 14.8013 | Course level | Undergraduate | ECTS credits | 6 | ||||||||||
|
Description (max. 100 words) |
Parallel computing models: local memory, shared memory, data flow and systolic arrays. Network topologies of multiprocessor systems: mesh, pyramids, trees mesh, hypercube. Measures of parallel complexity. The design of parallel algorithms for machines with shared memory. Parallel data structures; automatic parallelization of sequential programs. Design and analysis of parallel algorithms for various problems, including: basic arithmetic, the choice of the m-th largest element, searching, sorting, merging, matrix operations, shortest path, minimum overlay tree, load balancing, routing. Complexity theory of parallel algorithms. Methods of formal specifications for parallel systems. Synchronization, mutual exclusion. Broadcast algorithms. Task termination and deadlock detection. Time synchronization. | ||||||||||||||
| Learning outcomes
(max. 50 words) |
Student has basic knowledge of parallel algorithms and concurrent
processing. He is capable of using basic parallel programming techniques, such as those based on MPI and shared memory. He understands the theoretical aspect of parallel algorithm complexity. He is able to design and implement various parallel algorithms. |
||||||||||||||
| Semester
|
5 | Maximum number of visiting students | 10 | ||||||||||||
| Language | Serbian, English | Available for international students (YES or NO) | YES | ||||||||||||
About the Author: testuser
Leave A Comment
You must be logged in to post a comment.