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

The need of parallel computation, The Need Of Parallel Computation With...

The Need Of Parallel Computation With the advancement of computer science (CS), computational speed of the processors has also improved many a time. Moreover, there is certain

State and describe the iros subsystems, Question: (a) iRoom was constru...

Question: (a) iRoom was constructed based on the guiding principles listed below, discuss on each one of those principles with respect to why the specific principle was adopted

Structural classification-flynns classification , Structural Classification...

Structural Classification Flynn's classification examine the behavioural concept and does not receive into consideration the computer's structure. Parallel computers can be cla

What is a decoder, What is a Decoder ? Ans. Decoder: - This dec...

What is a Decoder ? Ans. Decoder: - This decodes the information. The decoders contain n inputs 7 at the end maximum 2 n outputs since n bit no can decode max 2n infor

Writing down your own interrupt service routines, Q. Writing down your own ...

Q. Writing down your own Interrupt Service Routines? Here are a few rules which should be kept in mind while writing down your own Interrupt Service Routines: 1.  Use Int 21

Perform the subtraction using 1's complement, Perform the subtraction using...

Perform the subtraction using 1's complement of 11001 - 10110 Ans. 11001 - 10110 = X - Y                            X = 11001 1's complement of Y = 01001

Why is catch almost always a bad idea, Why is catch (Exception) almost alwa...

Why is catch (Exception) almost always a bad idea?  Well, if at that point you know that an error has happened, then why not write the proper code to handle that error instead

Block-level distributed parity, Given a RAID 5 (block-level distributed par...

Given a RAID 5 (block-level distributed parity) with k disks, how well will large block trnsmitted work? How well will it handle a high I/O request rate? Evaluate the performance t

Explain opening files for reading only in c, Opening Files for Reading Only...

Opening Files for Reading Only     : A data file is a file that you can open and read its contents visually - for example, C source files, .dat files, HTML etc - anything that look

Synchronization latency problem, Synchronization Latency Problem:  If two s...

Synchronization Latency Problem:  If two simultaneous processes are performing remote loading, then it is not recognized by what time two processes will load, as the issuing proces

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