2-Types of Parallelism PDF

Solving Problems in
Paralle
l
Divya Gupta
NSUT Dwarka
Types of parallelism:
1. Temporal Parallelism
2. Data Parallelism
3. Mixed Parallelism
Problem
• There are 1000 scripts to be marked.
• Each script has 4 answers.
• Each answer takes 5 minutes to be

marked.
Sequential Solution
P1
P1000
P2 :
Output Pile
Input Pile
: P2
P1000 P1
Sequential Solution
Procedure for evaluation
• Step 1: Take an answer book from the pile of
scripts (input)
• Step 2: for I = 1 to 4 do step 3
• Step 3: Grade answer to Qi.
• Step 4: Add marks given for each question
• Step 5: Put the script in the pile of marked
answer books (output)
• Step 6: Repeat steps 1 to 5 until no more
scripts are left in the input
Sequential Solution
• If one teacher is evaluating these 1000

answer scripts, he/ she takes 20
minutes for each script.
• So the total time taken is 20000

minute. This is sequential solution of
the problem.
Disadvantage
Takes a lot of time.
To reduce time, we introduce parallelism

Parallel Solution
Q1 Q2 Q3 Q4
P1
P1 0
Input Pile
P1 5
:
P2
P2 P1 10
:
P2 P1 15
:
P2 P2 20
P3 Output Pile
P1000 P4 P3 25
P3
Time (minutes)
P3
Parallel Solution
Total time taken =

20 + (999*5) min.
5015 min.
¼ (sequential time)
Parallel Solution
Temporal Parallelism
or
Assembly Line Processing
or
Pipeline Processing
Most appropriate if
 The jobs to be carried out are identical
 A job can be divided into many independent
tasks
 Time taken for each task is the same
 Time taken to send the task to one worker to
another is negligible as compared to the time
taken to evaluate that task
 The number of tasks is much smaller as
compared to the number of jobs to be carried
out (1000 scripts vs 4 answers)
Let the number of jobs = n (1000)
Let the number of tasks = k (4)
Let the time taken to do a job = p (20)
Let each job be divided into k tasks and each task take equal time
to execute. Let each task be executed by different workers.
Time taken to do one task = p/k

Time taken to complete n jobs with no pipeline processing = np Time taken
to do n jobs with k workers in pipeline = p + (n-1)*p/k
Speedup due to pipeline = np

p(kn1)/k
k

k 1
1 
n
If n » k then (k-1)/n « 1 and the speed up is
nearly equal to k.
Thus the speedup is directly proportional to

the number of workers working in the
pipeline provided the number of jobs is
very large as compared to the number of
tasks per job.
Problems
 Synchronisation: equal time should be taken in
performing each task.
 Bubbles in pipeline: If some tasks are absent in
the pipeline e.g. some questions are unanswered,
bubbles are formed i.e. the workers of those jobs will
remain idle for some time.
 Fault tolerance: The system does not tolerate faults
i.e., if one teachers gets up and goes for coffee, the
whole pipeline is affected.
 Intertask communication: The time taken to pass
answer books between the teachers should be negligible
as compared to the time taken to mark one question.
Advantage
The main advantage of this method is that

each worker in the pipeline can be fine
tuned to do one kind of job. All the workers
need not be experts in all the jobs.
Data Parallelism
P1
P251
:
:
:
:
:
:
P250
P500
P501 P751
: :
: :
: :
P P1000
7
5
0
Data Parallelism
Total time taken =

20 * 250
= 5000 min
= ¼ (sequential time)
Advantages
 There is no communication required as
each teacher works independently.
 There is no synchronization is required
between the teachers.
 Bubbles do not cause a problem because
the teacher getting bubbles will finish his/
her job faster without affecting the
others.
 It is more fault tolerant. If one teacher gets
up and goes for coffee, the others are not
affected.
Disadvantages
 The assignment of jobs to each teacher is
pre- decided. This is called static assignment.
If a teacher is fast, he/ she will finish the work
fast and then sit idle. The teacher who is slow
will slow down the whole process of result
formulation.
 The set of jobs must be partitionable into equal
number of mutually independent jobs. Each
subset should take the same time to complete.
 Each teacher must be capable of grading all the
answers.
 The time taken to divide the jobs into equal
subsets of jobs must be very small.
Combined Data and Temporal
Parallelism
P1
:
:
:
P500
P501
:
:
:
P1000
Parallelism
Total time taken =

20 + 499*5
= 2515 min
? (sequential time)
Parallelism
 It reduces time to complete the total job.

 It has advantages and disadvantages of
both data and temporal parallelism.
 Method is effective only if the number of
jobs given to each pipeline is much larger
than the number of stages in the
pipeline.
Multiple Pipeline

2-Types of Parallelism PDF

Uploaded by

Copyright:

Available Formats

2-Types of Parallelism PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2-Types of Parallelism PDF

Uploaded by

Copyright:

Available Formats

Solving Problems in

• Each script has 4 answers.

• Each answer takes 5 minutes to be

• If one teacher is evaluating these 1000

• So the total time taken is 20000

Takes a lot of time.

To reduce time, we introduce parallelism

Total time taken =

Time taken to do one task = p/k

Speedup due to pipeline = np

Thus the speedup is directly proportional to

The main advantage of this method is that

Total time taken =

Total time taken =

 It reduces time to complete the total job.

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.