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

what is a real time system, A real time system is a computer system that u...

A real time system is a computer system that updates the information at the similar rate it receives it. Real time system is of two types:- a)  Hard real time system and

What is python?, Python is an interpreter, interactive, object-oriented pro...

Python is an interpreter, interactive, object-oriented programming language. It is frequently compared to Tcl, P e r l, Scheme or Java. Python combines remarkable power with v

Describe the various signalling techniques, Describe the various signalling...

Describe the various signalling techniques. Signaling systems link the variety of transmission systems, switching systems and subscriber elements in telecommunication network

Explain resource request and allocation graph (rrag), Explain Resource requ...

Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V

Explaintask and parallel task, Task   A task is logically discrete ...

Task   A task is logically discrete section of computational work. A task is normally a program or else set of instructions which are executed by a processor. Parallel

Stack overflow causes, Stack overflow causes   (A) Hardware interrupt. ...

Stack overflow causes   (A) Hardware interrupt.  (B) External interrupt.  (C) Internal interrupt.   (D) Software interrupt. Stack overflow occurs whereas execution

Explain that datagram cannot be larger than mtu of a network, "A datagram c...

"A datagram cannot be larger than the MTU of a network over which it is sent." Is the statement true or false? Explain with the help of a suitable example. All hardware technol

Compare putchar function with the getchar function, Normal 0 fa...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

What are the ways to truncate guard bits, What are the ways to truncate gua...

What are the ways to truncate guard bits? 1. Chopping 2. Von Neumann rounding 3. Rounding procedure.

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