AL-AZHAR COLLEGE OF ENGINEERING AND TECHNOLOGY

LESSON PLAN SUBJECT: CS010 801: HIGH PERFORMANCE COMPUTING

Sl No. Topics Introduction to parallel processing,Trends towards parallel processing Parallelism in uniprocessor Parallel computer structures Architecture classification schemes Amdahls law Indian contribution to parallel processing Principles of pipelining and vector processing Linear pipelining Classification of pipeline processors Number Proposed of Hours Date 1 2 2 2 1 1 1 1 1 2 1 2 1 2 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 7/1/2014 Actual Date 7/1/2014 Remark

1 Module I 2,3 4,5 6,7 8 9 10 11 12

10/1/2014 17/1/2014 17/1/2014 22/1/2014 24/1/2014 24/1/2014 28/1/2014 29/1/2014 29/1/2014 31/1/2014 4/2/2014 5/2/2014 7/2/2014 11/2/2014 12/2/2014 12/2/2014 14/2/2014 14/2/2014 18/2/2014 19/2/2014 21/2/2014 21/2/2014 4/3/2014 5/3/2014 5/3/2014 7/3/2014 7/3/2014 11/3/2014 12/3/2014 E9 E10 E3,E4 E5 E6 E7 E8 E1 E2

13,14 General pipelines Module II 15 Instruction and Arithmetic pipelines

16,17 Design of Pipelined instruction unit 18 Principles of Designing Pipeline Processors

19,20 Instruction prefetch and branch handling 21 22 23 24 25 Data Buffering and Busing Structure Internal forwarding and register tagging Hazard detection and Resolution Dynamic pipelines and Reconfigurability Array processors

26,27 SIMD array processors 28 29 Module III 30 31 32 33 34 35 36 Interconnection networks Static vs dynamic networks mesh connected networks Cube interconnection networks Parallel algorithms for array processors SIMD matrix multiplication Parallel sorting on array processors Associative array processing Memory organization

37

Multiprocessor architectures and Programming

1 2 2 2 2 2 1 2 2 1 2 1 1 2 2 1

14/3/2014 18/3/2014 19/3/2014 21/3/2014 26/3/2014 28/3/2014 1/4/2014 2/4/2014 4/4/2014 8/4/2014 9/4/2014 11/4/2014 11/4/2014 22/4/2014 23/4/2014 25/4/2014 E20,E21 E22,E23 E24 E11,E12 E13,E14 E15 E16,E17 E18,E19

38,39 Loosely coupled 40,41 Tightly coupled multiprocessors Module IV 42,43 Interconnection networks 44,45 Interconnection networks 46,47 Language features to exploit parallelism 48 Interprocess communication mechanism

49,50 Process synchronisation mechanisms 51,52 53 synchronization with semaphores Dataflow computers

54,55 Data driven computing and Languages Module V 56 57 Data driven computing and Languages Data flow computers architectures

58,59 Static data flow computer 60,61 Dynamic data flow computer 62 Data flow design alternatives

Kala O.S

AL-AZHAR COLLEGE OF ENGINEERING AND TECHNOLOGY

LESSON PLAN SUBJECT: CS010 601:DESIGN AND ANALYSIS OF ALGORITHMS
Sl No. 1 2 3 4 Module I 5 6 7 8,9 10 11 12 13 Module II 14 15 Topics What is an algorithm Properties of an Algorithm Development of an algorithm Pseudocode Conventions,Recursive Algorithms Performance Analysis -Space complexity and Time Complexity Asymptotic Notations Oh, Omega, Theta Worst, Best and Average Case Complexity Running Time Comparison Common Complexity Functions Recurrence Relations Solving Recurrences using Iteration and Recurrence Trees Profiling - Amortized Complexity Divide and Conquer - Control Abstraction Finding Maximum and Minimum Costs associated element comparisons and index comparisons Binary Search Divide and Conquer Matrix Multiplication 2 1 1 1 1 1 1 2 1 1 1 1 2 2 1 1 1 27/1/2014 28/1/2014 28/1/2014 31/1/2014 31/1/2014 3/2/2014 4/2/2014 5/2/2014 7/2/2014 10/2/2014 11/2/2014 12/2/2014 14/2/2014 17/2/2014 7/2/2014 10/2/2014 3/2/2014 4/2/2014 4/2/2014 5/2/2014 5/2/2014 Number Proposed of Hours Date 1 1 1 1 1 1 1 7/1/2014 8/1/2014 Actual Date 7/1/2014 8/1/2014 Remark

17/1/2014 17/1/2014 20/1/2014 20/1/2014 21/1/2014 21/1/2014 22/1/2014 24/1/2014 24/1/2014 27/1/2014

16,17 Stressens Matrix Multiplication 18 19 20 21 Quick Sort Merge Sort Greedy Strategy - Control Abstraction,General Knapsack Problem Minimum Cost Spanning Trees

18/2/2014 19/2/2014 21/2/2014 28/2/2014 3/3/2014 4/3/2014 5/3/2014 7/3/2014 10/3/2014

22,23 PRIMs Algorithm Module III 24,25 Kruskals Algorithm 26 27 28 Job sequencing with deadlines Dynamic Programming - Principle of Optimality Multistage Graph Problem

Module 29 30 31

Forward Approach Backward Approach All-Pairs Shortest Paths

1 1 1 2 1 1 1 1 2 2 1 1 1 1 1 1 1 1 1 1 1

11/3/2014 12/3/2014 14/3/2014 17/3/2014 18/3/2014 18/3/2014

32,33 Traveling Salesman Problem. 34 35 Module IV 36 37 Backtracking State Space Tree Fixed Tuple and Variable Tuple Formulation Control Abstraction Generating Function and Bounding Function Efficiency of the method

38,39 Monte Carlo Method 40,41 N-Queens Problem, Sum of Subsets 42 Branch and Bound Techniques FIFO, LIFO 43 LC Control Abstractions, 15-puzzle Sophisticated Algorithms - Approximation 44 Algorithms 45 Planar Graph Coloring, Vertex cover 46 47 String Matching Algorithms Rabin Karp algorithm Topological Sort Deterministic and Non-Deterministic Algorithms Lower Bound Theory - Comparison Trees for Searching and Sorting lower bound on comparison based algorithms, Sorting, Selection & Merging Oracles and Adversary Arguments Merging Basic concepts of randomized algorithm,Las Vagas algorithm for search

Module V

48 49 50 51 53

Kala O.S

AL-AZHAR COLLEGE OF ENGINEERING AND TECHNOLOGY

LESSON PLAN SUBJECT: CS010 607: Operating Systems Lab
Sl No. Topics Basic UNIX commands Shell programming Programs Using Unix System Calls(fork, exec, getpid, exit, wait, close, stat, opendir, readdir) Programs using Unix I/O System calls(open read write) Simulation of Unix commands using C Implement the following CPU Scheduling Algorithms. i) FCFS iii) Shortest Job First Implement the following CPU Scheduling Algorithms i) Round Robin iii) priority based. Implement the Producer Consumer problem using semaphores. Implement inter-process communication using shared memory Implement memory management schemes Number Proposed of Hours Date Actual Date Remark

1 2 3 4

5 6 7 8 9 10