Home  »  Institute of Science »  Master's of Computer Engineering without Thesis

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
PARALLEL ALGORITHMS BİL549 - 3 + 0 10

TYPE OF COURSE UNITElective Course
LEVEL OF COURSE UNITMaster's Degree Without Thesis
YEAR OF STUDY-
SEMESTER-
NUMBER OF ECTS CREDITS ALLOCATED10
NAME OF LECTURER(S)-
LEARNING OUTCOMES OF THE COURSE UNIT At the end of this course, the students;
1) Learn fundamental concepts of parallel programming.
2) Learn parallelism, their principles and structures.
3) Understand the basics of parallel machine structure.
4) Learn parallel algorithm design, analyze and implementation.
5) Understand the possible limitations of parallel processing.
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSENo
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE DEFINITIONParallel programming techniques. Classification of parallel processing systems. Parallel computer architectures. A comprehensive study of basic techniques: Parallel Computer Models; Message-Passing Computing; Pipelined Computations; Programming with Shared Memory; Algorithms and Applications connected with Parallel Processing.
COURSE CONTENTS
WEEKTOPICS
1st Week Parallel programming techniques.
2nd Week Parallel programming techniques.
3rd Week Parallel programming techniques.
4th Week Parallel programming techniques.
5th Week Classification of parallel processing systems.
6th Week Classification of parallel processing systems.
7th Week Classification of parallel processing systems.
8th Week Mid-term
9th Week Parallel computer architectures.
10th Week Parallel computer architectures.
11th Week Parallel computer architectures.
12th Week Parallel computer architectures.
13th Week A comprehensive study of basic techniques: Parallel Computer Models; Message-Passing Computing; Pipelined Computations; Programming with Shared Memory; Algorithms and Applications connected with Parallel Processing.
14th Week A comprehensive study of basic techniques: Parallel Computer Models; Message-Passing Computing; Pipelined Computations; Programming with Shared Memory; Algorithms and Applications connected with Parallel Processing.
RECOMENDED OR REQUIRED READING1. Introduction to Parallel Computing, V. Kumar, A. Grama, A. Gupta and G. Karypis, V. Kumar (second edition), 2003
2. Addison Wesley Parallel Programming with MPI, P. Pacheco, Morgan Kaufmann Publishers, Inc., 1997.
3. MPI Related Materials Scalable Parallel Computing, Kai Hwang and Zhiwei Xu, 2000
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSLecture,Questions/Answers,Presentation,Experiment,Practice,Problem Solving,Project,Report Preparation
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Quiz315
Project115
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
ECTS WORKLOAD
Activities Number Hours Workload
Midterm exam122
Preparation for Quiz
Individual or group work1411154
Preparation for Final exam16969
Course hours14342
Preparation for Midterm exam14444
Laboratory (including preparation)
Final exam122
Homework
Total Workload313
Total Workload / 3010,43
ECTS Credits of the Course10
LANGUAGE OF INSTRUCTIONTurkish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3LO4LO5
K1  X   X     X   X
K2    X   X   X  
K3        X   X
K4    X   X   X  
K5      X   X  
K6  X   X   X   X  
K7      X   X  
K8      X   X  
K9      X   X  
K10      X   X  
K11      X   X  
K12      X   X