RTMNU TY IT syllabus

RTMNU · Third Year B.Tech Information Technology · NEP 2020

Parallel Computer Architecture and Programming

BIT5T18.1 · Elective I · Semester V · 3 credits · College 30 + university 70

One of the Elective I options.

  1. Unit 1: Introduction and Techniques of Parallelism

    7 hours

    Trends towards parallel computing and parallelism in uniprocessors; architectural classification schemes; Amdahl's and Moore's laws and scalable performance; parallel processing in memory, parallel algorithms and their complexity, models of parallel processing; cache coherence.

    Examined in the 70-mark end-semester paper

    • Levels of parallelism
    • Flynn's taxonomy
    • Speedup: Amdahl's and Gustafson's laws
    • Scalability and cost-optimality
    • Parallel algorithm models
    • Cache coherence and NUMA
  2. Unit 2: Pipeline and Vector Processing

    7 hours

    Conditions of parallelism — data and resource dependences; control-flow versus data-flow computers; linear pipelining and the classification of pipeline processors, general pipelines and reservation tables; instruction and arithmetic pipelines and pipeline hazards; vector processing and the Cray-1; VLIW computers and array processing.

    Examined in the 70-mark end-semester paper

    • Conditions of parallelism: data and resource dependences
    • Control-flow versus data-flow computers
    • Linear pipelines and reservation tables
    • Instruction pipelining
    • Vector processing, VLIW and array processors
  3. Unit 3: Parallel Models

    7 hours

    PRAM and its basic algorithms; data broadcasting and parallel prefix computation; shared-memory algorithms and parallel selection; circuit-level examples, tree-structured dictionary machines and parallel prefix networks; sorting and routing on a 2-D mesh or torus, data-routing operations and greedy routing.

    Examined in the 70-mark end-semester paper

    • PRAM model and basic parallel algorithms
    • Parallel prefix computation
    • Broadcast and reduction operations
    • Parallel sorting
    • Data routing operations and greedy routing
  4. Unit 4: Mesh-Based Architectures

    8 hours

    2-D mesh algorithms, meshes of trees and low-diameter architectures; hypercubes and their algorithms — sorting and routing, bitonic sorting, dimension-order routing and broadcasting; butterfly, permutation, plus-or-minus-2^i, cube-connected cycles and shuffle-exchange networks.

    Examined in the 70-mark end-semester paper

    • Interconnection networks
    • Mesh and hypercube algorithms
    • Butterfly, shuffle-exchange and cube-connected cycles networks
  5. Unit 5: Multiprocessor Architecture and Programming

    5 hours

    Emulation and scheduling among architectures; distributed shared memory; data storage, input and output; multithreading and latency hiding; parallel I/O; defect-, fault- and error-level methods; parallel programming, parallel operating systems and parallel file systems.

    Examined in the 70-mark end-semester paper

    • Shared and distributed memory systems
    • Multithreading and latency hiding
    • Parallel I/O and parallel file systems

Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).