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

Define realization of one flip flop using other flip flops, Define Realizat...

Define Realization of one flip flop using other flip flops? It is probable to implement a flip flop circuit using any other circuit. Universal block diagram is shown below.

Explain about the links and association, Links and Association Links a...

Links and Association Links and associations are the basic means used for establishing relationships among objects and classes of the system. In the next subsection we will di

Two ways for restricting the value range for a domain, What are the two way...

What are the two ways for restricting the value range for a domain? By specifying fixed values. By stipulating a value table.

Illustrate the following list of consideration of Laptop, Illustrate the fo...

Illustrate the following list of consideration of laptop computers The following is a list for consideration: -  The processor must consume as little power as possible thus

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

Data, Data, information and knowledge - Information System The nature ...

Data, information and knowledge - Information System The nature of information can most easily be defined in the context of its relationship to data and knowledge. Bohn (1994)

Explain session_start subroutines, Can you give an example of what might be...

Can you give an example of what might be best suited to place in the application_Start and Session_Start subroutines? Application Start - We can place code to initialize var

Explain the concept of process, The Concept of Process Unofficially a p...

The Concept of Process Unofficially a process is a program in execution subsequent to the program has been loaded in the main memory. Though a process is more than just a progr

Terms in propositional model, Terms in Propositional model: There in f...

Terms in Propositional model: There in first-order logic allows us to talking about properties of objects that the first job for our model (Δ, Θ) is to assign a meaning to the

Name the four steps in pipelining, Name the four steps in pipelining. F...

Name the four steps in pipelining. Fetch  : Read the instruction from the memory. Decode : Decode the instruction and get the source operand. Execute : Perform the operat

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