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

Welcome to Scribd!

  • 146 views

    Mcse 011

    Uploaded by

    e_reader
    This document contains information about a parallel computing exam, including: 1) The exam is for the course MCSE-011: Parallel Computing and will take place in June 2009 with a maximum of 100 marks. 2) There are 5 questions, with question 7 being compulsory and students must attempt 3 other questions. 3) The questions cover topics like Bernstein conditions for parallelism detection, asymptotic notations, parallel computer classifications, permutation networks, systolic arrays, hypercubes, dataflow computing applications, and performance analysis of parallel algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Mcse 011

    Uploaded by

    e_reader
    146 views4 pages
    This document contains information about a parallel computing exam, including: 1) The exam is for the course MCSE-011: Parallel Computing and will take place in June 2009 with a maximum of 100 marks. 2) There are 5 questions, with question 7 being compulsory and students must attempt 3 other questions. 3) The questions cover topics like Bernstein conditions for parallelism detection, asymptotic notations, parallel computer classifications, permutation networks, systolic arrays, hypercubes, dataflow computing applications, and performance analysis of parallel algorithms.

    Original Title

    MCSE-011

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains information about a parallel computing exam, including: 1) The exam is for the course MCSE-011: Parallel Computing and will take place in June 2009 with a maximum of 100 marks. 2) There are 5 questions, with question 7 being compulsory and students must attempt 3 other questions. 3) The questions cover topics like Bernstein conditions for parallelism detection, asymptotic notations, parallel computer classifications, permutation networks, systolic arrays, hypercubes, dataflow computing applications, and performance analysis of parallel algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    146 views4 pages

    Mcse 011

    Uploaded by

    e_reader
    This document contains information about a parallel computing exam, including: 1) The exam is for the course MCSE-011: Parallel Computing and will take place in June 2009 with a maximum of 100 marks. 2) There are 5 questions, with question 7 being compulsory and students must attempt 3 other questions. 3) The questions cover topics like Bernstein conditions for parallelism detection, asymptotic notations, parallel computer classifications, permutation networks, systolic arrays, hypercubes, dataflow computing applications, and performance analysis of parallel algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    MCA (Revised)

    r-c)
    v Term-EndExamination
    tc)
    O june, 2009
    O
    MCSE-011 : PARAttEt COMPUTING

    Time: 3 hours MaximumMarks: 1-00

    Note : Questionnumbier7 is compulsory. Attempt any three


    questionsfrom the rest.

    1. (u) Explain Bernstein conditions for detection


    of parallelism.

    (b) What are the Asymptotic Notations.


    Explain with the example,

    (c) Write the Handler's classificationof parallel


    computer.

    (d) Explain permutation network with


    properties

    (e) Explain the following interconnection


    networks.

    (t) Systolic Array

    (ii) Hyper cube

    MCSE-011 P.T.O.
    2. (u) Explain basic concepts of dataflow 10
    computing and describe various
    applications of parallel computing.
    (b) Describe the metrics involved for analysing 10
    the performance of parallel algorithm for
    parallel computers, also explain the various
    factor causing parallel system overhead.

    3. (u) With the help of a diagram illustrate the L0


    concept of sorting using comprators for the
    unsorted list having the elementsvalues as
    [3, 5, g, g, 10, 12, 1.4,20, 95, 90, 60, 35, 23,
    18,01
    (b) Explain the pipeline processingand describe 10
    pipeline processingarchitecture.

    4. (u) A three stagenetwork is set so that. 10

    7 2 3 4 5 6 ? )
    P(s1)=[; s 3 7 0 4
    5 1)

    7 2 3 4 s 6 7 )
    P(s2)=[l
    7 0 2 4 6 5 3)

    (0 1, 2 3 4 5 6 7)
    P(s3)=[.z
    s s 6 4 z o t)
    What permutation realised by network.

    MCSE-011
    (b) Write short note on the following : 10

    (0 Spin Lock Mechanism f or


    synchoronisation.

    (ii) Synchronous and Asynchronous


    messagepassing

    J. (u) DiscussHandler's classificationbased on L0


    three distinct levels of computer.

    (b) Explain three work sharing constructsof L0


    open Mp.

    -oOo-

    MCSE-011

    You might also like