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

State in brief about polymorphism, State in brief about Polymorphism C...

State in brief about Polymorphism Class hierarchy is the deciding feature in the case of more than one implementation of properties. An object oriented program to compute the

Explain resource dependence, Resource Dependence The parallelism betwee...

Resource Dependence The parallelism between instructions can also be affected because of the shared resources. If two instructions are occupying the same shared resource then i

Explain cpu based exchange, Explain CPU based exchange. CPU Based Exch...

Explain CPU based exchange. CPU Based Exchange: All the control equipment is replaced with a single processor that must be quite powerful, in centralized control. This should

Which term is associated with snmp, Which term is associated with SNMP? ...

Which term is associated with SNMP? MIB is related with SNMP.

Explain the working of master-slave JK flip flop, With relevant diagram exp...

With relevant diagram explain the working of master-slave JK flip flop. Ans. Master-Slave J-K FLIP-FLOP: A cascade of two S-R FLIP-FLOPS is a master-slave J-K FLIP-FLOP. One

Define buffering, Define buffering.  A buffer is a memory area that kee...

Define buffering.  A buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application. Buffering is done for three reas

Computer Fundamentals, state and explain the advantages of having densely ...

state and explain the advantages of having densely packed integrated Circuits in the computer

Quantifiers and variables - propositional model, Quantifiers and Variables ...

Quantifiers and Variables - propositional model: There is one question is arrives that 'What do sentences containing variables mean?' In other way of words, how does a first-o

Constants - first-order logic, Constants - first-order logic: Constant...

Constants - first-order logic: Constants are things that is cannot be changed, like as england, black and barbara. So then they stand for one thing only, so that can be confu

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