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

Difference between synchronous and asynchronous updates, What is the differ...

What is the difference between Synchronous and Asynchronous updates? A program asks the system to perform a particular task, and then either waits or doesn't wait for the task

How are devices represented in unix, How are devices represented in UNIX? ...

How are devices represented in UNIX? All devices are shown by files called special files that are located in /dev directory. Therefore, device files and other files are named a

What are the input devices, What are the Input devices Various devices ...

What are the Input devices Various devices are available for data input on graphics workstations. Most systems have a keyboard and one or more additional devices specially desi

Performance of caches - computer architecture, Performance of caches: ...

Performance of caches:       Amdahl's Law regarding overall speed up:                  Alternatively, CPU stall can be considered:

Basic logic gates, Basic logic gates Introduce the basic logic gates i...

Basic logic gates Introduce the basic logic gates in terms of a) their function, b) their circuit symbol, c) their truth table and d) their equivalent in Boolean a

C program, In this problem you are given a board in which some of the eleme...

In this problem you are given a board in which some of the elements are placed as shown in diagram below. Each element represents a color. Fill the other elements in the board, suc

Determine no.of processes to avoid race condition, To avoid race condition,...

To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is The maximum number of processes is one to ignore race conditi

How can a parent and child process communicate, How can a parent and child ...

How can a parent and child process communicate? A parent and child can communicate by any of the normal inter-process communication schemes (pipes, sockets, message queues, sha

Meaning of all variable, A project having of a set of jobs and a set of pre...

A project having of a set of jobs and a set of precedences, where precedence (i; j) show that job j cannot begin before job i is completed. Let c i be the duration of job i. We wi

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

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