Illustrate high performance fortran, Computer Engineering

Assignment Help:

In 1993 High Performance FORTRAN Forum which is a group of academicians and many leading software and hardware vendors in field of parallel processing established an informal language standard known as High Performance FORTRAN (HPF). It was based on Fortran 90 then it extended set of parallel features as well as provided extensive support for computation on distributed memory parallel computers. The standard was supported by a mainstream of vendors of parallel hardware.

HPF is a extremely appropriate language for data parallel programming models on SIMD and MIMD architecture. It permits programmers to add some compiler directives which minimize inter-process communication overhead as well as exploit load-balancing techniques.

We will not consider the complete HPF here rather we will concentrate just on augmenting features such as: 

  • Intrinsic Functions
  • Data Distribution
  • FORALL Statement
  • Data Alignment
  • INDEPENDENT loops
  • Processor Arrangements

 


Related Discussions:- Illustrate high performance fortran

What are the end-to-end layers of osi structure, What are the end-to-end la...

What are the end-to-end layers of OSI structure The layers 4-7 of ISO-OSI reference model communicate with peer entities in end systems. There is not any communication with ent

Cut-off search - artificial intelligence, Cut-off Search: By using  a m...

Cut-off Search: By using  a minimax search, all we have to do is program, in a game playing situation our agent to look at the whole  search tree from the current state of the

What is meant by maskable interrupts, A interrupt that can be turned off by...

A interrupt that can be turned off by the programmer is called as Maskable interrupt.

Inherent addressing, Inherent addressing   Here the address is already b...

Inherent addressing   Here the address is already built in to the instruction i.e. inherent to the code     ABA  ; Add A to B and store the answer in A  Simple programs using

Recurrence relation, Take the following recurrence relation consider only f...

Take the following recurrence relation consider only for n = 2k for integers k ≥ 1: T(2) = 9, and for n ≥ 4, T(n) = n + T(n /2). Three students were working together in a stu

Explain services of application layer., Explain services of Application Lay...

Explain services of Application Layer. Application Layer: As the highest layer within the OSI reference model, the application layer gives services to the users of OSI env

Define class p, Define class P  The class of all sets L that can be kno...

Define class P  The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.

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