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

Mathematical theorems, Proving ( or disproving) mathematical theorems are ...

Proving ( or disproving) mathematical theorems are an intensive intellectual task. This is because it requires deductions from hypotheses and also involves judgment. This judgm

Explain program level of parallel processing, Program Level This is nor...

Program Level This is normally the liability of OS (operating system) that runs processes simultaneously. Different programs are generally independent of each other. So paralle

Explain b2c -business to consumer, B2C -Business to Consumer  This is w...

B2C -Business to Consumer  This is where the consumer admittance the system of the supplier. It is still a two-way function but is usually complete solely by the Internet.

First-order logic - artificial intelligence, First-Order Logic : There'...

First-Order Logic : There's Reasoning, and then There's Reasoning As humans, we have always prided ourselves on our capability to think things by: to reason things out and c

What is low-level formatting, What is low-level formatting?  Before a d...

What is low-level formatting?  Before a disk can store data, it must be divided into sectors that the disk controller can read and write. This process is known as low-level for

Padovan string , A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

Why network layer is used, Network Layer is used for (A)  Breaking up ...

Network Layer is used for (A)  Breaking up the data in frames for transmission (B)  Deal with Error correction (C)  Automatic Recovery of Procedure (D)  Physica

Explain digital signatures, Digital Signatures. A digital signature is ...

Digital Signatures. A digital signature is an electronic rather than a written signature that can be used by someone to validate the uniqueness of the sender of a message or of

Explain virtual memory, In a memory hierarchy system, data and programs are...

In a memory hierarchy system, data and programs are first stored in secondary or auxiliary memory. Program and its related data are brought in main memory for execution. What if th

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

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