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

Explain time complexity in parallel algorithms, Q. Explain Time Complexity ...

Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

How debugger works internally, Whenever we compile with -g option, it will ...

Whenever we compile with -g option, it will make a symbol table, and according that table for every function and line it will call ptrace.

Calculate traffic offered in erlangs in a particular exchang, In a particul...

In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate Traf

Procedures relating to the deployment of the server, Edith & Associates is ...

Edith & Associates is a modern law firm. They have an Internet Link that is an ADSL 8MB links from JJNET. The server they are to deploy will the main service giving  server and wil

Mathematical applications, The current 32 and 64 bit machines can represent...

The current 32 and 64 bit machines can represent integers of around 9 digits and 30 digits respectively, while various scientific and mathematical applications have to represent in

What is applying of an open source systems, What is applying of an Open Sou...

What is applying of an Open Source Systems?   No licensing issues No initial cost Speed of Access Openness and Transparency

Explain segmentation, Explain segmentation? Segment memory addressing ...

Explain segmentation? Segment memory addressing divides memory into many segments. Each of these segments can be considered as a linear memory space. Every one of these segmen

Highly encoded micro-instructions, Highly Encoded micro-instructions ...

Highly Encoded micro-instructions Encoded bits required in micro-instructions are small. It provided an aggregated view that is a higher view of CPU as just an encoded

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

Properties of e-cash, Properties: 1.  Monetary Value: Monetary value mu...

Properties: 1.  Monetary Value: Monetary value must be backed by either cash, bank - authorized credit cards or bank certified cashier's cheque. 2.  Interoperability: E-cash

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