{"id":22076,"date":"2020-07-12T02:42:46","date_gmt":"2020-07-12T02:42:46","guid":{"rendered":"https:\/\/www.inspirenignite.com\/vtu\/18cs732-high-performance-computing-is-syllabus-for-be-7th-sem-2018-scheme-vtu-professional-elective-2\/"},"modified":"2020-07-12T02:42:46","modified_gmt":"2020-07-12T02:42:46","slug":"18cs732-high-performance-computing-is-syllabus-for-be-7th-sem-2018-scheme-vtu-professional-elective-2","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/vtu\/18cs732-high-performance-computing-is-syllabus-for-be-7th-sem-2018-scheme-vtu-professional-elective-2\/","title":{"rendered":"18CS732: High Performance Computing IS Syllabus for BE 7th Sem 2018 Scheme VTU (Professional Elective-2)"},"content":{"rendered":"

High Performance Computing detailed Syllabus for Information Science Engineering (IS), 2018 scheme has been taken from the VTUs<\/a> official website and presented for the VTU students. For Course Code, Subject Names, Teaching Department, Paper Setting Board, Theory Lectures, Tutorial, Practical\/Drawing, Duration in Hours, CIE Marks, Total Marks, Credits and other information, visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the official website of the university.<\/p>\n

For all the other VTU IS 7th Sem Syllabus for BE 2018 Scheme, visit Information Science Engineering 7th Sem 2018 Scheme<\/a>. <\/p>\n

For all the (Professional Elective-2) subjects refer to Professional Elective-2 Scheme<\/a>. The detail syllabus for high performance computing is as follows. <\/p>\n

Course Learning Objectives:<\/h4>\n

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
\"Get<\/a>. <\/p>\n

Module – 1<\/h4>\n

\nIntroduction to Parallel Computing: Motivating Parallelism, Scope of Parallel Computing, Parallel Programming Platforms: Implicit Parallelism: Trends in Microprocessor Architectures, Limitations of Memory System Performance, Dichotomy of Parallel Computing Platforms, Physical Organization of Parallel Platforms, Communication Costs in Parallel Machines, Routing Mechanisms for Interconnection Networks, Impact of Process-Processor Mapping and Mapping Techniques. T1: Ch: 1.1, 1.2, 2.1 – 2.7 RBT: L1, L2<\/p>\n

Module – 2<\/h4>\n

\nPrinciples of Parallel Algorithm Design: Preliminaries, Decomposition Techniques, Characteristics of Tasks and Interactions, Mapping Techniques for Load Balancing, Methods for Containing Interaction Overheads, Parallel Algorithm Models Basic Communication Operations: One-to-All Broadcast and All-to-One Reduction, All-to-All Broadcast and Reduction, All-Reduce and Prefix-Sum Operations, Scatter and Gather, All-to-All Personalized Communication, Circular Shift, Improving the Speed of Some Communication Operations T1: Ch 3, 4 RBT: L1, L2<\/p>\n

Module – 3<\/h4>\n

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
\"Get<\/a>. <\/p>\n

Module – 4<\/h4>\n

\nProgramming Shared Address Space Platforms: Thread Basics, Why Threads?, The POSIX Thread API, Thread Basics: Creation and Termination, Synchronization Primitives in Pthreads, Controlling Thread and Synchronization Attributes, Thread Cancellation, Composite Synchronization Constructs, Tips for Designing Asynchronous Programs, OpenMP: a Standard for Directive Based Parallel Programming Dense Matrix Algorithms: Matrix-Vector Multiplication, Matrix-Matrix Multiplication, Solving a System of Linear Equations Sorting: Issues in Sorting on Parallel Computers, Sorting Networks, Bubble Sort and its Variants, Quicksort, Bucket and Sample Sort. T1: Ch 7, 8 9 RBT: L1, L2<\/p>\n

Module – 5<\/h4>\n

\nGraph Algorithms: Definitions and Representation, Minimum Spanning Tree: Prim’s Algorithm, Single-Source Shortest Paths: Dijkstra’s Algorithm, All-Pairs Shortest Paths, Transitive Closure, Connected Components, Algorithms for Sparse Graphs, Search Algorithms for Discrete Optimization Problems: Definitions and Examples, Sequential Search Algorithms, Search Overhead Factor, Parallel Depth-First Search, Parallel Best-First Search, Speedup, Anomalies in Parallel Search Algorithms T1: Ch10, 11 RBT: L1, L2<\/p>\n

Course Outcomes:<\/h4>\n

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
\"Get<\/a>. <\/p>\n

Question paper pattern:<\/h4>\n

\n