Describe target processor arrangements, Computer Engineering

Assignment Help:

Q. Describe target processor arrangements?

Having seen how to describe one or more target processor arrangements we need to initiate mechanisms for distributing data arrays over those arrangements. The DISTRIBUTE directive is used to distribute a data object on an abstract processor array.

The syntax of a DISTRIBUTE directive is:   

!HPF$ DISTRIBUTE  array_lists  [ONTO arrayp]

where array_list is the list of array to be distributed and arrayp is abstract processor array.

The ONTO specifier can be used to carry out a distribution across a specific processor array. If any processor array is not specified one is automatically chosen by compiler. 

HPF permits arrays to be distributed over the processors directly however it is frequently more suitable to go through intermediary of an explicit template. A template can be declared in much the similar way like processor arrangement.

!HPF$ TEMPLATE T(50, 50, 50)

Declares a 50 by 50 by 50 three-dimensional template known as T. Having declared it we are able to establish a relation amid some processor arrangement and a template by employing DISTRIBUTE directive. There are 3 ways in that a template can be distributed over Processors: Block, cyclic and *. 

(a) Block Distribution

Simple block distribution is specified by 

!HPF$ DISTRIBUTE T1(BLOCK) ONTO P1

Where T1 is a template and P1 is a processor arrangement.

In this case every processor gets a contiguous block of template elements. All processors obtain the similar sized block. The final processor can get lesser sized block.


Related Discussions:- Describe target processor arrangements

What are set up time & hold time constraints, What do they signify Which on...

What do they signify Which one is critical for calculating maximum clock frequency of a circuit? Ans) Set up time constraint implies how late the input signal can arrive befor

What is insertion sort, What is insertion sort? Insertion Sort : One o...

What is insertion sort? Insertion Sort : One of the easiest sorting algorithms is the insertion sort. Insertion sort having of n - 1 passes. For pass p = 2 by  n, insertion so

Explain block diagram for 4 bit parallel adder, What is parallel adder? Dra...

What is parallel adder? Draw and explain block diagram for 4 bit parallel adder. Ans: By using full adder circuit, any two bits can be added along with third input like a ca

What are the four factors of open source software, What are the four signif...

What are the four significant factors that led to the development of open source software? 1. To diminish the high control value of the Proprietary Software 2. To avoid disc

Sort, quick sort working

quick sort working

How can we pass selection and parameter data to a report, How can we pass s...

How can we pass selection and parameter data to a report? There are three options for passing selection and parameter data to the report. Using SUBMIT...WITH Using a rep

Period and space tradeoffs - artificial intelligence, Period and Space Trad...

Period and Space Tradeoffs - artificial intelligence: In practice, you are going to stop your agent for long term using in searching goal at some stage if it has not found a s

What are the disadvantages of linux, What are the disadvantages of Linux? ...

What are the disadvantages of Linux? Learning Lack of comparable programs More technical skill required

Lfu, advantages of lfu

advantages of lfu

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