Basic concept of data parallelism, Computer Engineering

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

Posted Date: 3/1/2013 3:20:51 AM | Location : United States







Related Discussions:- Basic concept of data parallelism, Assignment Help, Ask Question on Basic concept of data parallelism, Get Answer, Expert's Help, Basic concept of data parallelism Discussions

Write discussion on Basic concept of data parallelism
Your posts are moderated
Related Questions
State the hardware faults and softwate faults - protection against hardware faults could be to keep backups or use GFS; use of UPS (in case of power loss) and parallel system a

Q. What do you mean by Prototype? A prototyping approach lay emphasis on the construction model of a system. Designing and building a scaled-down though functional version of a

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

Alpha-beta pruning: Thus we can prune via the alpha-beta method, it makes means to perform a depth-first search requiring the minimax principle. Just compared to a breadth fir

what is hashing in database management system?

Using                    each connected device is assigned a time slot whether or not the device has anything to send. (A) WDM                                        (B)  FDM

What is the necessity of an interface?  Any device that has to be linked to a CPU requires an interface. This takes care of the mismatch in speed, data and electrical character

Full form of is DHCP: Dynamic Host Control Protocol. It is mainly used to bound MAC Addresses of system. Especially for Wireless System.

Convert binary number in two's compliment form 0100 1000. Converting the binary number into 2's compliment from 0100 1000 is given below: 01001000 => 10111000

A special Slot Machine is introduced in a new casino; this machine has a digital interface of a 3X3 grid. An interface button named as SPIN for making the machine spin. There are f