B.E. Computer Science & Engineering:Parallel Computing

First Year: Semester I Mathematics I Engineering graphics Computer Programming Physics Solid Mechanics Communication Skill First Year: Semester-II Mathematics II Manufacturing Process Chemistry Electrical and Electronic Science Thermodynamics Organizational Behavior Second Year- Semester - I Measurement Science and Techniques Optimization Techniques Semiconductor Devices Data Structures Discrete Mathematical Structures Digital Electronic Circuits Human Values, Ethics and IPR Second Year- Semester – II Numerical and Statistical Methods Electrical Engineering Materials Computer System Architecture Principles of Programming Languages Analysis and Design of Information Systems Operating Systems Environmental Studies Third Year- Semester – I Object Oriented Programming Theory of Computation Computer Networks Data Base Management Systems Software Engineering Microprocessors Summer Training Third Year- Semester – II Total Quality Management Algorithm Analysis and Design Software Project Management Internet and Web Technologies Fourth Year- Semester – I Engineering Economics System Software Compiler Construction Computer Graphics Artificial Intelligence Fourth Year- Semester – II Project Semester Project Industrial Training(6 weeks) Parallel Computing Introduction: What is parallel and distributed computing? Scope of parallel and distributed computing; Scope of parallel computing. Parallel Programming Platforms: implicit parallelism, Dichotomy of parallel computing platforms, Physical organization for parallel platforms, communication cost in paralle machines , routing mechanism for interconnection networks. Basic Communication Operation: One-to-all broadcast; All-to-all broadcast; Reduction and prefix sums; One-to-all personalized communication; All-to-all personalized communication; Performance and Scalability of Parallel Systems: Performance matrices for Parallel systems � Run time, Speed up, Efficiency and Cost; The effect of granularity on performance Sorting: Sorting networks; Bubble sort and its variants; Quick sort and other sorting algorithms Dynamic Programming: Overview of dynamic programming,Serial monadic DP Formulations : The shortest path Problem, the 0/1 Knapsack Problem, Serial Polyadic DP Formualtion : Floyad�s all pair shortest paths algorithms.