FI:I009 Parallel Computing - Course Information

I009 Parallel Computing

Faculty of Informatics
Spring 1996

Extent and Intensity

0/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

doc. Ing. Lenka Carr Motyčková, CSc. (lecturer)

Guaranteed by

Contact Person: doc. Ing. Lenka Carr Motyčková, CSc.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

Syllabus

The course gives basic knowledge on parallel computing in terms of computational theoretical models, basic algorithms for each model, examples of architectures and some typical programming concepts. Some issues of parallel computation synchronisation are considered (e.g. semaphores, monitors).
Flynn classification of parallel models; pseudoparalelismus.
Complexity of parallel algorithms, parallel computational thesis.
Array processor SIMD; Connection machine, DAP, MPP.
Vector machines algorithms.
Pipelining, systolic arrays.
Shared memory - fork-join, cobegin.
Statement, procedure, program-level concurency.
Basic parallel algorithms.
A critical section problem - semaphores, critical regions, monitors.
Examples of languages for the shared memory.
Message passing - channels, mailboxes.
Client-server model, a distributed monitor.
Examples of languages for the message passing.

Language of instruction

Czech

The course is also listed under the following terms Spring 1997, Spring 1998, Spring 2000, Spring 2001, Spring 2002.