Scribd
Upload
16 views

Assignment-2: Submission Date: On or Before 7 Oct 2014

This document outlines questions for two assignments. For assignment 1, it asks about Gray code values, differences between task dependency and interaction graphs, variable states after instructions, superscalar execution, and mapping congestion. It also asks to show the e-cube routing path between nodes 1 and 6 in 3D hypercube and explain blocking in Omega networks. For assignment 2, it asks about cache coherence in multiprocessors, parallel algorithm models, owner compute rules for data partitioning, when intermediate data decomposition is used, and defining granularity. It further asks to explain mesh embedding into hypercubes, routing techniques in parallel computers, parallel random access machines and concurrent write protocols.

Uploaded by

why121111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Assignment-2: Submission Date: On or Before 7 Oct 2014

This document outlines questions for two assignments. For assignment 1, it asks about Gray code values, differences between task dependency and interaction graphs, variable states after instructions, superscalar execution, and mapping congestion. It also asks to show the e-cube routing path between nodes 1 and 6 in 3D hypercube and explain blocking in Omega networks. For assignment 2, it asks about cache coherence in multiprocessors, parallel algorithm models, owner compute rules for data partitioning, when intermediate data decomposition is used, and defining granularity. It further asks to explain mesh embedding into hypercubes, routing techniques in parallel computers, parallel random access machines and concurrent write protocols.

Uploaded by

why121111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment-2

Given Date: 26 Sep 2014


Submission Date: on or before 7 Oct 2014
Q-1 (a) Answer Following questions.
1.If G is Binary reflected Gray code than What will be the value of G(3,3)?

2. Difference between Task Dependency Graph and Task Interaction Graph?

3. What will be the state of variable y at P1 after following instructions are
executed? (Implemented using Invalidate protocol.)
P0: read y
P1: read y
P0: x=x+2
P1: y=y+1


4.What is superscaler Execution?

5. What will be congestion if we map G into H. Mapping of G's node in H's node is
1 to 1 , 2 to 2 , 3 to 3, 4 to 4, 5 to 5.




(b) 1. Using Ecube Routing Show path between node 1 and node 6 in 3D Hypercube.

2. Explain Blocking in Omega Network?

Q-2 (a) Answer Following Questions.
1. What is Cache Coherence in Multi Processor System?

2. Define Parallel Algorithm Model.

3.Define Owner Compute Rule when we partition Input Data.

4. When Intermediate Data Decomposition Technique is used?

5. Define Granularity.

(b) 1. Explain Mapping Techniques for Embedding a Mesh into Hypercube.
2. List and Explain Routing Techniques used in Parallel Computers.
3. What is Parallel Random Access Machine? Classify and Explain it. And Explain Protocols to resolve
Concurrent Write.

You might also like