• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS CME 4405 PARALLEL COMPUTING ELECTIVE 2 2 0 6

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ADIL ALPKOÇAK

Offered to

Computer Engineering

Course Objective

The goal of this course is to introduce students to the foundations of parallel algorithm design, including the principles of parallel computer architectures. Students will learn thinking in parallel to write their own simple parallel programs for shared- and distributed-memory systems

Learning Outcomes of the Course Unit

1   Understand parallel computer architecture 2   Ability to develop parallel programs for distributed memory architectures using MPI 3   Ability to develop parallel programs for shared memory architectures using OpenMP 4   Analyze time cost of a parallel algorithm for a given parallel architectures 5   Understand basic parallel algorithms for sorting and searching

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

CME 2201 - DATA STRUCTURES

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Computer Architecture preliminaries 2 Distributed and shared memory Parallel Computer Architecture 3 Analyzing parallel Algorithms 4 Analyzing parallel Algorithms 5 Distributed-Memory Parallel Programming (MPI) 6 Distributed-Memory Parallel Programming (MPI) 7 Distributed-Memory Parallel Programming (MPI) 8 Shared-Memory Parallel Programming (OpenMP) 9 Shared-Memory Parallel Programming (OpenMP) 10 Shared-Memory Parallel Programming (OpenMP) 11 Midterm Exam 12 Hybrid (OpenMP and MPI) Programming 13 Hybrid (OpenMP and MPI) Programming 14 Recap

Recomended or Required Reading

Pacheco, Peter S., An introduction to parallel programming, Morgan Kaufmann Publishers for Elsevier, 2011 (ISBN 978-0-12-374260-5)

Planned Learning Activities and Teaching Methods

Presentation/Lecturing, Applications, programming practice and exercises

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 PRC PRACTICE 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE*0.30+PRC *0.20+FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE*0.30+PRC *0.20+RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Department of Computer Engineering Dokuz Eylul University Tinaztepe Buca, 35160 Izmir, Turkey Tel: +90-232-3017408 Fax: +90-232-3017401

Office Hours

Tuesday 9.30 - 12:30

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 12 2 24 Tutorials 12 2 24 Preparations before/after weekly lectures 12 2 24 Preparation for midterm exam 1 16 16 Preparation for final exam 1 16 16 Preparing assignments 3 16 48 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 156

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 LO.1 5 3 5 2 LO.2 5 3 5 2 LO.3 5 3 5 2 LO.4 5 3 5 2 LO.5 5 3 5 2