BOOK-1

Book-1
Granularity(page-12)
Explain the various levels of parallel computing [specially instruction level and loop level]
(page-15)
Dataflow computing(DFG) (Page-16)
Application of parallel computing.(page-17)
Flynn’s Classification-SISD,SIMDMISD,MIMD(page-30)
Check progress 1. question no. 3) (Page-33)
Handler’s Classification(Page-33)
UMA,NUMA,COMA(page-37)
Explain Bernstein Conditions (page no.41)
What is Grain Size? What are the different categories of grain size? How do we classify
parallelism on the basis of grain size? (Page-42)
Check progress 3, question no. 1) & 2) (Page-43)
 Book-1
Network Diameter, Node degree, Blocking and non-Blocking network, Static and
Dynamic interconnection network (page-47.48)
Cross Bar network. (page-50)
Fat tree and systolic array(page-53)
Hyper cube(page-54 or book-2 page-46)
Clos network (page-58)
Benz Network(page-58 and 8 x 8 benz network figure in page 61, 23(a))
Clos network vs. benz network
Classification on pipeline processors(page-66)
Performance and issues in Pipelining
Vector Processing (Page-74)
Difference between scalar and vector processing
Check progress 2, question no. 2) page no. 79
VLIW Architecture (page-81)
BOOK-2
 Book-2
Analysis of Parallel algorithms- Asymptotic notations, speedup, cost, Efficiency(page-8)
Explain concept of storing in the combinational circuits.
Parallel Random Access Machines(PRAM) page-10
Page 13, Example-1.
Marge Sort circuit
Sorting using Interconnection Networks with example (page-16)
Algorithm Matrix Multiplication using CRCW & CREW and complexity (page-20)
MPI (page-27)
How to compile and run the PVM program (page-34)
Data Parallel Program (page-41)
Page 51, check progress 1: question 1) and 2)
Multi-statement FORALL construct (page-57)
Intrinsic Function (page-58)
Page-59, Check progress 2: Question no. 2) and 3)
OpenMp(page-60)
BOOK-3
 Book-3
Wait protocol and sole access protocol (page-8)
Unix for multiprocessor system (specially Master slave kernel) page-11
Metrics for performance Evaluation-Running time, speed up, Efficiency (page-15)
Amdahl’s Law (page-20) very very important
Gustafson’s law (page-22)
Sun and ni’s Law(page-24)
List the various visualization tools in performance analysis (page-26)
Shared memory model, threads model, message passing model
Grid computing and Cluster computing , grid computing vs. cluster computing (page-35)
Intel Architecture- 64 (IA-64) page- 37
Hyper Threading (page-40)