Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
OpenMP is a compiler directive based standard developed in the late 1990s jointly by a group of main computer hardware and software vendors. It is portable across a lot of popular platforms including Unix and Windows NT platforms. The OpenMP Fortran API was released on October 28, 1997 and the C/C++ API was released in late 1998. We shall talk about only about C/C++ API.
The OpenMP API uses the fork-join model of parallel implementation. As soon as an OpenMP program starts implementing it creates a single thread of implementation, known as the initial thread. The initial thread implements sequentially. As early as it gets a parallel construct, the thread makes additional threads and works as the master thread for all threads. All of the new threads implement the code inside the parallel construct. Only the master thread continues implementation of the user code beyond the end of the parallel construct. There is no restriction on the number of parallel constructs in a one program. When a thread with its child threads encounters a work-sharing construct, the work inside the construct is separated between the members of the team and implemented co-operatively instead of being implemented by every thread. Implementation of the code by every thread in the team resumes after the end of the work-sharing construct. Library routines and the Synchronization constructs are available in OpenMP to co-ordinate threads and data in parallel and work-sharing constructs.
Each OpenMP directive begins with #pragma omp. The general syntax is
#pragma omp directive-name [Set of clauses]
where omp is an OpenMP keyword. There may be additional clauses (parameters) after the directive name for dissimilar options.
Now, we shall talk about some compiler directives in OpenMP.
Illustrate the Bellman-Ford algorithm The Bellman-Ford algorithm uses only on information from its neighbours and knowledge of its link costs, to update it costs and paths. Dij
Q. Calculate Utilization percentage of the link? - System: Stop and wait ARQ - Bandwidth: 1Mbps - Round trip for one bit: 20ms - Frame length: 1000 bits Utilizatio
Q. Show the Flow characteristics? Flow characteristics Reliability - if lacking means that packets or ACKs are lost - more important with FTP, SMTP than with audio
Explain in brief about the Throughput The medium access control protocol should make as well-organized use as possible of the wireless medium to maximize capacity. Number of
Advantages of Bridges By forwarding frames only to the segment where host resides a bridge server the following purpose. a.Unwanted traffic as well as network c
What must be true for two Routers running IGRP to communicate their routes? Ans) Similar autonomous system number
What is Stateful Multi-Layer Inspection (SMLI) They are considered as the third generation of firewall technology and usually combine the facilities of the above two. They are
Transmission Control Protocol (TCP) TCP makes the Internet reliable. TCP solves several problems which can occur in a packet switching system. TCP provide the given facilities:
The FORALL Statement The FORALL statement allows for more common assignments to sections of an array. A FORALL statement has the general form. FORALL ( triplet
As discussed in the earlier section each computer linked to the Internet has a unique address. Let's assume your IP address is 1.2.3.4 & you wish to send a message to the computer
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd