DFS, but parallel

1. PARALLEL DEPTH
SEARCH
Erk EKİN

2. 8-PUZZLE GAME
2 8 3
1 6 4
7 5
1 2 3
8 4
7 6 5

7. DYNAMIC LOAD BALANCING

9. Work
IDLE CPU
STACK
ACTIVE CPU
STACK

10. #1 #2 #3 #4 #5 #p

11. 100
x
#1 #2 #3 #4 #5 #p

12. 100
x
#1 #2 #3 #4 #5 #p

13. 100
x
#1 #2 #3 #4 #5 #p
Request

14. 50x50x
#1 #2 #3 #4 #5 #p
Response
HALF SPLIT

15. 45.1x49.7x
#1 #2 #3 #4 #5 #p
SEARCH OVERHEAD FACTOR
50x 50x

16. 50x50x
#1 #2 #3 #4 #5 #p
Response
DonorRecipient

17. 25x 25x 25x25x
#1 #2 #3 #4 #5 #p
70x

18. 70x
100x/p
#1 #2 #3 #4 #5 #p
100x/p 100x/p 100x/p 100x/p 100x/p

19. 70x
#1 #2 #3 #4 #5 #p

20. 65x
#1 #2 #3 #4 #5 #p
Request

21. 60x
#1 #2 #3 #4 #5 #p
Reject!

22. IMPORTANT
PARAMETERS
SPLITTINGTHE WORK
DETERMININGTHE DONOR

23. SPLITTING WORK

25. #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.

26. DETERMINETHE
DONOR
ASYNCHRONOUS ROUND ROBIN (ARR)
GLOBAL ROUND ROBIN (GRR)
RANDOM POLLING (RP)

27. THANKS
@erkekin
2015
Reference
Introduction to Parallel Computing, Grana A. et al.