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

Address translation - computer architecture, Address translation: ...

Address translation: Compiler time : If it is known in advance that a program will reside at a particular location of primary memory, and then the compiler can be told to

Software engineering - layered technology, S oftware Engineering - Layered...

S oftware Engineering - Layered Technology Although various authors have developed personal definitions of software engineering, a definition given by Fritz Bauer at the semin

Explain about disk caching scheme, Q. Explain about disk caching scheme? ...

Q. Explain about disk caching scheme? The disk caching scheme can be used to speed up performance of disk drive system. A set (cache) of buffers is assigned to hold some disk b

Interface constructors, Describe a interface 'Human' with methods as walk' ...

Describe a interface 'Human' with methods as walk' and 'speak'. Describe a class 'User' implementing 'Human'. Describe a work() method in User class.Add a class 'Person' also execu

two arguments are passed, The velocity of sound in air is 49.02 feet p...

The velocity of sound in air is 49.02 feet per second where is the air temperature in degrees Rankine.  Write a function to execute this.  If just 1 argument is passed to the f

Define rom, Define ROM? It is a non-volatile memory. It includes only r...

Define ROM? It is a non-volatile memory. It includes only reading of stored data.

What do you mean by shopping bots, Q. What do you mean by shopping bots? ...

Q. What do you mean by shopping bots? ANSWER: A shopping bot or buyer agent is an intelligent agent on a Web site that assists you, the customer, search the products and servic

Control of program, Example:                         CMP    AX,BX    ;...

Example:                         CMP    AX,BX    ; compare instruction: sets flags JE        THERE    ; if equal then skip the ADD instruction  ADD  AX, 02    ; add 02

Weight training calculations, Weight Training Calculations: However we...

Weight Training Calculations: However we have more weights in our network than in perceptrons but we firstly need to introduce the notation as: w ij just to specify the weigh

And-introduction rule, And-Introduction: In generally English says tha...

And-Introduction: In generally English says that "if we know that a lot of things are true, so we know that the conjunction of all of them is true", then we can introduce conj

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