back to table of content


INF3334  Parallelity and parallel algorithms CourseINF
Lecturer : Prof. Dr. rer. nat. Friedhelm Mündemann   eMail | Homepage
Term4
Course Classification : Informatics, Intelligent systemsCH2
Language : German Type L
Type of examination : PVL1  Credits
Method of evaluation : written examination 90 min 
Requirements :  
Cross References :  
Previous knowledge : S1S in informatics 
Aids and special features :  
Teaching aims : Getting to know the defintions and phenomena of parallelities, Petri-nets to describe multi-threaded systems to be able to describe algorithm dependencies and data flow graphs, to be able to make parallel sequential algorithms. To get to know the problem of burden distribution on parallel computers. 
Contents :

Definitions, description of multi-threaded processes: Petri- nets. Making parallel sequential algorithms, dependency graphs, theoretical machine models and parallelity, parallel algorithms for the different classes according to FLYNN, burden distribution and scheduling. 

Literature :  


back to table of content