|
BIL5090 | Parallel Processing | 3+0+0 | ECTS:7.5 | Year / Semester | Spring Semester | Level of Course | Second Cycle | Status | Elective | Department | DEPARTMENT of COMPUTER ENGINEERING | Prerequisites and co-requisites | None | Mode of Delivery | Face to face | Contact Hours | 14 weeks - 3 hours of lectures per week | Lecturer | Prof. Dr. Cemal KÖSE | Co-Lecturer | None | Language of instruction | Turkish | Professional practise ( internship ) | None | | The aim of the course: | The purpose of this course is to introduce genaral purpose parallel processing and parallel programming approaches. |
Programme Outcomes | CTPO | TOA | Upon successful completion of the course, the students will be able to : | | | PO - 1 : | give details of parallel computer models and evaluate modern parallel computers. | 1,3,4,5,8,9,10,11,12,14,15 | 1 | PO - 2 : | implement problems in parallel and explain the difficulties in parallel programming. | 1,3,4,5,7,8,9,12,13 | 1 | PO - 3 : | explain computational models, problem decomposition, problem solving methodologies, and evaluate parallel applications. | 1,3,4,5,7,8,9,10,11,13,14,15 | 1,3 | PO - 4 : | apply task, data management techniques for parallel programming. | 2,3,4,5,7,8,9,10 | 1 | PO - 5 : | determine communication strategies for general purpose parallel computations. | 2,3,4,5,7,8,9,15 | 1,3 | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), PO : Learning Outcome | |
Introduction to parallel processing. Parallel computer architectures. Parallel Paradigms; PRAM, UMA, NUMA, COMA, and PVM models. Synchronous parallel models. Synchronization and communication primitives. Implementing problems in parallel; Inherited difficulties. Problem decomposition; domain decomposition and algorithmic decomposition. Parallel problem solving methodologies. The SAMD model. Evaluating parallel implementations. Computational models; The data driven model. The demand driven model. Task management. Data management. System communication and network models; Configurations. Communication strategies. Routing and minimization redundant messages. A problem solving methodology. Data diffusion machine. Pseudo codes; Sequential and parallel constructs. |
|
Course Syllabus | Week | Subject | Related Notes / Files | Week 1 | Introduction to parallel processing and Parallel computer architectures | | Week 2 | Parallel Paradigms; PRAM, UMA, NUMA, COMA, and PVM models | | Week 3 | Synchronous parallel models. Synchronization and communication primitives | | Week 4 | Implementing problems in parallel; Inherited difficulties | | Week 5 | Problem decomposition; domain decomposition and algorithmic decomposition | | Week 6 | Parallel problem solving methodologies | | Week 7 | The SAMD model. Evaluating parallel implementations | | Week 8 | Computational models; The data driven model. The demand driven model | | Week 9 | Mid-term exam | | Week 10 | Task management | | Week 11 | Data management. | | Week 12 | Data consistency, and sort exam | | Week 13 | System communication and network models; Configurations. Communication strategies | | Week 14 | Routing and minimization redundant messages
| | Week 15 | A problem solving methodology | | Week 16 | End-of-term exam | | |
1 | Alan Chalmers (1996), Practical parallel processing, Thomson Computer Press | | |
1 | Barry Wilkinson (1999), Parallel Programming; Techniques and applications using networked worksataions and parallel computers, Prentice Hall.
| | 2 | Kai Hwang (1993), Advanced computer architecture; parallelism, sclability and programmability, McGraw Hill.
| | |
Method of Assessment | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | Mid-term exam | 9 | 07/04/2013 | 2 | 50 | End-of-term exam | 16 | 02/06/2013 | 2 | 50 | |
Student Work Load and its Distribution | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | Yüz yüze eğitim | 3 | 14 | 42 | Sınıf dışı çalışma | 6 | 14 | 84 | Arasınav için hazırlık | 22 | 1 | 22 | Dönem sonu sınavı için hazırlık | 30 | 1 | 30 | Dönem sonu sınavı | 2 | 1 | 2 | Diğer 1 | 10 | 1 | 10 | Diğer 2 | 10 | 1 | 10 | Total work load | | | 200 |
|