Skip to content
CampusPrep
AL-802 (B) · High Performance computing/Important Questions

High Performance computing (AL-802 (B)) - Important Questions

  1. Unit 27 Marks Medium Priority Asked: 2024

    What is the concept of a block within a block in blockchain technology and how does it contribute to the overall structure?

    Directly transcribed from May 2024 past paper, Unit 2 question (Reference: A BLOCKCHAIN TECHNOLOGIES - MAY 2024).

  2. Unit 27 Marks Medium Priority Asked: 2024

    Explain the concept of a Merkle tree and its role in ensuring efficient data verification in blockchain technology.

    Directly transcribed from May 2024 past paper, Unit 2 question (Reference: A BLOCKCHAIN TECHNOLOGIES - MAY 2024).

  3. Unit 214 Marks Low Priority

    Apply Amdahl's law to compute theoretical speedup for a parallel program and discuss limits to scaling.

    Core performance law for parallel scaling; fundamental Unit 2 topic used frequently in exams and assignments.

  4. Unit 27 Marks Low Priority

    Explain memory hierarchy and compute average memory access time given hit rates and latencies for L1, L2 and main memory.

    Standard Unit 2 question on memory hierarchy and AMAT calculations; common examination exercise.

  5. Unit 210 Marks Low Priority

    Describe OpenMP parallel for, data scoping clauses (shared/private/reduction) and common pitfalls (race conditions, false sharing).

    Typical practical question on OpenMP constructs, data scoping and concurrency pitfalls in Unit 2.

  6. Unit 210 Marks Low Priority

    Compare MPI point-to-point and collective communications; when to use non-blocking vs blocking communication.

    Common comparative question in Unit 2 covering MPI communication models and when to choose blocking vs non-blocking.

  7. Unit 214 Marks Low Priority

    Perform a roofline / balance model calculation: given FLOP count and memory traffic, estimate whether kernel is compute- or memory-bound.

    Roofline / balance model calculations are central to Unit 2 performance analysis; typical long-answer problem.

  8. Unit 210 Marks High Priority

    Explain data access optimization techniques to improve cache locality and reduce memory traffic. Cover cache blocking (tiling), loop interchange, array padding, and prefetching; include examples and expected performance effects.

    High-frequency Unit 2 topic per analytics heatmap: concrete question synthesizing data access optimization techniques.

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