Concept of temporal parallelism, Computer Engineering

Concept of Temporal Parallelism

In order to describe what is meant by parallelism inherent in the answer of a problem, let us talk about an example of submission of electricity bills. Assume that there are 10000 residents in a society and they are thought to submit their electricity bills in one workplace.

Let us suppose the steps to submit the bill are as pursue:

1) Go to the suitable counter to take the form to give in the bill.

2) Submit the cash with along the filled form.

3) Get the payment receipt of submitted bill.

Imagine that there is only one counter with just single office person performing all the tasks of giving application forms, accepting the forms, counting the cash, returning the cash if the need be, and giving the receipts. This circumstance is a best example of sequential execution. Let us the take estimated time taken by several of events is as follows:

In Giving request form = 5 seconds

Accepting filled request form and counting the money and persistent, if required =

5mnts, i.e., 5 ×60= 300 sec. Giving payment receipts = 5 seconds.

Total time taken in processing the process of one bill = 5+300+5 = 310 seconds.

Now, if we have 3 peoples sitting at three dissimilar counters with

i)   One person submit the bill submission form

ii) One person taking the cash and returning, if necessary

iii) One person giving the receipt.

The time necessary to complete the process of one bill will be 300 sec because the First and third activity will be related with the second activity which takes 300 sec. However, the first and last activity takes only 10 seconds each. This is a best example of a parallel processing process as here 3 peoples work in parallel.  As three peoples work in the common time, it is called temporal parallelism.  However, this is not good example of parallelism in the logic that one of the actions i.e., the second task takes 30 times of the time taken by each of the other Two tasks. The word „temporal? means here „pertaining to time?. Here, an action is broken into many sub actions, and those sub actions are executed in concurrently in the time domain.  In terms of computing application it can be supposed that parallel computing is feasible, if it is feasible, to break the problem or computation in to identical independent computation. Preferably, for parallel processing, the action should be divisible into a number of performances, each of which takes roughly same quantity of time as other tasks.

Posted Date: 3/1/2013 3:17:53 AM | Location : United States







Related Discussions:- Concept of temporal parallelism, Assignment Help, Ask Question on Concept of temporal parallelism, Get Answer, Expert's Help, Concept of temporal parallelism Discussions

Write discussion on Concept of temporal parallelism
Your posts are moderated
Related Questions
There are two types of assemblies:- 1. Private Assemblies 2. Shared Assemblies

Differentiate between logical address and physical address. A logical address is the address of the data word or instruction as used by a program (it includes the use of base

It speeds execution of distributed applications. It runs on dissimilar platforms. It time independent. No loss for msg delivery i.e. guarantee delivery.

The total time to prepare a disk drive mechanism for a block of data to be read from is its ? Ans. latency plus seek time is the total time to prepare a disk drive mechanism fo

What is Web Mail Services? Web-based email services are also called as web mail or HTTP email. Unlike traditional POP email, web mail can be accessed from any PC using any web

How does an authentication system be different from a firewall into functioning? Authentication verses firewall User Authentication and Authorization A significan

Determine the block diagram of bcd adder To add 0110 to binary sum, we use a second 4-bit binary adder. The two decimal digits, together with input-carry, are first added in to

Algorithmic Complexity theory: Moreover a similar situation occurs in broad to specific ILP systems when the inference rules are deductive thus they specialize. So at some sta

Defines a macro Defines a macro with the given name, having as its value the given replacement text. After that (for the rest of the current source file), wherever the preproce

what is cascade rollback