Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems PDF
Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems PDF
Available at http://www.ijcsonline.com/
Abstract
Distribution of the tasks amongst the various computing nodes is itself an intellectually challenging problem in the high
performance distributed computing systems. To choose the appropriate strategy for the required system is difficult
without the meaningful comparison of the existing task partitioning and load balancing strategies. The effectiveness of
the strategy depend on the number of factors-efficiency, interconnection topology, communication mode, program
structure, throughput and computing capabilities of the structure. A number of task partitioning and load balancing
strategies have been proposed, each of which perform remarkable results under different circumstances. The main goal
of the paper is to unravel the mystery of strategies and to classify when and where each strategy is appropriate. In this
paper, taxonomy of task partitioning and load balancing is presented in an attempt to provide a common terminology
and classification mechanism.
Keywords: Task Scheduling, Dynamic, Preemptive, Non-Preemptive, Parallel Computing etc.
I.
INTRODUCTION
II.
371 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems
III.
IV.
372 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems
V.
NON-PREEMPTIVE PARTITIONING
STRATEGIES
VI.
FUTURE WORK
VII. CONCLUSION
We have studied problems, discussed in the literature
from the last twenty years. The main intension of the paper
is to provide a suitable framework for comparing past work
in the area of distributed parallel computing systems. Ideal
performance of the strategy is depending upon the
requirement and the architecture used for the distributed
parallel processing systems. From the brief discussion of
scheduling strategies its clear that there is no ideal strategy
for all parallel computing system. The fruitful comparative
analysis of strategies provides easiest comparisons of the
existing systems. In this paper, Dynamic, preemptive and
non-preemptive task partitioning and load balancing
strategies are briefly discussed.
373 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems
TABLE 1
Comparison of Different Task Partitioning Strategies under the various architectures
S.N.
Name of Strategy
Type
of
Strategy
Static
Architecture
Remark
Ref
Homogeneous
34
Static
Homogeneous
35
EZ (Edge Zeroing)
Static
Homogeneous
33
Static
Homogeneous
31
Static
Homogeneous
32
Dynamic
Heterogeneous
14
Static and
Dynamic
Heterogeneous
26
Dynamic
Heterogeneous
27
Dynamic
Heterogeneous
29
10
Dynamic
Heterogeneous
30
11
Preemptive
17
12
Preemptive
Heterogeneous
and
Homogeneous
Homogeneous
18
13
PDS(Preemptive
Scheduling )
Deterministic
Preemptive
Heterogeneous
11
14
Preemptive
Homogeneous
12
Preemptive
Heterogeneous
19
16
Preemptive
Homogeneous
20
17
18
19
SRPT-FM Scheduling
LRPT-FM Scheduling
PTS(Preemptive Threshold Scheduling)
Preemptive
Preemptive
Preemptive
FPP(Fixed
Scheduling
Preemptive
21
21
23
20
Homogeneous
Homogeneous
Real
Time
System
Real
Time
System
21
Nonpreemptive
Heterogeneous
13
15
Preemption
Point
374 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems
22
23
24
25
EDF(Earliest
Scheduling
Deadline
First)
Nonpreemptive
Nonpreemptive
Non
preemptive,
static
Nonpreemptive
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
Homogeneous
NP-Complete
14
Homogeneous
15
Heterogeneous
graph
16
Real
Time
System
25
data
flow
375 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016