Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Mod 9 Self Assess

    Uploaded by

    studydatadownload
    This document summarizes key concepts from lectures on parallel programming: - In SIMD parallel computers, the same instruction is executed with possibly different data on all processors simultaneously. - In a 3D torus interconnect, each node is connected to 6 neighboring nodes. - In a snoopy invalidate cache coherence protocol, a node must broadcast an invalidate signal when it modifies a cached data block.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Mod 9 Self Assess

    Uploaded by

    studydatadownload
    10 views1 page
    This document summarizes key concepts from lectures on parallel programming: - In SIMD parallel computers, the same instruction is executed with possibly different data on all processors simultaneously. - In a 3D torus interconnect, each node is connected to 6 neighboring nodes. - In a snoopy invalidate cache coherence protocol, a node must broadcast an invalidate signal when it modifies a cached data block.

    Original Description:

    os

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes key concepts from lectures on parallel programming: - In SIMD parallel computers, the same instruction is executed with possibly different data on all processors simultaneously. - In a 3D torus interconnect, each node is connected to 6 neighboring nodes. - In a snoopy invalidate cache coherence protocol, a node must broadcast an invalidate signal when it modifies a cached data block.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    10 views1 page

    Mod 9 Self Assess

    Uploaded by

    studydatadownload
    This document summarizes key concepts from lectures on parallel programming: - In SIMD parallel computers, the same instruction is executed with possibly different data on all processors simultaneously. - In a 3D torus interconnect, each node is connected to 6 neighboring nodes. - In a snoopy invalidate cache coherence protocol, a node must broadcast an invalidate signal when it modifies a cached data block.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Module 9 (Lectures 38-41) Introduction to Parallel programming

    1. In an SIMD parallel computer,


    a) a single stream of instructions is fetched from memory and divided across
    all the processors of the parallel computer
    b) the execution of a single instruction is divided across all the processors of
    the parallel computer
    c) the same instruction is executed with the same data on all processors of
    the parallel computer
    d) the same instruction is executed with possibly different data on all
    processors of the parallel computer
    2. In a 3-dimensional torus interconnect, each node has
    a) 3 neighbours
    b) 4 neighbours
    c) 5 neighbours
    d) 6 neighbours
    3. In a snoopy invalidate cache coherence protocol
    a) all nodes must monitor the invalidate signals being broadcast
    b) all nodes must broadcast invalidate signals when they observe block fetches
    c) a node must broadcast an invalidate signal when it modifies a cache block in
    cache
    d) a node must respond to invalidate signals on blocks that it does not hold
    4. An MPI communicator is
    a) a process that is sending a message
    b) a process that is receiving a message
    c) a process involved in a collective communication
    d) a set of processes that can communicate among themselves
    5. Which of the following is not a collective MPI communication call?
    a) MPI_ Bcast
    b) MPI_Scatter
    c) MPI_Reduce
    d) MPI_Comm_Rank

    You might also like