Ia 1 - Aca
Ia 1 - Aca
Module -1
1
b Explain the detection of parallelism in a program using Bernstein’s conditions 04 CO1 L5
OR
Explain Polynomial and Exponential-Complexity algorithms with example of
a 06 CO1 L2
sorting n numbers and (n x n) matrices
2
b Explain static Multiprocessor scheduling 04 CO1 L5
Module -2
Explain the digital Equipment VAX8600 processor and The intel i860 processor
3 10 CO2 L5
architecture with a neat diagram
Explain TLB, Paging and segmentation built into the intel i486 CPU in Virtual
4 10 CO2 L5
memory technology
OR
Module 1&2
I IA SYLLABUS
Module – 1 Teaching Hours Theory of Parallelism: Parallel Computer Models, The State of Computing, Multiprocessors
and Multicomputer ,Multivector and SIMD Computers ,PRAM and VLSI Models, Program and Network Properties
,Conditions of Parallelism, Program Partitioning and Scheduling, Program Flow Mechanisms, System Interconnect
Architectures, Principles of Scalable Performance, Performance Metrics and Measures, Parallel Processing
Applications, Speedup Performance Laws, Scalability Analysis and Approaches.
10 Hours
Module – 2 Hardware Technologies: Processors and Memory Hierarchy, Advanced Processor Technology, Superscalar
and Vector Processors.
7 Hours
Subject Incharge