/usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp is in libboost1.55-dev 1.55.0+dfsg-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 | // Copyright (C) 2004-2006 The Trustees of Indiana University.
// Use, modification and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
// Authors: Douglas Gregor
// Nick Edmonds
// Andrew Lumsdaine
#include <boost/assert.hpp>
#include <boost/property_map/parallel/distributed_property_map.hpp>
#include <boost/graph/parallel/detail/untracked_pair.hpp>
#include <boost/type_traits/is_base_and_derived.hpp>
#include <boost/bind.hpp>
#include <boost/graph/parallel/simple_trigger.hpp>
#ifndef BOOST_GRAPH_USE_MPI
#error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been included"
#endif
namespace boost { namespace parallel {
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
PBGL_DISTRIB_PMAP
::distributed_property_map(const ProcessGroup& pg, const GlobalMap& global,
const StorageMap& pm, const Reduce& reduce)
: data(new data_t(pg, global, pm, reduce, Reduce::non_default_resolver))
{
typedef handle_message<Reduce> Handler;
data->ghost_cells.reset(new ghost_cells_type());
data->reset = &data_t::template do_reset<Reduce>;
data->process_group.replace_handler(Handler(data, reduce));
data->process_group.template get_receiver<Handler>()
->setup_triggers(data->process_group);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
PBGL_DISTRIB_PMAP::~distributed_property_map() { }
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP::set_reduce(const Reduce& reduce)
{
typedef handle_message<Reduce> Handler;
data->process_group.replace_handler(Handler(data, reduce));
Handler* handler = data->process_group.template get_receiver<Handler>();
BOOST_ASSERT(handler);
handler->setup_triggers(data->process_group);
data->get_default_value = reduce;
data->has_default_resolver = Reduce::non_default_resolver;
int model = data->model;
data->reset = &data_t::template do_reset<Reduce>;
set_consistency_model(model);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::prune_ghost_cells() const
{
if (data->max_ghost_cells == 0)
return;
while (data->ghost_cells->size() > data->max_ghost_cells) {
// Evict the last ghost cell
if (data->model & cm_flush) {
// We need to flush values when we evict them.
boost::parallel::detail::untracked_pair<key_type, value_type> const& victim
= data->ghost_cells->back();
send(data->process_group, get(data->global, victim.first).first,
property_map_put, victim);
}
// Actually remove the ghost cell
data->ghost_cells->pop_back();
}
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
typename PBGL_DISTRIB_PMAP::value_type&
PBGL_DISTRIB_PMAP::cell(const key_type& key, bool request_if_missing) const
{
// Index by key
ghost_cells_key_index_type const& key_index
= data->ghost_cells->template get<1>();
// Search for the ghost cell by key, and project back to the sequence
iterator ghost_cell
= data->ghost_cells->template project<0>(key_index.find(key));
if (ghost_cell == data->ghost_cells->end()) {
value_type value;
if (data->has_default_resolver)
// Since we have a default resolver, use it to create a default
// value for this ghost cell.
value = data->get_default_value(key);
else if (request_if_missing)
// Request the actual value of this key from its owner
send_oob_with_reply(data->process_group, get(data->global, key).first,
property_map_get, key, value);
else
value = value_type();
// Create a ghost cell containing the new value
ghost_cell
= data->ghost_cells->push_front(std::make_pair(key, value)).first;
// If we need to, prune the ghost cells
if (data->max_ghost_cells > 0)
prune_ghost_cells();
} else if (data->max_ghost_cells > 0)
// Put this cell at the beginning of the MRU list
data->ghost_cells->relocate(data->ghost_cells->begin(), ghost_cell);
return const_cast<value_type&>(ghost_cell->second);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP
::handle_message<Reduce>::operator()(process_id_type source, int tag)
{
BOOST_ASSERT(false);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP::handle_message<Reduce>::
handle_put(int /*source*/, int /*tag*/,
const boost::parallel::detail::untracked_pair<key_type, value_type>& req, trigger_receive_context)
{
using boost::get;
shared_ptr<data_t> data(data_ptr);
owner_local_pair p = get(data->global, req.first);
BOOST_ASSERT(p.first == process_id(data->process_group));
detail::maybe_put(data->storage, p.second,
reduce(req.first,
get(data->storage, p.second),
req.second));
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
typename PBGL_DISTRIB_PMAP::value_type
PBGL_DISTRIB_PMAP::handle_message<Reduce>::
handle_get(int source, int /*tag*/, const key_type& key,
trigger_receive_context)
{
using boost::get;
shared_ptr<data_t> data(data_ptr);
BOOST_ASSERT(data);
owner_local_pair p = get(data->global, key);
return get(data->storage, p.second);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP::handle_message<Reduce>::
handle_multiget(int source, int tag, const std::vector<key_type>& keys,
trigger_receive_context)
{
shared_ptr<data_t> data(data_ptr);
BOOST_ASSERT(data);
typedef boost::parallel::detail::untracked_pair<key_type, value_type> key_value;
std::vector<key_value> results;
std::size_t n = keys.size();
results.reserve(n);
using boost::get;
for (std::size_t i = 0; i < n; ++i) {
local_key_type local_key = get(data->global, keys[i]).second;
results.push_back(key_value(keys[i], get(data->storage, local_key)));
}
send(data->process_group, source, property_map_multiget_reply, results);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP::handle_message<Reduce>::
handle_multiget_reply
(int source, int tag,
const std::vector<boost::parallel::detail::untracked_pair<key_type, value_type> >& msg,
trigger_receive_context)
{
shared_ptr<data_t> data(data_ptr);
BOOST_ASSERT(data);
// Index by key
ghost_cells_key_index_type const& key_index
= data->ghost_cells->template get<1>();
std::size_t n = msg.size();
for (std::size_t i = 0; i < n; ++i) {
// Search for the ghost cell by key, and project back to the sequence
iterator position
= data->ghost_cells->template project<0>(key_index.find(msg[i].first));
if (position != data->ghost_cells->end())
const_cast<value_type&>(position->second) = msg[i].second;
}
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP::handle_message<Reduce>::
handle_multiput
(int source, int tag,
const std::vector<unsafe_pair<local_key_type, value_type> >& values,
trigger_receive_context)
{
using boost::get;
shared_ptr<data_t> data(data_ptr);
BOOST_ASSERT(data);
std::size_t n = values.size();
for (std::size_t i = 0; i < n; ++i) {
local_key_type local_key = values[i].first;
value_type local_value = get(data->storage, local_key);
detail::maybe_put(data->storage, values[i].first,
reduce(values[i].first,
local_value,
values[i].second));
}
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Reduce>
void
PBGL_DISTRIB_PMAP::handle_message<Reduce>::
setup_triggers(process_group_type& pg)
{
using boost::graph::parallel::simple_trigger;
simple_trigger(pg, property_map_put, this, &handle_message::handle_put);
simple_trigger(pg, property_map_get, this, &handle_message::handle_get);
simple_trigger(pg, property_map_multiget, this,
&handle_message::handle_multiget);
simple_trigger(pg, property_map_multiget_reply, this,
&handle_message::handle_multiget_reply);
simple_trigger(pg, property_map_multiput, this,
&handle_message::handle_multiput);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void
PBGL_DISTRIB_PMAP
::on_synchronize::operator()()
{
int stage=0; // we only get called at the start now
shared_ptr<data_t> data(data_ptr);
BOOST_ASSERT(data);
// Determine in which stage backward consistency messages should be sent.
int backward_stage = -1;
if (data->model & cm_backward) {
if (data->model & cm_flush) backward_stage = 1;
else backward_stage = 0;
}
// Flush results in first stage
if (stage == 0 && data->model & cm_flush)
data->flush();
// Backward consistency
if (stage == backward_stage && !(data->model & (cm_clear | cm_reset)))
data->refresh_ghost_cells();
// Optionally clear results
if (data->model & cm_clear)
data->clear();
// Optionally reset results
if (data->model & cm_reset) {
if (data->reset) ((*data).*data->reset)();
}
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void
PBGL_DISTRIB_PMAP::set_consistency_model(int model)
{
data->model = model;
bool need_on_synchronize = (model != cm_forward);
// Backward consistency is a two-stage process.
if (model & cm_backward) {
// For backward consistency to work, we absolutely cannot throw
// away any ghost cells.
data->max_ghost_cells = 0;
}
// attach the on_synchronize handler.
if (need_on_synchronize)
data->process_group.replace_on_synchronize_handler(on_synchronize(data));
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void
PBGL_DISTRIB_PMAP::set_max_ghost_cells(std::size_t max_ghost_cells)
{
if ((data->model & cm_backward) && max_ghost_cells > 0)
boost::throw_exception(std::runtime_error("distributed_property_map::set_max_ghost_cells: "
"cannot limit ghost-cell usage with a backward "
"consistency model"));
if (max_ghost_cells == 1)
// It is not safe to have only 1 ghost cell; the cell() method
// will fail.
max_ghost_cells = 2;
data->max_ghost_cells = max_ghost_cells;
prune_ghost_cells();
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::clear()
{
data->clear();
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::data_t::clear()
{
ghost_cells->clear();
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::reset()
{
if (data->reset) ((*data).*data->reset)();
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::flush()
{
data->flush();
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::data_t::refresh_ghost_cells()
{
using boost::get;
std::vector<std::vector<key_type> > keys;
keys.resize(num_processes(process_group));
// Collect the set of keys for which we will request values
for (iterator i = ghost_cells->begin(); i != ghost_cells->end(); ++i)
keys[get(global, i->first).first].push_back(i->first);
// Send multiget requests to each of the other processors
typedef typename ProcessGroup::process_size_type process_size_type;
process_size_type n = num_processes(process_group);
process_id_type id = process_id(process_group);
for (process_size_type p = (id + 1) % n ; p != id ; p = (p + 1) % n) {
if (!keys[p].empty())
send(process_group, p, property_map_multiget, keys[p]);
}
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::data_t::flush()
{
using boost::get;
int n = num_processes(process_group);
std::vector<std::vector<unsafe_pair<local_key_type, value_type> > > values;
values.resize(n);
// Collect all of the flushed values
for (iterator i = ghost_cells->begin(); i != ghost_cells->end(); ++i) {
std::pair<int, local_key_type> g = get(global, i->first);
values[g.first].push_back(std::make_pair(g.second, i->second));
}
// Transmit flushed values
for (int p = 0; p < n; ++p) {
if (!values[p].empty())
send(process_group, p, property_map_multiput, values[p]);
}
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
void PBGL_DISTRIB_PMAP::do_synchronize()
{
if (data->model & cm_backward) {
synchronize(data->process_group);
return;
}
// Request refreshes of the values of our ghost cells
data->refresh_ghost_cells();
// Allows all of the multigets to get to their destinations
synchronize(data->process_group);
// Allows all of the multiget responses to get to their destinations
synchronize(data->process_group);
}
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
template<typename Resolver>
void PBGL_DISTRIB_PMAP::data_t::do_reset()
{
Resolver* resolver = get_default_value.template target<Resolver>();
BOOST_ASSERT(resolver);
for (iterator i = ghost_cells->begin(); i != ghost_cells->end(); ++i)
const_cast<value_type&>(i->second) = (*resolver)(i->first);
}
} } // end namespace boost::parallel
|