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

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

Explain vector-vector instructions, Vector-Vector Instructions In this...

Vector-Vector Instructions In this category, vector operands are fetched from vector register and accumulated in another vector register. These instructions are indicated with

Define bcd, Define BCD. A binary code that distinguishes between 10 ele...

Define BCD. A binary code that distinguishes between 10 elements must contain at least 4 bits, but 6 combinations will remain unassigned. Numerous dissimilar codes can be obtai

What are links and associations, What are links and associations? Link ...

What are links and associations? Link is a physical or conceptual connection between objects. A link is an instance of an association.  Association is a explanation of group

Shm, composition of two shm in right angles to each other to havingg time p...

composition of two shm in right angles to each other to havingg time period in the ratio 1:2

Different types of addressing modes, Described different types of addressin...

Described different types of addressing modes available? Ans: The various types of addressing modes available are following:   Register addressing mode   Immediate ad

Show the importance of risc processors, Q. Show the Importance of RISC Proc...

Q. Show the Importance of RISC Processors? Reduced Instruction Set Computers recognize a comparatively limited number of instructions. One benefit of a reduced instruction set

Example of unification, Example of Unification: Let now here, assume i...

Example of Unification: Let now here, assume instead that we had these two sentences as:  knows(john,X) → hates(john, X)  knows(jack, mary)  Thus here the predicate n

A graph ''g'' with ''n'' nodes is bipartite, A graph 'G' with 'n' nodes is ...

A graph 'G' with 'n' nodes is bipartite if it have  no cycle of odd length.

What is ram bus technology, What is RAM Bus technology? The key feature...

What is RAM Bus technology? The key feature of RAM bus technology is a fast signalling method used to transfer information among chips. Instead of using signals that have volta

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