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.