PARALLEL DEPTH SEARCH

Erk EKİN

8-PUZZLE GAME2 8 31 6 47 5

1 2 38 47 6 5

DYNAMIC LOAD BALANCING

Work

IDLE CPUSTACK

ACTIVE CPUSTACK

#1 #2 #3 #4 #5 #p

100x

#1 #2 #3 #4 #5 #p

100x

#1 #2 #3 #4 #5 #p

100x

#1 #2 #3 #4 #5 #p

Request

50x50x

#1 #2 #3 #4 #5 #p

Response

HALF SPLIT

45.1x49.7x

#1 #2 #3 #4 #5 #p

SEARCH OVERHEAD FACTOR

50x 50x

50x50x

#1 #2 #3 #4 #5 #p

Response

DonorRecipient

25x 25x 25x25x

#1 #2 #3 #4 #5 #p

70x

70x

100x/p

#1 #2 #3 #4 #5 #p100x/p 100x/p 100x/p 100x/p 100x/p

70x

#1 #2 #3 #4 #5 #p

65x

#1 #2 #3 #4 #5 #p

Request

60x

#1 #2 #3 #4 #5 #p

Reject!

IMPORTANT PARAMETERS

SPLITTING THE WORKDETERMINING THE DONOR

SPLITTING WORK

#1 #2

Near the bottom of the stack (that is, close to the initial node) tend to have bigger trees rooted at them, and alternatives near the top of the stack tend to have small trees rooted at them. For more information take a look at the text book: Introduction to Parallel Computing.

DETERMINE THE DONOR

ASYNCHRONOUS ROUND ROBIN (ARR)GLOBAL ROUND ROBIN (GRR)

RANDOM POLLING (RP)

THANKS@erkekin

2015

Reference Introduction to Parallel Computing, Grana A. et al.