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

How are control signals achieve the particular operation, Q. How are contro...

Q. How are control signals achieve the particular operation? The control signals are applied directly as binary inputs to the logic gates of the logic circuits. All these input

Explain about the prepurchase interaction activity, Explain about the Prepu...

Explain about the Prepurchase Interaction activity. Prepurchase Interaction: This interaction for consumers comprises three activities: • Product or service search and di

Estimate the size of the state space, 1. The missionaries and cannibals pro...

1. The missionaries and cannibals problem. Three missionaries and three cannibals are on the left river bank, with a boat that can hold one or two people. If on either side of the

Scanning tips, Don't scan at more resolution than needed. This saves both D...

Don't scan at more resolution than needed. This saves both Disk and time Space. Typically itisn't useful to scan at more than optical resolution because it adds no new informa

When should we stop testing, When should you stop testing? It is quite ...

When should you stop testing? It is quite complex to determine as many modern software applications are so complex and run in like an interdependent environment that complete t

Illustrate simple ALU organisation, Q. Illustrate Simple ALU Organisation? ...

Q. Illustrate Simple ALU Organisation? An ALU comprises circuits which perform data processing micro-operations. Though how are these ALU circuits used in conjunction of other

Explain typical packet switching network configuration, Explain typical pac...

Explain typical packet switching network configuration. Packet Switching: In packet switching the nodes handle greatly smaller data length than are determined in message swit

Explain readers-writers problem, Explain Readers-writers problem. Read...

Explain Readers-writers problem. Readers-writers problem: Assume that a data object (as a file or record) is to be shared between several concurrent processes. The readers ar

Binary search, Binary Search Now that the basic framework is working, ...

Binary Search Now that the basic framework is working, it is time to begin implementing a few alternative search functions. Each of these search algorithms have strengths and

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