Basic concept of data parallelism, Computer Engineering

Assignment Help:

Basic Concept of Data Parallelism

Thinking the condition where the same problem of submission of „electricity bill? is Handled as follows:

Again, three are counters. However, now each counter handles all the actions of a resident in value of submission of his/her bill. Again, we considering that time compulsory to submit

One bill form is the same as previous, i.e., 5+300+5=310 sec.

We suppose all the counters operate concurrently and each peoples at a counter takes 310 seconds to development one bill. Then, time taken to development all the 10,000 bills will be 310*(9999/3)+310*1sec

This time is relatively much less as compared to time taken in the previous situations, viz.. 3000000 sec and 3100000 sec respectively.

The condition discussed here is the idea of data parallelism. In data parallelism, the entire set of data is manipulated into many blocks and operations on the blocks are applied comparable. As is obvious from this example, data parallelism is much faster as compared to previous situations. Here, no synchronisation is necessary between processers (or counters). It is more liberal of faults. The working of one person didn't affect the other person. There is no message required between processors. Thus, interprocessor message is less. Data parallelism has certain drawbacks. These are as given:

i)The action to be performed by every processor is predefined i.e., load of assignment is static.

ii) It should be probable to split the input task into mutually exclusive tasks. In the given instance, space would be crucial counters. This requires multiple hardware which may be expensive.

The opinion of speedup achieved by using the on top of type of parallel processing is as given:

We assume the number of jobs = m

Let assume the time to do a job = p

If each job is separated into k tasks,

Assuming task is ideally separable into activities, as mentioned over then, Time taken  to complete one task = p/k

Time taken to finish n jobs without parallel processing = n.p

Time to finish  n jobs with parallel processing = n*p/k

                                   1957_Basic Concept of Data Parallelism.png


Related Discussions:- Basic concept of data parallelism

Explain active matrix or thin film transistor technology, Q. Explain Active...

Q. Explain Active Matrix or Thin Film Transistor technology? This is known as TFT (Thin Film Transistor) technology. In this there is a transistor at every pixel acting as a r

Illustrate an object model for university system, An object model for unive...

An object model for university system Establishing relationship among various classes in the system is the primary activity. Here, we have a simple model of a University System

How the canvas class and the graphics class are linked, A Canvas object giv...

A Canvas object gives access to a Graphics object by its paint() method.

Process of minimax algorithm, Process of Minimax algorithm: Our aim is...

Process of Minimax algorithm: Our aim is just to write the best of best score on the top branches of the tree that player one can guarantee to score if he chooses that move.

Classification of interrupts - computer architecture, Classification of int...

Classification of interrupts:   1. a) asynchronous   external components or hardware malfunction 1.b)synchronous   function of program state (for example over

Differentiate the latch and flip-flop, Differentiate the latch and flip-flo...

Differentiate the latch and flip-flop? The major difference between latch and FF is which latches is level sensitive whereas FF is edge sensitive. They both need the use of clo

The new optimal solution, Electrocomp's management realizes that it forgot ...

Electrocomp's management realizes that it forgot to contain two critical constraints. In particular, management decides that to make sure an adequate supply of air conditioners for

Types of messages, Q. Types of messages? The messages can be of many ty...

Q. Types of messages? The messages can be of many types.  A specific field of all messages may be reserved to signify message type.  The message passing primitives are like thi

Define the three prime processes of UML, Define the three prime processes o...

Define the three prime processes of uml The three prime processes were OMT (Rumbaugh), OOSE (Jacobson) and Booch. OMT was strong in analysis, while Booch was strong in design a

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