Hi Marcin,
Thanks for the reply.
1. Which are the files in the source tree where I can get the details of
implementation of queue,graph and the property map for serial as well as
distributed (MPI ) cases.
Is there any document that gives details of the implementation?
2. How often are the property maps on various nodes synchronized and under
what condition?
3. Is there any synchronisation with respect to the queues ? Where can I
get more details of these?
please help,
regards,
-Mahesh
From: Marcin Zalewski
To: boost-users@lists.boost.org
Date: 07/30/2015 10:03 AM
Subject: Re: [Boost-users] Details of boost parallel graph
implementation
Sent by: "Boost-users"
On Wed, Jul 29, 2015 at 4:26 AM Mayank Bakshi
wrote:
Hello,
I am working on mpi implementation of boost for breadth first search.
What is the algorithmic detail for BFS in boost.mpi? How the graph is
processed by each rank which we provide in mpirun (load distribution among
different processes)?
The sequential BGL library is overloaded on distributed graphs:
https://github.com/boostorg/graph/blob/master/include/boost/graph/breadth_fi...
Look for the mpl::true_ and mpl::bool_ to see where distributed vs.
not-distributed selection is made. graph_parallel provides some additional
overloads of the helper, but it does not define a brand new BFS:
https://github.com/boostorg/graph_parallel/blob/master/include/boost/graph/d...
The whole magic happens in the queue, graph, and property maps data
structures. The queue distributes work, and it also implements a global
"empty" check, and the property maps allow accessing remote vertices. So,
if you need MPI BFS, one is already there.
_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users
=====-----=====-----=====
Notice: The information contained in this e-mail
message and/or attachments to it may contain
confidential or privileged information. If you are
not the intended recipient, any dissemination, use,
review, distribution, printing or copying of the
information contained in this e-mail message
and/or attachments to it are strictly prohibited. If
you have received this communication in error,
please notify us by reply e-mail or telephone and
immediately and permanently delete the message
and any attachments. Thank you
