Explain the fork-join, Computer Engineering

Assignment Help:

Explain the fork-join?

fork-join: It is primitives in a programming language of higher level for implementing interacting processes. The syntax is as given below:

fork < label >;

join < var >;

Here < label > is a label related with several program statement, and < var > is a variable.  In a statement fork label1 causes creation of a new process which starts executing on the statement along with the label label1. Such process is concurrent with the process that executed the statement fork label-1. A join statement synchronizes the birth of a process along with the termination of one or many processes.

Fork-Join gives a functionally complete facility for control synchronization.


Related Discussions:- Explain the fork-join

What is instruction register, Q. What is Instruction Register? Instruct...

Q. What is Instruction Register? Instruction Register (IR): Here instructions are loaded before execution. Comments on figure above are as below: All representations are

What do you mean by file, Q. What do you mean by File? In computer voca...

Q. What do you mean by File? In computer vocabulary, file is a collection of text or data stored on a storage device, such as a Floppy Disk or Hard Disk. If you a fresher to c

What is parallel balance point, Q. What is Parallel Balance Point? In ...

Q. What is Parallel Balance Point? In order to execute parallel algorithm on parallel computer K processors are necessary. It should be noted that given input is allocated to

Identify specific weaknesses in the design, Identify three specific weaknes...

Identify three specific weaknesses in the design of the websites, derived from your analyses within Questions Part (c) and/or Question Part (a). There should be at least one weakne

Demorgan''s first theorem, DeMorgan's first theorem shows the equivalence o...

DeMorgan's first theorem shows the equivalence of which logic gate ? Ans. DeMorgan's first theorem depicts the equivalence of NOR gate and Bubbled AND gate. For De Morgan's

What is a binary tree, What is a binary tree? A binary tree 'T' is desc...

What is a binary tree? A binary tree 'T' is described as A finite set of elements, known as nodes, such that: either (i) or (ii) happens: (i) T is empty (known as the 'nu

History of parallel computers, History Of Parallel Computers The test ...

History Of Parallel Computers The test with and implementations of the utilize of parallelism started year back in the 1950s by the IBM.  The IBM enlarges computers also calle

Octave project, i need help with an octave program

i need help with an octave program

Explain the stack storage allocation model, Explain the stack storage alloc...

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

Basic working of network layer, Q. Basic working of Network layer? Net...

Q. Basic working of Network layer? Network layer: Network layer is responsible for routing a packet within the subnet that is, from source to destination nodes across numerou

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