A B C D E. Hour Timing Hour Timing Hour Timing Hour Timing Hour Timing & &

Transcription

1 SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF CSE COURSE PLAN Course Code : CS0403 Course Title : Parallel Distributed Computing Semester : VII Course Time : June Nov 2013 DAY SECTION A B C D E Hour Timing Hour Timing Hour Timing Hour Timing Hour Timing Location Faculty Details : SRM University Kattankulathur Annexure Campus - Tech Park 1 Sec. Name Office Office hour Mail id A Mr. T.BALACHANDER Tech Park 7 th Floor Mon - Fri balachander.t@ktr.srmuniv.ac.in B Mrs.G.VIJAYALAKSHMI Tech Park 8 th Floor Mon - Fri vijayalakshmi@ktr.srmuniv.ac.in C Mrs. R.MANGALAGOWRI Tech Park 8 th Floor Mon - Fri mangalagowri.r@ktr.srmuniv.ac.in D Mrs. G.SIVAGAMI Tech Park 8 th Floor Mon - Fri sivagami.g@ktr.srmuniv.ac.in E Mr.B.MURUGANANTHAM Tech Park 7 th Floor Mon - Fri muruganantham.b@ktr.srmuniv.ac.in Required Text Books: 1. Ananth Grama, Vipin Kumar, "Introduction to parallel computing", Second edition, Cameron Hughes, Tracey Hughes, "Parallel and Distributed Programming using C++.Pearson education, 2005 REFERENCE BOOKS Albert y.zomaya, "Parallel and Distributed Computing Hand book" McGrawl Publications 2005 ONLINE REFERENCES 1

2 Objectives The purpose of this course is to provide the basics of parallel computing, algorithm design and parallel programming. Assessment Details Cycle Test I : 10Marks Surprise Test I : 5 Marks Cycle Test II : 10Marks Model Exam : 20 Marks Test Schedule S.No. DATE TEST TOPICS DURATION 1 As per the Cycle Test I Unit I II 2 periods 2 Academic Cycle Test - II Unit III IV 2 periods 3 Calendar Model Exam All 5 units 3 Hrs Outcomes Students who have successfully completed this course will have full understanding of the following concepts 1. Various Ideas in Parallel Computing 2. Various Types of Parallel Algorithms Detailed Session Plan Session No. Topics to be covered INTRODUCTION TO PARALLEL COMPUTING Time (min) Ref Teaching Method Testing Method Motivating Parallelism-Scope of parallel computing-parallel programming platforms-implicit Parallelism- Limitations of Memory System Performance-Dichotomy of Parallel computing platforms-physical organization of parallel platforms-communication costs in parallel machines- Routing mechanisms for inter connection networks 1 Introduction to parallel computing - Motivating Parallelism 50 1,2 BB Quiz 2 Scope of parallel computing 50 1,2 BB 3 Parallel programming platforms 50 1 BB 4 Implicit Parallelism 50 1 BB 5 Limitations of Memory System Performance 6 Dichotomy of Parallel computing platforms 7 Physical organization of parallel platforms 50 1 BB,, 2

3 8 Communication costs in parallel machines 9 Routing mechanisms for inter connection networks. 50 1,3 BB 50 1,3 BB PRINCIPLES OF PARALLEL ALGORITHM DESIGN Preleminaries-Decomposition techniques-characteristics of tasks and interactions-mapping techniques for load balancing-methods for containing interaction overheads-parallel algorithm models. 10 Principles of parallel algorithm design - Preliminaries 50 1,2 BB Discussion 11 Decomposition techniques 50 1 BB Illustration by examples 12 Decomposition techniques 13 Characteristics of tasks and interactions 14 Mapping techniques for load balancing 15 Mapping techniques for load balancing 16 Methods for containing interaction overheads 50 1 BB 50 1 BB Problem solving, surprise test 17 Parallel algorithm models BB Problem solving, surprise test 18 Parallel algorithm models. BASIC COMMUNICATION OPERATIONS One to all broadcast and all to one reduction-all to all broadcast and reduction -scatter and gather - sources of overhead in parallel programs-performance metrics for parallel systems-the effect of granularity on performance. 19 Basic communication operations - one to all broadcast and all to one reduction 50 1,2 BB Quiz 20 All to all broadcast and reduction 21 Scatter and gather 50 1 BB Surprise Test 22 Sources of overhead in parallel programs 23 Sources of overhead in parallel programs 3

4 24 Performance metrics for parallel systems 25 Performance metrics for parallel systems 26 The effect of granularity on performance. 27 The effect of granularity on performance. PROGRAMMING USING MESSAGE PASSING PARADIGM Principles of message passing programming-building blocks-message passing interface-topologies and embedding-overlapping computation with communication-collective communication and 28 Programming using message passing paradigm - Principles of message passing programming 29 Building blocks 30 Building blocks Quiz 31 Message passing interface 32 Topologies and embedding 50 1 BB Group discussion, Surprise test 33 Overlapping computation with communication 50 1 BB Group discussion, Surprise test 34 Overlapping computation with communication 35 Collective communication and 36 Collective communication and 50 1 BB Surprise test PROGRAMMING SHARED ADDRESS SPACE PLATFORMS Thread basics-why threads?-posix thread-thread basics-synchronization primitives in Pthreadscontrolling thread and synchronization attributes-composite synchronization constructs-case study:implementation of Chat Server. 37 Programming shared address space platforms - Thread basics 4

5 38 Why threads? 39 POSIX thread 40 Thread basics 41 Synchronization primitives in Pthreads 42 Controlling thread and synchronization attributes 50 1 BB Surprise test 50 1 BB 43 Composite synchronization constructs 50 1 BB 44 Case study: Implementation of Chat Server. 45 Case study: Implementation of Chat Server. BB Black Board Prepared By HOD/CSE Staff Name : Mr. T.BALACHANDER, AP /CSE Signature : 5