Distributed Systems (19CSE312)

Term Project: Group 32

Project Title: Parallelized Breadth First Search
M. Sri Charan - BL.EN.U4CSE19078
M. Girish Reddy - BL.EN.U4CSE19080
M. Ratan Reddy - BL.EN.U4CSE19084

Department of Computer Science & Engineering,

Amrita School of Engineering, Bengaluru

1
Agenda
• Project Motivation
• Problem statement
• Algorithms Explanation
• Future Scope and References
• Demo

2
Project Motivation

3
Project Motivation

4
Sequential BFS
def bfs(adj, n):
    res = np.empty(n, dtype=int)
    q = queue.Queue()
    q.put(0)
    visited = np.array([False for i in range(n)])
    visited[0] = True
    ind = 0
    while not q.empty():
        u = q.get()
        res[ind] = u
        ind += 1
        for i in range(n):
            if adj[u][i] > 0 and visited[i] == False:
                q.put(i)
                visited[i] = True
    return res

5
Parallel BFS

6
Parallel BFS

7
Parallel BFS

8
Parallel BFS

9
Parallel BFS

10
Parallel BFS

11
Parallel BFS

12
Future Scope and References
• Integration with Connect application.
• Using parallelized BFS instead of sequential BFS.

[1] http://web.mit.edu/~neboat/www/presentations/spaa2010.pdf

13
 Thank you !!!!!

14