The concept of parallel execution and concurrent , Computer Engineering

Assignment Help:

The Concept of Parallel Execution and Concurrent

Real world systems are obviously concurrent, and computer science is about modelling the actual world. Examples of actual world systems which need concurrency are railway networks and machines in a manufacturing works. In the computer globe, many new operating systems maintain concurrency. While working on our PC (personal computer), we may download a audio file, listen to streaming audio, print something, have a clock running and type in a text editor. A distributed computer system or multiprocessor can better use the inherent concurrency in difficulty solutions than a uniprocessor system. Concurrency is reached either by making simultaneous processes or by creating threads inside a process. Whichever of these process is used, it requires a lot of attempt to synchronise the threads/processes to evade race conditions, starvations and deadlocks.

Study of parallel and concurrent executions is important due to following reasons:

i)          Some problems are most commonly solved by using a set of co-operating processes.

ii)         Used to reduce the execution time.

The words "parallel "and concurrent" are often used interchangeably, however they are different.

Concurrent execution is the secular behaviour of the N-client 1-server form where only one client is providing at any given instant. It has dual nature; it is chronological in a small Time scale, but instantaneous in a large time scale. In our context, a processor workings as Server and process or thread workings as client. Some examples of concurrent languages include Concurrent Pascal, Adam, concurrent PROLOG and Modula-2). Parallel execution is linked with the N-client N-server model. It allows the servicing of extra than one client at the equal time as the number of servers is extra than one. Examples of parallel languages include Parallel C, Occam-2 and strand-88.

Parallel execution did not require explicit concurrency in the language. Parallelism can be complete by the underlying hardware. Likewise, we can have concurrency in a language with no parallel execution. This is the situation when a program is executed on an only processor.

 


Related Discussions:- The concept of parallel execution and concurrent

Grapgh, representation of the adjacency matrix and adjacency list

representation of the adjacency matrix and adjacency list

Define pvm library routines, Q. Define PVM library routines? In this se...

Q. Define PVM library routines? In this segment we will give a short description of the routines in PVM 3 user library. Each PVM program must comprise the PVM header file 'pvm3

Explain naming convention constants, Explanation Constants are "variable...

Explanation Constants are "variables" that cannot be changed within a function- or script-body. The value will always be the similar during script-implementation. Syntax "AX

Illustrate the list of key differences to word processors, Illustrate the l...

Illustrate the list of key differences to word processors The following is a list of key differences to word processors: -  Most word processors force users to work on a doc

What is precloud computing, What is precloud computing? Precloud comput...

What is precloud computing? Precloud computing is an email access was through a single computer, which also keeps all email messages. Example: Microsoft Outlook or Outlook Expr

Discuss about charles babbage in brief, Discuss about Charles Babbagein bri...

Discuss about Charles Babbagein brief Mechanism  for  advancing  or  reversing  of  control  card  were  allowed  therefore enabling execution of any desired instruction. In ot

Performance analysis, In order to calculate the performance of the program,...

In order to calculate the performance of the program, the normal form of analysis of the program is to simply measure the total amount of CPU time needed to implement the various p

Logical difference among move a to b and compute b = a, What is the  logic...

What is the  logical difference among Move A TO B and COMPUTE B = A ? Ans) In case of Move A TO B it will move whatever the value of a in to b. It mean it will move nume

What is schedulers, What is schedulers?  A process migrates between the...

What is schedulers?  A process migrates between the various scheduling queues throughout its life time. The OS must select processes from these queues in some fashion. This sel

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