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

Advantage of a numeric mailbox identifier, Does a numeric mailbox identifie...

Does a numeric mailbox identifier have any advantage over a mnemonic identifier? Explain. Several software systems permit the system administrator to select mailbox names, wher

Explain shared memory system and tightly coupled system, Shared Memory Syst...

Shared Memory System / Tightly Coupled System Shared memory multiprocessors have the subsequent features: For real-time high-speed processing these systems are preferabl

What are the steps involved in designing, Before getting into the design th...

Before getting into the design the designer should go by the SRS prepared by the System Analyst. The main tasks of design are Architectural Design & Detailed Design. In Arch

What is ai checkers, The major programs here are Arthur Samuel's, the rote ...

The major programs here are Arthur Samuel's, the rote learning method which is a lot like a memory based method, generalization learning which is a lot like backprop and a signatur

Define the for loop, The for Loop The for loop works well where the num...

The for Loop The for loop works well where the number of iterations of the loop is known before the loop is entered. The head of the loop consists of three parts separated by s

Projects on cluster computing, Some famous projects on cluster computing ar...

Some famous projects on cluster computing are as follows: High Net Worth Project: (developed by: Bill McMillan, JISC NTI/65 - The HNW Project, University of Glasgow, The prim

Limitation of software engineering, i want to get answer about this topic w...

i want to get answer about this topic what is software engineering and what is its limitation

Execute a reduce operation over members of specified group, Q. Execute a re...

Q. Execute a reduce operation over members of specified group? int info = pvm_reduce( void (*func)(), void *data, int count, int datatype, int msgtag, char    *group, int root

C-programing, c-program for the minimum total number of shelves

c-program for the minimum total number of shelves

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