Example on distribution of data, Computer Engineering

Assignment Help:

Q. Example on Distribution of Data?

!HPF$ PROCESSORS P1(4)

!HPF$ TEMPLATE T1(18)

!HPF$ DISTRIBUTE T1(BLOCK) ONTO P1 

Consequently of these instructions distribution of data would be as displayed in Figure below.

2008_Example on Distribution of Data.png

Figure: Block Distribution of Data

In a alternative of block distribution the number of template elements assigned to every processor may be explicitly specified as in 

!HPF$ DISTRIBUTE T1 (BLOCK (6)) ONTO P1

Distribution of data will be as displayed in Figure below.

387_Example on Distribution of Data1.png

Figure: Variation of Block Distribution

It means we assign all template elements before exhausting processors and some processors are left empty.

(b) Cyclic Distribution

Simple cyclic distribution is specified by 

!HPF$ DISTRIBUTE T1(CYCLIC) ONTO P1

The first processor gets first template element and second gets second and so on. When a set of processors is exhausted go back to first processor and carry on allocating template elements from there.


Related Discussions:- Example on distribution of data

Role of information system in business, Q. Role of information system in bu...

Q. Role of information system in business? Ans. 1. Information System is grouping of two terms namely - 1) Information 2) System 1. Information - Information is dat

What is the difference between dpi and ppi, Question : (a) "Resolution ...

Question : (a) "Resolution refers to the sharpness and clarity of an image" (i) Explain what you understand by the above statement. (ii) What is the difference between D

Explain the input stage of an ADC, Explain the Input Stage of an ADC. ...

Explain the Input Stage of an ADC. Ans. Input Stage- In ADC at the input stage, analog voltage can contain any value in a range although the digital output can contain

What is the working set of a process, What is the working set of a process?...

What is the working set of a process? The set of pages that are referred by the method in the last "n", references, where "n" is called the window of the working set of the pro

Explain busy waiting semaphores, Explain busy waiting semaphores. Weak,...

Explain busy waiting semaphores. Weak, Busy-wait Semaphores: The simplest method to implement semaphores. Useful while critical sections last for a short time, or we

Objectives-parallel computer architecture , Objectives After going thro...

Objectives After going through this part, you will be capable to: Examine the meaning of Pipeline processing and explain pipeline processing architectures; Classify

Write an assembly function which hides the cursor, Q. Write an assembly fun...

Q. Write an assembly function which hides the cursor? Write an assembly function which hides the cursor. Call it from a C program.             . PUBLIC CUROFF

Illustrate about the single inheritance, Illustrate about the single inheri...

Illustrate about the single inheritance During inheritance, superclass feature may by override by a subclass defining that feature with the same name. The overriding features (

Depth-first search is different from breadth-first search, Depth-first sear...

Depth-first search is different from Breadth-first search in the following ways: A depth search traversal method goes to the deepest level of the tree first and then works up w

How many flip-flops are required to construct mod 30 counter, How many flip...

How many flip-flops are required to construct mod 30 counter ? Ans. Mod - 30 counter +/- requires 5 Flip-Flop as 30 5 . Mod - N counter counts overall ' N ' number of state

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd