Skip to content
IT-803 (D) · Parallel Computing/Unsolved PYQ Paper

IT-803-D Parallel Computing - Jun 2025 Question Paper

Under each question, How to answer lists the points an answer should cover, outlined by CampusPrep from the syllabus. Check the details against your textbook.

  1. 14 Marks
    Distinguish among computer terminologies in each of the following groups:
    1. a)Parallelism versus pipelining
    2. b)Serial versus parallel processing
    3. c)Control flow computers versus data flow computers
    4. d)Uniprocessor systems versus multiprocessors systems
    How to answer
    • Define parallelism vs pipelining, serial vs parallel, control-flow vs data-flow, uniprocessor vs multiprocessor
    • Compare on key aspects: execution model, control, dependency, hardware
    • Give one example for each term
  2. 7 Marks
    aDescribe atleast four characteristics of MIMD multiprocessors that distinguish them from multiple computer systems or computer networks?
    How to answer
    • Define MIMD multiprocessors
    • List at least four distinguishing characteristics vs multicomputer systems/networks
    • Explain tight coupling, shared memory, communication, synchronization
    • Give example
  3. 7 Marks
    bProve that a k-stage linear pipeline can be at most k times faster than that of a non pipelined serial processor.
    How to answer
    • Define k-stage linear pipeline timing and non-pipelined timing
    • Derive speedup formula S = k*n/(k+n-1)
    • Show limit tends to k as n increases
    • Conclude at most k times faster
  4. 7 Marks
    aWhat are the disadvantages of a cache using Virtual addresses?
    How to answer
    • Define virtually addressed cache
    • List disadvantages: aliasing/synonyms, homonyms, protection, context switch flush
    • Explain coherence and translation issues
  5. 7 Marks
    bDifferentiate between:
    1. i)Centralized Vs Distributed Shared caches
    2. ii)Snooping based vs directory based cache coherence protocol
    How to answer
    • Define centralized vs distributed shared caches with structure
    • Define snooping vs directory based coherence protocols
    • Compare on scalability, bandwidth, overhead, suitability
    • Give examples
  6. 7 Marks
    aDiscuss the architecture of a modern GPU. Give its applications.
    How to answer
    • Describe modern GPU architecture: SMs, CUDA cores, memory hierarchy
    • Explain SIMT execution, interconnect
    • List applications: graphics, HPC, AI/ML, scientific computing
  7. 7 Marks
    bWhat is the difference between transaction and transactional memory? Explain briefly.
    How to answer
    • Define transaction vs transactional memory
    • Explain hardware vs software transactional memory
    • Highlight differences in abstraction, atomicity, implementation
  8. 7 Marks
    aDiscuss the architectural characteristics of future systems.
    How to answer
    • Define future systems trends
    • List architectural characteristics: heterogeneity, scalability, energy efficiency
    • Explain multicore, accelerators, interconnect
  9. 7 Marks
    bBriefly characterize the multicache coherence problem and describe various methods that have been suggested to cope with the problem.
    How to answer
    • Define multicache coherence problem with example
    • Explain write-update, write-invalidate, snooping, directory methods
    • Compare methods and coping strategies
  10. 7 Marks
    aExplain the four categories of parallelism. What are the steps to design parallel program?
    How to answer
    • Define four categories of parallelism: job, task, data, pipeline
    • Explain each with example
    • List steps to design parallel program: partitioning, communication, agglomeration, mapping
  11. 7 Marks
    bExplain Distributed-Memory Programming with MPI.
    How to answer
    • Define distributed-memory model
    • Explain MPI concepts: processes, communicators, point-to-point and collective communication
    • Describe programming steps with example
  12. 7 Marks
    aExplain the performance metric of parallel system.
    How to answer
    • Define performance metrics: speedup, efficiency, scalability, Amdahl's law
    • Give formulas for speedup and efficiency
    • Explain factors affecting performance
  13. 7 Marks
    bGive a brief note on I/O handling in parallel programming language.
    How to answer
    • Define I/O challenges in parallel programming
    • Explain parallel I/O modes, MPI-IO concepts
    • List handling techniques and examples
  14. 14 Marks
    Write brief notes:
    1. i)Thread Management
    2. ii)Parallel Data Management
    3. iii)Fusing Map and scan
    How to answer
    • Define thread management: creation, synchronization, scheduling
    • Explain parallel data management issues
    • Explain fusing map and scan operations with example
Go to where you left off?

Quick Add to Notes

Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.

Create free account

Have an account? Log in