Skip to content

Parallel queue merging #39

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
AntoineBut wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Parallel queue merging #39

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 18 additions & 20 deletions src/traversals/BFS/bfs_par.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -122,6 +122,15 @@ function bfs_par_local!(
return nothing
end

function merge_queues!(
q::Queue{T}, to_visit::Vector{T}, start::Int, len::Int
) where {T<:Integer}
last = len + start
splice!(to_visit, start:(last - 1), collect(q))
empty!(q)
return nothing
end

granularity = length(queues)
#to_visit = zeros(T, nv(graph))
to_visit[1] = source
Expand All @@ -138,28 +147,17 @@ function bfs_par_local!(
else
local_exploration!(Vector[view(to_visit, 1:last_elem)][1], queues[1])
end

last_elem = 0
fill!(to_visit, zero(T))
for i in 1:granularity
q = queues[i]
last = length(q) + last_elem
#println("splicing : ", length(q), " from ", last_elem, " to ", last)
splice!(to_visit, (last_elem + 1):last, collect(q))
last_elem = last
empty!(q)

#l = length(q)
#for j in (last_elem + 1):(last_elem + l)
# to_visit[j] = dequeue!(q)
#end
#last_elem += l

#while !isempty(q)
# last_elem += 1
# to_visit[last_elem] = dequeue!(q)
#end
acc = 1
@sync for i in 1:granularity
start_index = acc
l = length(queues[i])
if l != 0
@spawn merge_queues!(queues[i], to_visit, start_index, l)
acc += l
end
end
last_elem = acc - 1
end
return nothing
end
Expand Down