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

Grounding a variable - first-order logic, Grounding a variable - first-orde...

Grounding a variable - first-order logic: The perform of making ourselves clear about a variable by introducing an exists or a forall sign is called quantifying the variable.

Bell lapadula model, A computer system provides protection using the Bell-L...

A computer system provides protection using the Bell-LaPadula policy. How would a virus spread if A) the virus were placed on the system at system low (the compartment that all o

Explain non-uniform memory access model (numa), Non-Uniform Memory Access M...

Non-Uniform Memory Access Model (NUMA) In shared memory multiprocessor systems, local memories are able to be connected with every processor. The collection of all local

Explain working neural network work, Q. Explain working neural network work...

Q. Explain working neural network work? ANSWER: A neural network has an input layer with the factors under consideration, a middle or hidden layer that assigns and adjusts weig

Case x and z difference which is preferable and why, Case x, z difference, ...

Case x, z difference, which is preferable, why? CASEZ : Special version of case statement that uses a Z logic value to signify don't-care bits. CASEX : Special

State the drawbacks of laptop as compared to PC, State the drawbacks of lap...

State the drawbacks of laptop compared to PC The main disadvantages of laptops compared to desk top PCs are: -  They tend to be more expensive to purchase -  It's easie

Logical database reads the data from the database, Is it true that the Logi...

Is it true that the Logical Database reads the data from the database tables using Select Statements. Yes. We are coding that in Database part of LDB.

Displacement addressing mode - computer architecture, Displacement and  Sta...

Displacement and  Stack Addressing  mode - computer architecture: Displacement Addressing: In displacement addressing mode there are three types of addressing mode. They

Show buffered mode for point-to-point message passing, Q. Show Buffered mod...

Q. Show Buffered mode for Point-to-point Message Passing? Buffered mode: Transmitting can be started whether or not matching receives has been started and transmitting may comp

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