stabilize build system: depends, installer, boost/bdb fixes, cross targets groundwork
This commit is contained in:
@@ -0,0 +1,38 @@
|
||||
// Copyright 2005 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
|
||||
// Andrew Lumsdaine
|
||||
|
||||
#ifndef BOOST_PARALLEL_BASIC_REDUCE_HPP
|
||||
#define BOOST_PARALLEL_BASIC_REDUCE_HPP
|
||||
|
||||
namespace boost { namespace parallel {
|
||||
|
||||
/** Reduction operation used to reconcile differences between local
|
||||
* and remote values for a particular key in a property map. The
|
||||
* type @c T is typically the @c value_type of the property
|
||||
* map. This basic reduction returns a default-constructed @c T as
|
||||
* the default value and always resolves to the remote value.
|
||||
*/
|
||||
template<typename T>
|
||||
struct basic_reduce
|
||||
{
|
||||
BOOST_STATIC_CONSTANT(bool, non_default_resolver = false);
|
||||
|
||||
/// Returns a default-constructed T object
|
||||
template<typename Key>
|
||||
T operator()(const Key&) const { return T(); }
|
||||
|
||||
/// Returns the remote value
|
||||
template<typename Key>
|
||||
const T& operator()(const Key&, const T&, const T& remote) const
|
||||
{ return remote; }
|
||||
};
|
||||
|
||||
} } // end namespace boost::parallel
|
||||
|
||||
#endif // BOOST_PARALLEL_BASIC_REDUCE_HPP
|
||||
+92
@@ -0,0 +1,92 @@
|
||||
// Copyright 2004 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
|
||||
// Andrew Lumsdaine
|
||||
#ifndef BOOST_PARALLEL_CACHING_PROPERTY_MAP_HPP
|
||||
#define BOOST_PARALLEL_CACHING_PROPERTY_MAP_HPP
|
||||
|
||||
#include <boost/property_map/property_map.hpp>
|
||||
|
||||
namespace boost {
|
||||
|
||||
// This probably doesn't belong here
|
||||
template<typename Key, typename Value>
|
||||
inline void local_put(dummy_property_map, const Key&, const Value&) {}
|
||||
|
||||
namespace parallel {
|
||||
|
||||
/** Property map that caches values placed in it but does not
|
||||
* broadcast values to remote processors. This class template is
|
||||
* meant as an adaptor for @ref distributed_property_map that
|
||||
* suppresses communication in the event of a remote @c put operation
|
||||
* by mapping it to a local @c put operation.
|
||||
*
|
||||
* @todo Find a better name for @ref caching_property_map
|
||||
*/
|
||||
template<typename PropertyMap>
|
||||
class caching_property_map
|
||||
{
|
||||
public:
|
||||
typedef typename property_traits<PropertyMap>::key_type key_type;
|
||||
typedef typename property_traits<PropertyMap>::value_type value_type;
|
||||
typedef typename property_traits<PropertyMap>::reference reference;
|
||||
typedef typename property_traits<PropertyMap>::category category;
|
||||
|
||||
explicit caching_property_map(const PropertyMap& property_map)
|
||||
: property_map(property_map) {}
|
||||
|
||||
PropertyMap& base() { return property_map; }
|
||||
const PropertyMap& base() const { return property_map; }
|
||||
|
||||
template<typename Reduce>
|
||||
void set_reduce(const Reduce& reduce)
|
||||
{ property_map.set_reduce(reduce); }
|
||||
|
||||
void reset() { property_map.reset(); }
|
||||
|
||||
#if 0
|
||||
reference operator[](const key_type& key) const
|
||||
{
|
||||
return property_map[key];
|
||||
}
|
||||
#endif
|
||||
|
||||
private:
|
||||
PropertyMap property_map;
|
||||
};
|
||||
|
||||
template<typename PropertyMap, typename Key>
|
||||
inline typename caching_property_map<PropertyMap>::value_type
|
||||
get(const caching_property_map<PropertyMap>& pm, const Key& key)
|
||||
{ return get(pm.base(), key); }
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
local_put(const caching_property_map<PropertyMap>& pm, const Key& key,
|
||||
const Value& value)
|
||||
{ local_put(pm.base(), key, value); }
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
cache(const caching_property_map<PropertyMap>& pm, const Key& key,
|
||||
const Value& value)
|
||||
{ cache(pm.base(), key, value); }
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
put(const caching_property_map<PropertyMap>& pm, const Key& key,
|
||||
const Value& value)
|
||||
{ local_put(pm.base(), key, value); }
|
||||
|
||||
template<typename PropertyMap>
|
||||
inline caching_property_map<PropertyMap>
|
||||
make_caching_property_map(const PropertyMap& pm)
|
||||
{ return caching_property_map<PropertyMap>(pm); }
|
||||
|
||||
} } // end namespace boost::parallel
|
||||
|
||||
#endif // BOOST_PARALLEL_CACHING_PROPERTY_MAP_HPP
|
||||
+81
@@ -0,0 +1,81 @@
|
||||
// Copyright (C) 2007 Matthias Troyer
|
||||
//
|
||||
// Use, modification and distribution is subject to the Boost Software
|
||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||
//
|
||||
// This file contains helper data structures for use in transmitting
|
||||
// properties. The basic idea is to optimize away any storage for the
|
||||
// properties when no properties are specified.
|
||||
#ifndef BOOST_PARALLEL_DETAIL_UNTRACKED_PAIR_HPP
|
||||
#define BOOST_PARALLEL_DETAIL_UNTRACKED_PAIR_HPP
|
||||
|
||||
#include <boost/mpi/datatype.hpp>
|
||||
#include <utility> // for std::pair
|
||||
#include <boost/serialization/utility.hpp>
|
||||
|
||||
namespace boost { namespace parallel { namespace detail {
|
||||
|
||||
/**
|
||||
* This structure is like std::pair, with the only difference
|
||||
* that tracking in the serialization library is turned off.
|
||||
*/
|
||||
|
||||
template<typename T, typename U>
|
||||
struct untracked_pair : public std::pair<T,U>
|
||||
{
|
||||
untracked_pair() {}
|
||||
|
||||
untracked_pair(const T& t, const U& u)
|
||||
: std::pair<T,U>(t,u) {}
|
||||
|
||||
template<class T1, class U1>
|
||||
untracked_pair(std::pair<T1,U1> const& p)
|
||||
: std::pair<T,U>(p) {}
|
||||
};
|
||||
|
||||
template<typename T, typename U>
|
||||
inline untracked_pair<T, U>
|
||||
make_untracked_pair(const T& t, const U& u)
|
||||
{
|
||||
return untracked_pair<T,U>(t,u);
|
||||
}
|
||||
|
||||
} } } // end namespace boost::parallel::detail
|
||||
|
||||
namespace boost { namespace mpi {
|
||||
|
||||
template<typename T, typename U>
|
||||
struct is_mpi_datatype<boost::parallel::detail::untracked_pair<T, U> >
|
||||
: is_mpi_datatype<std::pair<T,U> > {};
|
||||
|
||||
} } // end namespace boost::mpi
|
||||
|
||||
namespace boost { namespace serialization {
|
||||
|
||||
// pair
|
||||
template<class Archive, class F, class S>
|
||||
inline void serialize(
|
||||
Archive & ar,
|
||||
boost::parallel::detail::untracked_pair<F, S> & p,
|
||||
const unsigned int /* file_version */
|
||||
){
|
||||
ar & boost::serialization::make_nvp("first", p.first);
|
||||
ar & boost::serialization::make_nvp("second", p.second);
|
||||
}
|
||||
|
||||
template<typename T, typename U>
|
||||
struct is_bitwise_serializable<
|
||||
boost::parallel::detail::untracked_pair<T, U> >
|
||||
: is_bitwise_serializable<std::pair<T, U> > {};
|
||||
|
||||
template<typename T, typename U>
|
||||
struct implementation_level<boost::parallel::detail::untracked_pair<T, U> >
|
||||
: mpl::int_<object_serializable> {} ;
|
||||
|
||||
template<typename T, typename U>
|
||||
struct tracking_level<boost::parallel::detail::untracked_pair<T, U> >
|
||||
: mpl::int_<track_never> {} ;
|
||||
|
||||
} } // end namespace boost::serialization
|
||||
|
||||
#endif // BOOST_PARALLEL_DETAIL_UNTRACKED_PAIR_HPP
|
||||
+693
@@ -0,0 +1,693 @@
|
||||
// Copyright (C) 2004-2008 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
|
||||
|
||||
// The placement of this #include probably looks very odd relative to
|
||||
// the #ifndef/#define pair below. However, this placement is
|
||||
// extremely important to allow the various property map headers to be
|
||||
// included in any order.
|
||||
#include <boost/property_map/property_map.hpp>
|
||||
|
||||
#ifndef BOOST_PARALLEL_DISTRIBUTED_PROPERTY_MAP_HPP
|
||||
#define BOOST_PARALLEL_DISTRIBUTED_PROPERTY_MAP_HPP
|
||||
|
||||
#include <boost/assert.hpp>
|
||||
#include <boost/type_traits/is_base_and_derived.hpp>
|
||||
#include <boost/shared_ptr.hpp>
|
||||
#include <boost/weak_ptr.hpp>
|
||||
#include <boost/optional.hpp>
|
||||
#include <boost/property_map/parallel/process_group.hpp>
|
||||
#include <boost/function/function1.hpp>
|
||||
#include <vector>
|
||||
#include <set>
|
||||
#include <boost/property_map/parallel/basic_reduce.hpp>
|
||||
#include <boost/property_map/parallel/detail/untracked_pair.hpp>
|
||||
#include <boost/type_traits/is_same.hpp>
|
||||
#include <boost/property_map/parallel/local_property_map.hpp>
|
||||
#include <map>
|
||||
#include <boost/version.hpp>
|
||||
#include <boost/property_map/parallel/unsafe_serialize.hpp>
|
||||
#include <boost/multi_index_container.hpp>
|
||||
#include <boost/multi_index/hashed_index.hpp>
|
||||
#include <boost/multi_index/member.hpp>
|
||||
#include <boost/multi_index/sequenced_index.hpp>
|
||||
|
||||
// Serialization functions for constructs we use
|
||||
#include <boost/serialization/utility.hpp>
|
||||
|
||||
namespace boost { namespace parallel {
|
||||
|
||||
namespace detail {
|
||||
/**************************************************************************
|
||||
* Metafunction that degrades an Lvalue Property Map category tag to
|
||||
* a Read Write Property Map category tag.
|
||||
**************************************************************************/
|
||||
template<bool IsLvaluePropertyMap>
|
||||
struct make_nonlvalue_property_map
|
||||
{
|
||||
template<typename T> struct apply { typedef T type; };
|
||||
};
|
||||
|
||||
template<>
|
||||
struct make_nonlvalue_property_map<true>
|
||||
{
|
||||
template<typename>
|
||||
struct apply
|
||||
{
|
||||
typedef read_write_property_map_tag type;
|
||||
};
|
||||
};
|
||||
|
||||
/**************************************************************************
|
||||
* Performs a "put" on a property map so long as the property map is
|
||||
* a Writable Property Map or a mutable Lvalue Property Map. This
|
||||
* is required because the distributed property map's message
|
||||
* handler handles "put" messages even for a const property map,
|
||||
* although receipt of a "put" message is ill-formed.
|
||||
**************************************************************************/
|
||||
template<bool IsLvaluePropertyMap>
|
||||
struct maybe_put_in_lvalue_pm
|
||||
{
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
static inline void
|
||||
do_put(PropertyMap, const Key&, const Value&)
|
||||
{ BOOST_ASSERT(false); }
|
||||
};
|
||||
|
||||
template<>
|
||||
struct maybe_put_in_lvalue_pm<true>
|
||||
{
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
static inline void
|
||||
do_put(PropertyMap pm, const Key& key, const Value& value)
|
||||
{
|
||||
using boost::put;
|
||||
|
||||
put(pm, key, value);
|
||||
}
|
||||
};
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
maybe_put_impl(PropertyMap pm, const Key& key, const Value& value,
|
||||
writable_property_map_tag)
|
||||
{
|
||||
using boost::put;
|
||||
|
||||
put(pm, key, value);
|
||||
}
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
maybe_put_impl(PropertyMap pm, const Key& key, const Value& value,
|
||||
lvalue_property_map_tag)
|
||||
{
|
||||
typedef typename property_traits<PropertyMap>::value_type value_type;
|
||||
typedef typename property_traits<PropertyMap>::reference reference;
|
||||
// DPG TBD: Some property maps are improperly characterized as
|
||||
// lvalue_property_maps, when in fact they do not provide true
|
||||
// references. The most typical example is those property maps
|
||||
// built from vector<bool> and its iterators, which deal with
|
||||
// proxies. We don't want to mischaracterize these as not having a
|
||||
// "put" operation, so we only consider an lvalue_property_map as
|
||||
// constant if its reference is const value_type&. In fact, this
|
||||
// isn't even quite correct (think of a
|
||||
// vector<bool>::const_iterator), but at present C++ doesn't
|
||||
// provide us with any alternatives.
|
||||
typedef is_same<const value_type&, reference> is_constant;
|
||||
|
||||
maybe_put_in_lvalue_pm<(!is_constant::value)>::do_put(pm, key, value);
|
||||
}
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
maybe_put_impl(PropertyMap, const Key&, const Value&, ...)
|
||||
{ BOOST_ASSERT(false); }
|
||||
|
||||
template<typename PropertyMap, typename Key, typename Value>
|
||||
inline void
|
||||
maybe_put(PropertyMap pm, const Key& key, const Value& value)
|
||||
{
|
||||
maybe_put_impl(pm, key, value,
|
||||
typename property_traits<PropertyMap>::category());
|
||||
}
|
||||
} // end namespace detail
|
||||
|
||||
/** The consistency model used by the distributed property map. */
|
||||
enum consistency_model {
|
||||
cm_forward = 1 << 0,
|
||||
cm_backward = 1 << 1,
|
||||
cm_bidirectional = cm_forward | cm_backward,
|
||||
cm_flush = 1 << 2,
|
||||
cm_reset = 1 << 3,
|
||||
cm_clear = 1 << 4
|
||||
};
|
||||
|
||||
/** Distributed property map adaptor.
|
||||
*
|
||||
* The distributed property map adaptor is a property map whose
|
||||
* stored values are distributed across multiple non-overlapping
|
||||
* memory spaces on different processes. Values local to the current
|
||||
* process are stored within a local property map and may be
|
||||
* immediately accessed via @c get and @c put. Values stored on
|
||||
* remote processes may also be access via @c get and @c put, but the
|
||||
* behavior differs slightly:
|
||||
*
|
||||
* - @c put operations update a local ghost cell and send a "put"
|
||||
* message to the process that owns the value. The owner is free to
|
||||
* update its own "official" value or may ignore the put request.
|
||||
*
|
||||
* - @c get operations returns the contents of the local ghost
|
||||
* cell. If no ghost cell is available, one is created using the
|
||||
* default value provided by the "reduce" operation. See, e.g.,
|
||||
* @ref basic_reduce and @ref property_reduce.
|
||||
*
|
||||
* Using distributed property maps requires a bit more care than using
|
||||
* local, sequential property maps. While the syntax and semantics are
|
||||
* similar, distributed property maps may contain out-of-date
|
||||
* information that can only be guaranteed to be synchronized by
|
||||
* calling the @ref synchronize function in all processes.
|
||||
*
|
||||
* To address the issue of out-of-date values, distributed property
|
||||
* maps are supplied with a reduction operation. The reduction
|
||||
* operation has two roles:
|
||||
*
|
||||
* -# When a value is needed for a remote key but no value is
|
||||
* immediately available, the reduction operation provides a
|
||||
* suitable default. For instance, a distributed property map
|
||||
* storing distances may have a reduction operation that returns
|
||||
* an infinite value as the default, whereas a distributed
|
||||
* property map for vertex colors may return white as the
|
||||
* default.
|
||||
*
|
||||
* -# When a value is received from a remote process, the process
|
||||
* owning the key associated with that value must determine which
|
||||
* value---the locally stored value, the value received from a
|
||||
* remote process, or some combination of the two---will be
|
||||
* stored as the "official" value in the property map. The
|
||||
* reduction operation transforms the local and remote values
|
||||
* into the "official" value to be stored.
|
||||
*
|
||||
* @tparam ProcessGroup the type of the process group over which the
|
||||
* property map is distributed and is also the medium for
|
||||
* communication.
|
||||
*
|
||||
* @tparam StorageMap the type of the property map that will
|
||||
* store values for keys local to this processor. The @c value_type of
|
||||
* this property map will become the @c value_type of the distributed
|
||||
* property map. The distributed property map models the same property
|
||||
* map concepts as the @c LocalPropertyMap, with one exception: a
|
||||
* distributed property map cannot be an LvaluePropertyMap (because
|
||||
* remote values are not addressable), and is therefore limited to
|
||||
* ReadWritePropertyMap.
|
||||
*/
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
class distributed_property_map
|
||||
{
|
||||
public:
|
||||
/// The key type of the property map.
|
||||
typedef typename property_traits<GlobalMap>::key_type key_type;
|
||||
|
||||
/// The value type of the property map.
|
||||
typedef typename property_traits<StorageMap>::value_type value_type;
|
||||
typedef typename property_traits<StorageMap>::reference reference;
|
||||
typedef ProcessGroup process_group_type;
|
||||
|
||||
private:
|
||||
typedef distributed_property_map self_type;
|
||||
typedef typename property_traits<StorageMap>::category local_category;
|
||||
typedef typename property_traits<StorageMap>::key_type local_key_type;
|
||||
typedef typename property_traits<GlobalMap>::value_type owner_local_pair;
|
||||
typedef typename ProcessGroup::process_id_type process_id_type;
|
||||
|
||||
enum property_map_messages {
|
||||
/** A request to store a value in a property map. The message
|
||||
* contains a std::pair<key, data>.
|
||||
*/
|
||||
property_map_put,
|
||||
|
||||
/** A request to retrieve a particular value in a property
|
||||
* map. The message contains a key. The owner of that key will
|
||||
* reply with a value.
|
||||
*/
|
||||
property_map_get,
|
||||
|
||||
/** A request to update values stored on a remote processor. The
|
||||
* message contains a vector of keys for which the source
|
||||
* requests updated values. This message will only be transmitted
|
||||
* during synchronization.
|
||||
*/
|
||||
property_map_multiget,
|
||||
|
||||
/** A request to store values in a ghost cell. This message
|
||||
* contains a vector of key/value pairs corresponding to the
|
||||
* sequence of keys sent to the source processor.
|
||||
*/
|
||||
property_map_multiget_reply,
|
||||
|
||||
/** The payload containing a vector of local key-value pairs to be
|
||||
* put into the remote property map. A key-value std::pair will be
|
||||
* used to store each local key-value pair.
|
||||
*/
|
||||
property_map_multiput
|
||||
};
|
||||
|
||||
// Code from Joaquín M López Muñoz to work around unusual implementation of
|
||||
// std::pair in VC++ 10:
|
||||
template<typename First,typename Second>
|
||||
class pair_first_extractor {
|
||||
typedef std::pair<First,Second> value_type;
|
||||
|
||||
public:
|
||||
typedef First result_type;
|
||||
const result_type& operator()(const value_type& x) const {
|
||||
return x.first;
|
||||
}
|
||||
|
||||
result_type& operator()(value_type& x) const {
|
||||
return x.first;
|
||||
}
|
||||
};
|
||||
|
||||
public:
|
||||
/// The type of the ghost cells
|
||||
typedef multi_index::multi_index_container<
|
||||
std::pair<key_type, value_type>,
|
||||
multi_index::indexed_by<
|
||||
multi_index::sequenced<>,
|
||||
multi_index::hashed_unique<
|
||||
pair_first_extractor<key_type, value_type>
|
||||
>
|
||||
>
|
||||
> ghost_cells_type;
|
||||
|
||||
/// Iterator into the ghost cells
|
||||
typedef typename ghost_cells_type::iterator iterator;
|
||||
|
||||
/// Key-based index into the ghost cells
|
||||
typedef typename ghost_cells_type::template nth_index<1>::type
|
||||
ghost_cells_key_index_type;
|
||||
|
||||
/// Iterator into the ghost cells (by key)
|
||||
typedef typename ghost_cells_key_index_type::iterator key_iterator;
|
||||
|
||||
/** The property map category. A distributed property map cannot be
|
||||
* an Lvalue Property Map, because values on remote processes cannot
|
||||
* be addresses.
|
||||
*/
|
||||
typedef typename detail::make_nonlvalue_property_map<
|
||||
(is_base_and_derived<lvalue_property_map_tag, local_category>::value
|
||||
|| is_same<lvalue_property_map_tag, local_category>::value)>
|
||||
::template apply<local_category>::type category;
|
||||
|
||||
/** Default-construct a distributed property map. This function
|
||||
* creates an initialized property map that must be assigned to a
|
||||
* valid value before being used. It is only provided here because
|
||||
* property maps must be Default Constructible.
|
||||
*/
|
||||
distributed_property_map() {}
|
||||
|
||||
/** Construct a distributed property map. Builds a distributed
|
||||
* property map communicating over the given process group and using
|
||||
* the given local property map for storage. Since no reduction
|
||||
* operation is provided, the default reduction operation @c
|
||||
* basic_reduce<value_type> is used.
|
||||
*/
|
||||
distributed_property_map(const ProcessGroup& pg, const GlobalMap& global,
|
||||
const StorageMap& pm)
|
||||
: data(new data_t(pg, global, pm, basic_reduce<value_type>(), false))
|
||||
{
|
||||
typedef handle_message<basic_reduce<value_type> > Handler;
|
||||
|
||||
data->ghost_cells.reset(new ghost_cells_type());
|
||||
Handler handler(data);
|
||||
data->process_group.replace_handler(handler, true);
|
||||
data->process_group.template get_receiver<Handler>()
|
||||
->setup_triggers(data->process_group);
|
||||
}
|
||||
|
||||
/** Construct a distributed property map. Builds a distributed
|
||||
* property map communicating over the given process group and using
|
||||
* the given local property map for storage. The given @p reduce
|
||||
* parameter is used as the reduction operation.
|
||||
*/
|
||||
template<typename Reduce>
|
||||
distributed_property_map(const ProcessGroup& pg, const GlobalMap& global,
|
||||
const StorageMap& pm,
|
||||
const Reduce& reduce);
|
||||
|
||||
~distributed_property_map();
|
||||
|
||||
/// Set the reduce operation of the distributed property map.
|
||||
template<typename Reduce>
|
||||
void set_reduce(const Reduce& reduce);
|
||||
|
||||
// Set the consistency model for the distributed property map
|
||||
void set_consistency_model(int model);
|
||||
|
||||
// Get the consistency model
|
||||
int get_consistency_model() const { return data->model; }
|
||||
|
||||
// Set the maximum number of ghost cells that we are allowed to
|
||||
// maintain. If 0, all ghost cells will be retained.
|
||||
void set_max_ghost_cells(std::size_t max_ghost_cells);
|
||||
|
||||
// Clear out all ghost cells
|
||||
void clear();
|
||||
|
||||
// Reset the values in all ghost cells to the default value
|
||||
void reset();
|
||||
|
||||
// Flush all values destined for remote processors
|
||||
void flush();
|
||||
|
||||
reference operator[](const key_type& key) const
|
||||
{
|
||||
owner_local_pair p = get(data->global, key);
|
||||
|
||||
if (p.first == process_id(data->process_group)) {
|
||||
return data->storage[p.second];
|
||||
} else {
|
||||
return cell(key);
|
||||
}
|
||||
}
|
||||
|
||||
process_group_type process_group() const
|
||||
{
|
||||
return data->process_group.base();
|
||||
}
|
||||
|
||||
StorageMap& base() { return data->storage; }
|
||||
const StorageMap& base() const { return data->storage; }
|
||||
|
||||
/** Sends a "put" request.
|
||||
* \internal
|
||||
*
|
||||
*/
|
||||
void
|
||||
request_put(process_id_type p, const key_type& k, const value_type& v) const
|
||||
{
|
||||
send(data->process_group, p, property_map_put,
|
||||
boost::parallel::detail::make_untracked_pair(k, v));
|
||||
}
|
||||
|
||||
/** Access the ghost cell for the given key.
|
||||
* \internal
|
||||
*/
|
||||
value_type& cell(const key_type& k, bool request_if_missing = true) const;
|
||||
|
||||
/** Perform synchronization
|
||||
* \internal
|
||||
*/
|
||||
void do_synchronize();
|
||||
|
||||
const GlobalMap& global() const { return data->global; }
|
||||
GlobalMap& global() { return data->global; }
|
||||
|
||||
struct data_t
|
||||
{
|
||||
data_t(const ProcessGroup& pg, const GlobalMap& global,
|
||||
const StorageMap& pm, const function1<value_type, key_type>& dv,
|
||||
bool has_default_resolver)
|
||||
: process_group(pg), global(global), storage(pm),
|
||||
ghost_cells(), max_ghost_cells(1000000), get_default_value(dv),
|
||||
has_default_resolver(has_default_resolver), model(cm_forward) { }
|
||||
|
||||
/// The process group
|
||||
ProcessGroup process_group;
|
||||
|
||||
/// A mapping from the keys of this property map to the global
|
||||
/// descriptor.
|
||||
GlobalMap global;
|
||||
|
||||
/// Local property map
|
||||
StorageMap storage;
|
||||
|
||||
/// The ghost cells
|
||||
shared_ptr<ghost_cells_type> ghost_cells;
|
||||
|
||||
/// The maximum number of ghost cells we are permitted to hold. If
|
||||
/// zero, we are permitted to have an infinite number of ghost
|
||||
/// cells.
|
||||
std::size_t max_ghost_cells;
|
||||
|
||||
/// Default value for remote ghost cells, as defined by the
|
||||
/// reduction operation.
|
||||
function1<value_type, key_type> get_default_value;
|
||||
|
||||
/// True if this resolver is the "default" resolver, meaning that
|
||||
/// we should not be able to get() a default value; it needs to be
|
||||
/// request()ed first.
|
||||
bool has_default_resolver;
|
||||
|
||||
// Current consistency model
|
||||
int model;
|
||||
|
||||
// Function that resets all of the ghost cells to their default
|
||||
// values. It knows the type of the resolver, so we can eliminate
|
||||
// a large number of calls through function pointers.
|
||||
void (data_t::*reset)();
|
||||
|
||||
// Clear out all ghost cells
|
||||
void clear();
|
||||
|
||||
// Flush all values destined for remote processors
|
||||
void flush();
|
||||
|
||||
// Send out requests to "refresh" the values of ghost cells that
|
||||
// we're holding.
|
||||
void refresh_ghost_cells();
|
||||
|
||||
private:
|
||||
template<typename Resolver> void do_reset();
|
||||
|
||||
friend class distributed_property_map;
|
||||
};
|
||||
friend struct data_t;
|
||||
|
||||
shared_ptr<data_t> data;
|
||||
|
||||
private:
|
||||
// Prunes the least recently used ghost cells until we have @c
|
||||
// max_ghost_cells or fewer ghost cells.
|
||||
void prune_ghost_cells() const;
|
||||
|
||||
/** Handles incoming messages.
|
||||
*
|
||||
* This function object is responsible for handling all incoming
|
||||
* messages for the distributed property map.
|
||||
*/
|
||||
template<typename Reduce>
|
||||
struct handle_message
|
||||
{
|
||||
explicit handle_message(const shared_ptr<data_t>& data,
|
||||
const Reduce& reduce = Reduce())
|
||||
: data_ptr(data), reduce(reduce) { }
|
||||
|
||||
void operator()(process_id_type source, int tag);
|
||||
|
||||
/// Individual message handlers
|
||||
void
|
||||
handle_put(int source, int tag,
|
||||
const boost::parallel::detail::untracked_pair<key_type, value_type>& data,
|
||||
trigger_receive_context);
|
||||
|
||||
value_type
|
||||
handle_get(int source, int tag, const key_type& data,
|
||||
trigger_receive_context);
|
||||
|
||||
void
|
||||
handle_multiget(int source, int tag,
|
||||
const std::vector<key_type>& data,
|
||||
trigger_receive_context);
|
||||
|
||||
void
|
||||
handle_multiget_reply
|
||||
(int source, int tag,
|
||||
const std::vector<boost::parallel::detail::untracked_pair<key_type, value_type> >& msg,
|
||||
trigger_receive_context);
|
||||
|
||||
void
|
||||
handle_multiput
|
||||
(int source, int tag,
|
||||
const std::vector<unsafe_pair<local_key_type, value_type> >& data,
|
||||
trigger_receive_context);
|
||||
|
||||
void setup_triggers(process_group_type& pg);
|
||||
|
||||
private:
|
||||
weak_ptr<data_t> data_ptr;
|
||||
Reduce reduce;
|
||||
};
|
||||
|
||||
/* Sets up the next stage in a multi-stage synchronization, for
|
||||
bidirectional consistency. */
|
||||
struct on_synchronize
|
||||
{
|
||||
explicit on_synchronize(const shared_ptr<data_t>& data) : data_ptr(data) { }
|
||||
|
||||
void operator()();
|
||||
|
||||
private:
|
||||
weak_ptr<data_t> data_ptr;
|
||||
};
|
||||
};
|
||||
|
||||
/* An implementation helper macro for the common case of naming
|
||||
distributed property maps with all of the normal template
|
||||
parameters. */
|
||||
#define PBGL_DISTRIB_PMAP \
|
||||
distributed_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
|
||||
/* Request that the value for the given remote key be retrieved in
|
||||
the next synchronization round. */
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
inline void
|
||||
request(const PBGL_DISTRIB_PMAP& pm,
|
||||
typename PBGL_DISTRIB_PMAP::key_type const& key)
|
||||
{
|
||||
if (get(pm.data->global, key).first != process_id(pm.data->process_group))
|
||||
pm.cell(key, false);
|
||||
}
|
||||
|
||||
/** Get the value associated with a particular key. Retrieves the
|
||||
* value associated with the given key. If the key denotes a
|
||||
* locally-owned object, it returns the value from the local property
|
||||
* map; if the key denotes a remotely-owned object, retrieves the
|
||||
* value of the ghost cell for that key, which may be the default
|
||||
* value provided by the reduce operation.
|
||||
*
|
||||
* Complexity: For a local key, O(1) get operations on the underlying
|
||||
* property map. For a non-local key, O(1) accesses to the ghost cells.
|
||||
*/
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
inline
|
||||
typename PBGL_DISTRIB_PMAP::value_type
|
||||
get(const PBGL_DISTRIB_PMAP& pm,
|
||||
typename PBGL_DISTRIB_PMAP::key_type const& key)
|
||||
{
|
||||
using boost::get;
|
||||
|
||||
typename property_traits<GlobalMap>::value_type p =
|
||||
get(pm.data->global, key);
|
||||
|
||||
if (p.first == process_id(pm.data->process_group)) {
|
||||
return get(pm.data->storage, p.second);
|
||||
} else {
|
||||
return pm.cell(key);
|
||||
}
|
||||
}
|
||||
|
||||
/** Put a value associated with the given key into the property map.
|
||||
* When the key denotes a locally-owned object, this operation updates
|
||||
* the underlying local property map. Otherwise, the local ghost cell
|
||||
* is updated and a "put" message is sent to the processor owning this
|
||||
* key.
|
||||
*
|
||||
* Complexity: For a local key, O(1) put operations on the underlying
|
||||
* property map. For a nonlocal key, O(1) accesses to the ghost cells
|
||||
* and will send O(1) messages of size O(sizeof(key) + sizeof(value)).
|
||||
*/
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
void
|
||||
put(const PBGL_DISTRIB_PMAP& pm,
|
||||
typename PBGL_DISTRIB_PMAP::key_type const & key,
|
||||
typename PBGL_DISTRIB_PMAP::value_type const & value)
|
||||
{
|
||||
using boost::put;
|
||||
|
||||
typename property_traits<GlobalMap>::value_type p =
|
||||
get(pm.data->global, key);
|
||||
|
||||
if (p.first == process_id(pm.data->process_group)) {
|
||||
put(pm.data->storage, p.second, value);
|
||||
} else {
|
||||
if (pm.data->model & cm_forward)
|
||||
pm.request_put(p.first, key, value);
|
||||
|
||||
pm.cell(key, false) = value;
|
||||
}
|
||||
}
|
||||
|
||||
/** Put a value associated with a given key into the local view of the
|
||||
* property map. This operation is equivalent to @c put, but with one
|
||||
* exception: no message will be sent to the owning processor in the
|
||||
* case of a remote update. The effect is that any value written via
|
||||
* @c local_put for a remote key may be overwritten in the next
|
||||
* synchronization round.
|
||||
*/
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
void
|
||||
local_put(const PBGL_DISTRIB_PMAP& pm,
|
||||
typename PBGL_DISTRIB_PMAP::key_type const & key,
|
||||
typename PBGL_DISTRIB_PMAP::value_type const & value)
|
||||
{
|
||||
using boost::put;
|
||||
|
||||
typename property_traits<GlobalMap>::value_type p =
|
||||
get(pm.data->global, key);
|
||||
|
||||
if (p.first == process_id(pm.data->process_group))
|
||||
put(pm.data->storage, p.second, value);
|
||||
else pm.cell(key, false) = value;
|
||||
}
|
||||
|
||||
/** Cache the value associated with the given remote key. If the key
|
||||
* is local, ignore the operation. */
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
inline void
|
||||
cache(const PBGL_DISTRIB_PMAP& pm,
|
||||
typename PBGL_DISTRIB_PMAP::key_type const & key,
|
||||
typename PBGL_DISTRIB_PMAP::value_type const & value)
|
||||
{
|
||||
typename ProcessGroup::process_id_type id = get(pm.data->global, key).first;
|
||||
|
||||
if (id != process_id(pm.data->process_group)) pm.cell(key, false) = value;
|
||||
}
|
||||
|
||||
/// Synchronize the property map.
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
void
|
||||
synchronize(PBGL_DISTRIB_PMAP& pm)
|
||||
{
|
||||
pm.do_synchronize();
|
||||
}
|
||||
|
||||
/// Create a distributed property map.
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
inline distributed_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
make_distributed_property_map(const ProcessGroup& pg, GlobalMap global,
|
||||
StorageMap storage)
|
||||
{
|
||||
typedef distributed_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
result_type;
|
||||
return result_type(pg, global, storage);
|
||||
}
|
||||
|
||||
/**
|
||||
* \overload
|
||||
*/
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap,
|
||||
typename Reduce>
|
||||
inline distributed_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
make_distributed_property_map(const ProcessGroup& pg, GlobalMap global,
|
||||
StorageMap storage, Reduce reduce)
|
||||
{
|
||||
typedef distributed_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
result_type;
|
||||
return result_type(pg, global, storage, reduce);
|
||||
}
|
||||
|
||||
} } // end namespace boost::parallel
|
||||
|
||||
#include <boost/property_map/parallel/impl/distributed_property_map.ipp>
|
||||
|
||||
#undef PBGL_DISTRIB_PMAP
|
||||
|
||||
#endif // BOOST_PARALLEL_DISTRIBUTED_PROPERTY_MAP_HPP
|
||||
@@ -0,0 +1,70 @@
|
||||
// Copyright 2005 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
|
||||
// Andrew Lumsdaine
|
||||
#ifndef BOOST_PARALLEL_GLOBAL_INDEX_MAP_HPP
|
||||
#define BOOST_PARALLEL_GLOBAL_INDEX_MAP_HPP
|
||||
|
||||
#include <boost/property_map/property_map.hpp>
|
||||
#include <vector>
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
namespace boost { namespace parallel {
|
||||
|
||||
template<typename IndexMap, typename GlobalMap>
|
||||
class global_index_map
|
||||
{
|
||||
public:
|
||||
typedef typename property_traits<IndexMap>::key_type key_type;
|
||||
typedef typename property_traits<IndexMap>::value_type value_type;
|
||||
typedef value_type reference;
|
||||
typedef readable_property_map_tag category;
|
||||
|
||||
template<typename ProcessGroup>
|
||||
global_index_map(ProcessGroup pg, value_type num_local_indices,
|
||||
IndexMap index_map, GlobalMap global)
|
||||
: index_map(index_map), global(global)
|
||||
{
|
||||
typedef typename ProcessGroup::process_id_type process_id_type;
|
||||
starting_index.reset(new std::vector<value_type>(num_processes(pg) + 1));
|
||||
send(pg, 0, 0, num_local_indices);
|
||||
synchronize(pg);
|
||||
|
||||
// Populate starting_index in all processes
|
||||
if (process_id(pg) == 0) {
|
||||
(*starting_index)[0] = 0;
|
||||
for (process_id_type src = 0; src < num_processes(pg); ++src) {
|
||||
value_type n;
|
||||
receive(pg, src, 0, n);
|
||||
(*starting_index)[src + 1] = (*starting_index)[src] + n;
|
||||
}
|
||||
for (process_id_type dest = 1; dest < num_processes(pg); ++dest)
|
||||
send(pg, dest, 1, &starting_index->front(), num_processes(pg));
|
||||
synchronize(pg);
|
||||
} else {
|
||||
synchronize(pg);
|
||||
receive(pg, 0, 1, &starting_index->front(), num_processes(pg));
|
||||
}
|
||||
}
|
||||
|
||||
friend inline value_type
|
||||
get(const global_index_map& gim, const key_type& x)
|
||||
{
|
||||
using boost::get;
|
||||
return (*gim.starting_index)[get(gim.global, x).first]
|
||||
+ get(gim.index_map, x);
|
||||
}
|
||||
|
||||
private:
|
||||
shared_ptr<std::vector<value_type> > starting_index;
|
||||
IndexMap index_map;
|
||||
GlobalMap global;
|
||||
};
|
||||
|
||||
} } // end namespace boost::parallel
|
||||
|
||||
#endif // BOOST_PARALLEL_GLOBAL_INDEX_MAP_HPP
|
||||
+424
@@ -0,0 +1,424 @@
|
||||
// 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/property_map/parallel/detail/untracked_pair.hpp>
|
||||
#include <boost/type_traits/is_base_and_derived.hpp>
|
||||
#include <boost/bind.hpp>
|
||||
#include <boost/property_map/parallel/simple_trigger.hpp>
|
||||
|
||||
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::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
|
||||
+87
@@ -0,0 +1,87 @@
|
||||
// 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
|
||||
// Andrew Lumsdaine
|
||||
|
||||
// The placement of this #include probably looks very odd relative to
|
||||
// the #ifndef/#define pair below. However, this placement is
|
||||
// extremely important to allow the various property map headers to be
|
||||
// included in any order.
|
||||
#include <boost/property_map/property_map.hpp>
|
||||
|
||||
#ifndef BOOST_PARALLEL_LOCAL_PROPERTY_MAP_HPP
|
||||
#define BOOST_PARALLEL_LOCAL_PROPERTY_MAP_HPP
|
||||
|
||||
#include <boost/assert.hpp>
|
||||
|
||||
namespace boost {
|
||||
/** Property map that accesses an underlying, local property map
|
||||
* using a subset of the global keys.
|
||||
*/
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
class local_property_map
|
||||
{
|
||||
typedef typename property_traits<GlobalMap>::value_type owner_local_pair;
|
||||
|
||||
public:
|
||||
typedef ProcessGroup process_group_type;
|
||||
typedef typename property_traits<StorageMap>::value_type value_type;
|
||||
typedef typename property_traits<GlobalMap>::key_type key_type;
|
||||
typedef typename property_traits<StorageMap>::reference reference;
|
||||
typedef typename property_traits<StorageMap>::category category;
|
||||
|
||||
local_property_map() { }
|
||||
|
||||
local_property_map(const ProcessGroup& process_group,
|
||||
const GlobalMap& global, const StorageMap& storage)
|
||||
: process_group_(process_group), global_(global), storage(storage) { }
|
||||
|
||||
reference operator[](const key_type& key)
|
||||
{
|
||||
owner_local_pair p = get(global_, key);
|
||||
BOOST_ASSERT(p.first == process_id(process_group_));
|
||||
return storage[p.second];
|
||||
}
|
||||
|
||||
GlobalMap& global() const { return global_; }
|
||||
StorageMap& base() const { return storage; }
|
||||
|
||||
ProcessGroup& process_group() { return process_group_; }
|
||||
const ProcessGroup& process_group() const { return process_group_; }
|
||||
|
||||
private:
|
||||
ProcessGroup process_group_;
|
||||
mutable GlobalMap global_;
|
||||
mutable StorageMap storage;
|
||||
};
|
||||
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
inline
|
||||
typename local_property_map<ProcessGroup, GlobalMap, StorageMap>::reference
|
||||
get(const local_property_map<ProcessGroup, GlobalMap, StorageMap>& pm,
|
||||
typename local_property_map<ProcessGroup, GlobalMap, StorageMap>::key_type
|
||||
const & key)
|
||||
|
||||
{
|
||||
typename property_traits<GlobalMap>::value_type p = get(pm.global(), key);
|
||||
return get(pm.base(), p.second);
|
||||
}
|
||||
|
||||
template<typename ProcessGroup, typename GlobalMap, typename StorageMap>
|
||||
inline void
|
||||
put(const local_property_map<ProcessGroup, GlobalMap, StorageMap>& pm,
|
||||
typename local_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
::key_type const & key,
|
||||
typename local_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
::value_type const& v)
|
||||
{
|
||||
typename property_traits<GlobalMap>::value_type p = get(pm.global(), key);
|
||||
BOOST_ASSERT(p.first == process_id(pm.process_group()));
|
||||
put(pm.base(), p.second, v);
|
||||
}
|
||||
} // end namespace boost
|
||||
#endif // BOOST_PARALLEL_LOCAL_PROPERTY_MAP_HPP
|
||||
+232
@@ -0,0 +1,232 @@
|
||||
// (C) Copyright Jeremy Siek 1999-2001.
|
||||
// Copyright (C) 2006 Trustees of Indiana University
|
||||
// Authors: Douglas Gregor and Jeremy Siek
|
||||
|
||||
// Distributed under 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)
|
||||
|
||||
// See http://www.boost.org/libs/property_map for documentation.
|
||||
|
||||
#ifndef BOOST_PROPERTY_MAP_PARALLEL_PROPERTY_MAPS_HPP
|
||||
#define BOOST_PROPERTY_MAP_PARALLEL_PROPERTY_MAPS_HPP
|
||||
|
||||
// Parallel property maps moved over from <boost/property_map/property_map.hpp>
|
||||
// as part of refactoring out all parallel code from sequential property map
|
||||
// library.
|
||||
|
||||
#include <boost/assert.hpp>
|
||||
#include <boost/config.hpp>
|
||||
#include <boost/static_assert.hpp>
|
||||
#include <cstddef>
|
||||
#include <boost/detail/iterator.hpp>
|
||||
#include <boost/concept_archetype.hpp>
|
||||
#include <boost/mpl/assert.hpp>
|
||||
#include <boost/mpl/or.hpp>
|
||||
#include <boost/mpl/and.hpp>
|
||||
#include <boost/mpl/has_xxx.hpp>
|
||||
#include <boost/type_traits/is_same.hpp>
|
||||
#include <boost/property_map/property_map.hpp>
|
||||
|
||||
#include <boost/property_map/parallel/distributed_property_map.hpp>
|
||||
#include <boost/property_map/parallel/local_property_map.hpp>
|
||||
|
||||
namespace boost {
|
||||
/** Distributed iterator property map.
|
||||
*
|
||||
* This specialization of @ref iterator_property_map builds a
|
||||
* distributed iterator property map given the local index maps
|
||||
* generated by distributed graph types that automatically have index
|
||||
* properties.
|
||||
*
|
||||
* This specialization is useful when creating external distributed
|
||||
* property maps via the same syntax used to create external
|
||||
* sequential property maps.
|
||||
*/
|
||||
template<typename RandomAccessIterator, typename ProcessGroup,
|
||||
typename GlobalMap, typename StorageMap,
|
||||
typename ValueType, typename Reference>
|
||||
class iterator_property_map
|
||||
<RandomAccessIterator,
|
||||
local_property_map<ProcessGroup, GlobalMap, StorageMap>,
|
||||
ValueType, Reference>
|
||||
: public parallel::distributed_property_map
|
||||
<ProcessGroup,
|
||||
GlobalMap,
|
||||
iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> >
|
||||
{
|
||||
typedef iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> local_iterator_map;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
local_iterator_map> inherited;
|
||||
|
||||
typedef local_property_map<ProcessGroup, GlobalMap, StorageMap>
|
||||
index_map_type;
|
||||
typedef iterator_property_map self_type;
|
||||
|
||||
public:
|
||||
iterator_property_map() { }
|
||||
|
||||
iterator_property_map(RandomAccessIterator cc, const index_map_type& id)
|
||||
: inherited(id.process_group(), id.global(),
|
||||
local_iterator_map(cc, id.base())) { }
|
||||
};
|
||||
|
||||
/** Distributed iterator property map.
|
||||
*
|
||||
* This specialization of @ref iterator_property_map builds a
|
||||
* distributed iterator property map given a distributed index
|
||||
* map. Only the local portion of the distributed index property map
|
||||
* is utilized.
|
||||
*
|
||||
* This specialization is useful when creating external distributed
|
||||
* property maps via the same syntax used to create external
|
||||
* sequential property maps.
|
||||
*/
|
||||
template<typename RandomAccessIterator, typename ProcessGroup,
|
||||
typename GlobalMap, typename StorageMap,
|
||||
typename ValueType, typename Reference>
|
||||
class iterator_property_map<
|
||||
RandomAccessIterator,
|
||||
parallel::distributed_property_map<ProcessGroup,GlobalMap,StorageMap>,
|
||||
ValueType, Reference
|
||||
>
|
||||
: public parallel::distributed_property_map
|
||||
<ProcessGroup,
|
||||
GlobalMap,
|
||||
iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> >
|
||||
{
|
||||
typedef iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> local_iterator_map;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
local_iterator_map> inherited;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
StorageMap>
|
||||
index_map_type;
|
||||
|
||||
public:
|
||||
iterator_property_map() { }
|
||||
|
||||
iterator_property_map(RandomAccessIterator cc, const index_map_type& id)
|
||||
: inherited(id.process_group(), id.global(),
|
||||
local_iterator_map(cc, id.base())) { }
|
||||
};
|
||||
|
||||
namespace parallel {
|
||||
// Generate an iterator property map with a specific kind of ghost
|
||||
// cells
|
||||
template<typename RandomAccessIterator, typename ProcessGroup,
|
||||
typename GlobalMap, typename StorageMap>
|
||||
distributed_property_map<ProcessGroup,
|
||||
GlobalMap,
|
||||
iterator_property_map<RandomAccessIterator,
|
||||
StorageMap> >
|
||||
make_iterator_property_map(RandomAccessIterator cc,
|
||||
local_property_map<ProcessGroup, GlobalMap,
|
||||
StorageMap> index_map)
|
||||
{
|
||||
typedef distributed_property_map<
|
||||
ProcessGroup, GlobalMap,
|
||||
iterator_property_map<RandomAccessIterator, StorageMap> >
|
||||
result_type;
|
||||
return result_type(index_map.process_group(), index_map.global(),
|
||||
make_iterator_property_map(cc, index_map.base()));
|
||||
}
|
||||
|
||||
} // end namespace parallel
|
||||
|
||||
/** Distributed safe iterator property map.
|
||||
*
|
||||
* This specialization of @ref safe_iterator_property_map builds a
|
||||
* distributed iterator property map given the local index maps
|
||||
* generated by distributed graph types that automatically have index
|
||||
* properties.
|
||||
*
|
||||
* This specialization is useful when creating external distributed
|
||||
* property maps via the same syntax used to create external
|
||||
* sequential property maps.
|
||||
*/
|
||||
template<typename RandomAccessIterator, typename ProcessGroup,
|
||||
typename GlobalMap, typename StorageMap, typename ValueType,
|
||||
typename Reference>
|
||||
class safe_iterator_property_map
|
||||
<RandomAccessIterator,
|
||||
local_property_map<ProcessGroup, GlobalMap, StorageMap>,
|
||||
ValueType, Reference>
|
||||
: public parallel::distributed_property_map
|
||||
<ProcessGroup,
|
||||
GlobalMap,
|
||||
safe_iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> >
|
||||
{
|
||||
typedef safe_iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> local_iterator_map;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
local_iterator_map> inherited;
|
||||
|
||||
typedef local_property_map<ProcessGroup, GlobalMap, StorageMap> index_map_type;
|
||||
|
||||
public:
|
||||
safe_iterator_property_map() { }
|
||||
|
||||
safe_iterator_property_map(RandomAccessIterator cc, std::size_t n,
|
||||
const index_map_type& id)
|
||||
: inherited(id.process_group(), id.global(),
|
||||
local_iterator_map(cc, n, id.base())) { }
|
||||
};
|
||||
|
||||
/** Distributed safe iterator property map.
|
||||
*
|
||||
* This specialization of @ref safe_iterator_property_map builds a
|
||||
* distributed iterator property map given a distributed index
|
||||
* map. Only the local portion of the distributed index property map
|
||||
* is utilized.
|
||||
*
|
||||
* This specialization is useful when creating external distributed
|
||||
* property maps via the same syntax used to create external
|
||||
* sequential property maps.
|
||||
*/
|
||||
template<typename RandomAccessIterator, typename ProcessGroup,
|
||||
typename GlobalMap, typename StorageMap,
|
||||
typename ValueType, typename Reference>
|
||||
class safe_iterator_property_map<
|
||||
RandomAccessIterator,
|
||||
parallel::distributed_property_map<ProcessGroup,GlobalMap,StorageMap>,
|
||||
ValueType, Reference>
|
||||
: public parallel::distributed_property_map
|
||||
<ProcessGroup,
|
||||
GlobalMap,
|
||||
safe_iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> >
|
||||
{
|
||||
typedef safe_iterator_property_map<RandomAccessIterator, StorageMap,
|
||||
ValueType, Reference> local_iterator_map;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
local_iterator_map> inherited;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
StorageMap>
|
||||
index_map_type;
|
||||
|
||||
public:
|
||||
safe_iterator_property_map() { }
|
||||
|
||||
safe_iterator_property_map(RandomAccessIterator cc, std::size_t n,
|
||||
const index_map_type& id)
|
||||
: inherited(id.process_group(), id.global(),
|
||||
local_iterator_map(cc, n, id.base())) { }
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
#include <boost/property_map/vector_property_map.hpp>
|
||||
|
||||
#endif /* BOOST_PROPERTY_MAP_PARALLEL_PROPERTY_MAPS_HPP */
|
||||
|
||||
@@ -0,0 +1,97 @@
|
||||
// Copyright 2004 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
|
||||
// Andrew Lumsdaine
|
||||
#ifndef BOOST_PROPERTY_MAP_PARALLEL_PROCESS_GROUP_HPP
|
||||
#define BOOST_PROPERTY_MAP_PARALLEL_PROCESS_GROUP_HPP
|
||||
|
||||
#include <cstdlib>
|
||||
#include <utility>
|
||||
|
||||
namespace boost { namespace parallel {
|
||||
|
||||
/**
|
||||
* A special type used as a flag to a process group constructor that
|
||||
* indicates that the copy of a process group will represent a new
|
||||
* distributed data structure.
|
||||
*/
|
||||
struct attach_distributed_object { };
|
||||
|
||||
/**
|
||||
* Describes the context in which a trigger is being invoked to
|
||||
* receive a message.
|
||||
*/
|
||||
enum trigger_receive_context {
|
||||
/// No trigger is active at this time.
|
||||
trc_none,
|
||||
/// The trigger is being invoked during synchronization, at the end
|
||||
/// of a superstep.
|
||||
trc_in_synchronization,
|
||||
/// The trigger is being invoked as an "early" receive of a message
|
||||
/// that was sent through the normal "send" operations to be
|
||||
/// received by the end of the superstep, but the process group sent
|
||||
/// the message earlier to clear its buffers.
|
||||
trc_early_receive,
|
||||
/// The trigger is being invoked for an out-of-band message, which
|
||||
/// must be handled immediately.
|
||||
trc_out_of_band,
|
||||
/// The trigger is being invoked for an out-of-band message, which
|
||||
/// must be handled immediately and has alredy been received by
|
||||
/// an MPI_IRecv call.
|
||||
trc_irecv_out_of_band
|
||||
};
|
||||
|
||||
// Process group tags
|
||||
struct process_group_tag {};
|
||||
struct linear_process_group_tag : virtual process_group_tag {};
|
||||
struct messaging_process_group_tag : virtual process_group_tag {};
|
||||
struct immediate_process_group_tag : virtual messaging_process_group_tag {};
|
||||
struct bsp_process_group_tag : virtual messaging_process_group_tag {};
|
||||
struct batch_process_group_tag : virtual messaging_process_group_tag {};
|
||||
struct locking_process_group_tag : virtual process_group_tag {};
|
||||
struct spawning_process_group_tag : virtual process_group_tag {};
|
||||
|
||||
struct process_group_archetype
|
||||
{
|
||||
typedef int process_id_type;
|
||||
};
|
||||
|
||||
void wait(process_group_archetype&);
|
||||
void synchronize(process_group_archetype&);
|
||||
int process_id(const process_group_archetype&);
|
||||
int num_processes(const process_group_archetype&);
|
||||
|
||||
template<typename T> void send(process_group_archetype&, int, int, const T&);
|
||||
|
||||
template<typename T>
|
||||
process_group_archetype::process_id_type
|
||||
receive(const process_group_archetype& pg,
|
||||
process_group_archetype::process_id_type source, int tag, T& value);
|
||||
|
||||
template<typename T>
|
||||
std::pair<process_group_archetype::process_id_type, std::size_t>
|
||||
receive(const process_group_archetype& pg, int tag, T values[], std::size_t n);
|
||||
|
||||
template<typename T>
|
||||
std::pair<process_group_archetype::process_id_type, std::size_t>
|
||||
receive(const process_group_archetype& pg,
|
||||
process_group_archetype::process_id_type source, int tag, T values[],
|
||||
std::size_t n);
|
||||
|
||||
} } // end namespace boost::parallel
|
||||
|
||||
namespace boost { namespace graph { namespace distributed {
|
||||
using boost::parallel::trigger_receive_context;
|
||||
using boost::parallel::trc_early_receive;
|
||||
using boost::parallel::trc_out_of_band;
|
||||
using boost::parallel::trc_irecv_out_of_band;
|
||||
using boost::parallel::trc_in_synchronization;
|
||||
using boost::parallel::trc_none;
|
||||
using boost::parallel::attach_distributed_object;
|
||||
} } } // end namespace boost::graph::distributed
|
||||
|
||||
#endif // BOOST_PROPERTY_MAP_PARALLEL_PROCESS_GROUP_HPP
|
||||
@@ -0,0 +1,106 @@
|
||||
// Copyright (C) 2007 Douglas Gregor
|
||||
|
||||
// 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)
|
||||
|
||||
// This file contains a simplification of the "trigger" method for
|
||||
// process groups. The simple trigger handles the common case where
|
||||
// the handler associated with a trigger is a member function bound to
|
||||
// a particular pointer.
|
||||
|
||||
#ifndef BOOST_PROPERTY_MAP_PARALLEL_SIMPLE_TRIGGER_HPP
|
||||
#define BOOST_PROPERTY_MAP_PARALLEL_SIMPLE_TRIGGER_HPP
|
||||
|
||||
#include <boost/property_map/parallel/process_group.hpp>
|
||||
|
||||
namespace boost { namespace parallel {
|
||||
|
||||
namespace detail {
|
||||
|
||||
/**
|
||||
* INTERNAL ONLY
|
||||
*
|
||||
* The actual function object that bridges from the normal trigger
|
||||
* interface to the simplified interface. This is the equivalent of
|
||||
* bind(pmf, self, _1, _2, _3, _4), but without the compile-time
|
||||
* overhead of bind.
|
||||
*/
|
||||
template<typename Class, typename T, typename Result>
|
||||
class simple_trigger_t
|
||||
{
|
||||
public:
|
||||
simple_trigger_t(Class* self,
|
||||
Result (Class::*pmf)(int, int, const T&,
|
||||
trigger_receive_context))
|
||||
: self(self), pmf(pmf) { }
|
||||
|
||||
Result
|
||||
operator()(int source, int tag, const T& data,
|
||||
trigger_receive_context context) const
|
||||
{
|
||||
return (self->*pmf)(source, tag, data, context);
|
||||
}
|
||||
|
||||
private:
|
||||
Class* self;
|
||||
Result (Class::*pmf)(int, int, const T&, trigger_receive_context);
|
||||
};
|
||||
|
||||
} // end namespace detail
|
||||
|
||||
/**
|
||||
* Simplified trigger interface that reduces the amount of code
|
||||
* required to connect a process group trigger to a handler that is
|
||||
* just a bound member function.
|
||||
*
|
||||
* INTERNAL ONLY
|
||||
*/
|
||||
template<typename ProcessGroup, typename Class, typename T>
|
||||
inline void
|
||||
simple_trigger(ProcessGroup& pg, int tag, Class* self,
|
||||
void (Class::*pmf)(int source, int tag, const T& data,
|
||||
trigger_receive_context context), int)
|
||||
{
|
||||
pg.template trigger<T>(tag,
|
||||
detail::simple_trigger_t<Class, T, void>(self, pmf));
|
||||
}
|
||||
|
||||
/**
|
||||
* Simplified trigger interface that reduces the amount of code
|
||||
* required to connect a process group trigger with a reply to a
|
||||
* handler that is just a bound member function.
|
||||
*
|
||||
* INTERNAL ONLY
|
||||
*/
|
||||
template<typename ProcessGroup, typename Class, typename T, typename Result>
|
||||
inline void
|
||||
simple_trigger(ProcessGroup& pg, int tag, Class* self,
|
||||
Result (Class::*pmf)(int source, int tag, const T& data,
|
||||
trigger_receive_context context), long)
|
||||
{
|
||||
pg.template trigger_with_reply<T>
|
||||
(tag, detail::simple_trigger_t<Class, T, Result>(self, pmf));
|
||||
}
|
||||
|
||||
/**
|
||||
* Simplified trigger interface that reduces the amount of code
|
||||
* required to connect a process group trigger to a handler that is
|
||||
* just a bound member function.
|
||||
*/
|
||||
template<typename ProcessGroup, typename Class, typename T, typename Result>
|
||||
inline void
|
||||
simple_trigger(ProcessGroup& pg, int tag, Class* self,
|
||||
Result (Class::*pmf)(int source, int tag, const T& data,
|
||||
trigger_receive_context context))
|
||||
{
|
||||
// We pass 0 (an int) to help VC++ disambiguate calls to simple_trigger
|
||||
// with Result=void.
|
||||
simple_trigger(pg, tag, self, pmf, 0);
|
||||
}
|
||||
|
||||
} } // end namespace boost::parallel
|
||||
|
||||
namespace boost { namespace graph { namespace parallel { using boost::parallel::simple_trigger; } } }
|
||||
|
||||
#endif // BOOST_PROPERTY_MAP_PARALLEL_SIMPLE_TRIGGER_HPP
|
||||
@@ -0,0 +1,81 @@
|
||||
// Copyright (C) 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
|
||||
// Andrew Lumsdaine
|
||||
|
||||
// This file contains the "unsafe_serialize" routine, which transforms
|
||||
// types they may not be serializable (such as void*) into
|
||||
// serializable equivalents.
|
||||
#ifndef BOOST_PROPERTY_MAP_UNSAFE_SERIALIZE_HPP
|
||||
#define BOOST_PROPERTY_MAP_UNSAFE_SERIALIZE_HPP
|
||||
|
||||
#include <boost/mpi/datatype.hpp>
|
||||
#include <boost/serialization/is_bitwise_serializable.hpp>
|
||||
#include <boost/mpl/bool.hpp>
|
||||
#include <boost/mpl/if.hpp>
|
||||
#include <boost/cstdint.hpp>
|
||||
#include <boost/static_assert.hpp>
|
||||
#include <boost/type_traits.hpp>
|
||||
#include <utility>
|
||||
|
||||
BOOST_IS_BITWISE_SERIALIZABLE(void*)
|
||||
namespace boost { namespace mpi {
|
||||
template<> struct is_mpi_datatype<void*> : mpl::true_ { };
|
||||
} } // end namespace boost::mpi
|
||||
|
||||
namespace boost {
|
||||
typedef mpl::if_c<(sizeof(int) == sizeof(void*)),
|
||||
int,
|
||||
mpl::if_c<(sizeof(long) == sizeof(void*)),
|
||||
long,
|
||||
mpl::if_c<(sizeof(void*) <= sizeof(boost::intmax_t)),
|
||||
boost::intmax_t,
|
||||
void>::type
|
||||
>::type
|
||||
>::type ptr_serialize_type;
|
||||
|
||||
BOOST_STATIC_ASSERT ((!boost::is_void<ptr_serialize_type>::value));
|
||||
|
||||
template<typename T> inline T& unsafe_serialize(T& x) { return x; }
|
||||
|
||||
inline ptr_serialize_type& unsafe_serialize(void*& x)
|
||||
{ return reinterpret_cast<ptr_serialize_type&>(x); }
|
||||
|
||||
// Force Boost.MPI to serialize a void* like a ptr_serialize_type
|
||||
namespace mpi {
|
||||
template<> inline MPI_Datatype get_mpi_datatype<void*>(void* const& x)
|
||||
{
|
||||
return get_mpi_datatype<ptr_serialize_type>();
|
||||
}
|
||||
}
|
||||
|
||||
template<typename T, typename U>
|
||||
struct unsafe_pair
|
||||
{
|
||||
unsafe_pair() { }
|
||||
unsafe_pair(const T& t, const U& u) : first(t), second(u) { }
|
||||
unsafe_pair(const std::pair<T, U>& p) : first(p.first), second(p.second) { }
|
||||
T first;
|
||||
U second;
|
||||
|
||||
template<typename Archiver>
|
||||
void serialize(Archiver& ar, const unsigned /*version*/)
|
||||
{
|
||||
ar & unsafe_serialize(first) & unsafe_serialize(second);
|
||||
}
|
||||
};
|
||||
|
||||
template<typename T, typename U>
|
||||
bool operator<(unsafe_pair<T,U> const& x, unsafe_pair<T,U> const& y)
|
||||
{
|
||||
return std::make_pair(x.first, x.second) <
|
||||
std::make_pair(y.first, y.second);
|
||||
}
|
||||
|
||||
} // end namespace boost
|
||||
|
||||
#endif // BOOST_PROPERTY_MAP_UNSAFE_SERIALIZE_HPP
|
||||
+104
@@ -0,0 +1,104 @@
|
||||
// Copyright (C) Vladimir Prus 2003.
|
||||
// Distributed under 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)
|
||||
//
|
||||
// See http://www.boost.org/libs/graph/vector_property_map.html for
|
||||
// documentation.
|
||||
//
|
||||
|
||||
#ifndef BOOST_PROPERTY_MAP_PARALLEL_VECTOR_PROPERTY_MAP_HPP_VP_2003_03_04
|
||||
#define BOOST_PROPERTY_MAP_PARALLEL_VECTOR_PROPERTY_MAP_HPP_VP_2003_03_04
|
||||
|
||||
#include <boost/property_map/property_map.hpp>
|
||||
#include <boost/shared_ptr.hpp>
|
||||
#include <vector>
|
||||
#include <boost/property_map/parallel/distributed_property_map.hpp>
|
||||
#include <boost/property_map/parallel/local_property_map.hpp>
|
||||
|
||||
namespace boost {
|
||||
|
||||
/** Distributed vector property map.
|
||||
*
|
||||
* This specialization of @ref vector_property_map builds a
|
||||
* distributed vector property map given the local index maps
|
||||
* generated by distributed graph types that automatically have index
|
||||
* properties.
|
||||
*
|
||||
* This specialization is useful when creating external distributed
|
||||
* property maps via the same syntax used to create external
|
||||
* sequential property maps.
|
||||
*/
|
||||
template<typename T, typename ProcessGroup, typename GlobalMap,
|
||||
typename StorageMap>
|
||||
class vector_property_map<T,
|
||||
local_property_map<ProcessGroup, GlobalMap,
|
||||
StorageMap> >
|
||||
: public parallel::distributed_property_map<
|
||||
ProcessGroup, GlobalMap, vector_property_map<T, StorageMap> >
|
||||
{
|
||||
typedef vector_property_map<T, StorageMap> local_iterator_map;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
local_iterator_map> inherited;
|
||||
|
||||
typedef local_property_map<ProcessGroup, GlobalMap, StorageMap> index_map_type;
|
||||
|
||||
public:
|
||||
vector_property_map(const index_map_type& index = index_map_type())
|
||||
: inherited(index.process_group(), index.global(),
|
||||
local_iterator_map(index.base())) { }
|
||||
|
||||
vector_property_map(unsigned inital_size,
|
||||
const index_map_type& index = index_map_type())
|
||||
: inherited(index.process_group(), index.global(),
|
||||
local_iterator_map(inital_size, index.base())) { }
|
||||
};
|
||||
|
||||
/** Distributed vector property map.
|
||||
*
|
||||
* This specialization of @ref vector_property_map builds a
|
||||
* distributed vector property map given the local index maps
|
||||
* generated by distributed graph types that automatically have index
|
||||
* properties.
|
||||
*
|
||||
* This specialization is useful when creating external distributed
|
||||
* property maps via the same syntax used to create external
|
||||
* sequential property maps.
|
||||
*/
|
||||
template<typename T, typename ProcessGroup, typename GlobalMap,
|
||||
typename StorageMap>
|
||||
class vector_property_map<
|
||||
T,
|
||||
parallel::distributed_property_map<
|
||||
ProcessGroup,
|
||||
GlobalMap,
|
||||
StorageMap
|
||||
>
|
||||
>
|
||||
: public parallel::distributed_property_map<
|
||||
ProcessGroup, GlobalMap, vector_property_map<T, StorageMap> >
|
||||
{
|
||||
typedef vector_property_map<T, StorageMap> local_iterator_map;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
local_iterator_map> inherited;
|
||||
|
||||
typedef parallel::distributed_property_map<ProcessGroup, GlobalMap,
|
||||
StorageMap>
|
||||
index_map_type;
|
||||
|
||||
public:
|
||||
vector_property_map(const index_map_type& index = index_map_type())
|
||||
: inherited(index.process_group(), index.global(),
|
||||
local_iterator_map(index.base())) { }
|
||||
|
||||
vector_property_map(unsigned inital_size,
|
||||
const index_map_type& index = index_map_type())
|
||||
: inherited(index.process_group(), index.global(),
|
||||
local_iterator_map(inital_size, index.base())) { }
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
#endif // BOOST_PROPERTY_MAP_PARALLEL_VECTOR_PROPERTY_MAP_HPP_VP_2003_03_04
|
||||
Reference in New Issue
Block a user