114 lines
2.8 KiB
C++
114 lines
2.8 KiB
C++
// Copyright (C) 2005, 2006 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)
|
|
|
|
// A test of the all_to_all() collective.
|
|
#include <boost/mpi/collectives/all_to_all.hpp>
|
|
#include <boost/mpi/communicator.hpp>
|
|
#include <boost/mpi/environment.hpp>
|
|
#include <algorithm>
|
|
#include "gps_position.hpp"
|
|
#include <boost/serialization/string.hpp>
|
|
#include <boost/serialization/list.hpp>
|
|
#include <boost/iterator/counting_iterator.hpp>
|
|
#include <boost/lexical_cast.hpp>
|
|
|
|
#define BOOST_TEST_MODULE mpi_all_to_all
|
|
#include <boost/test/included/unit_test.hpp>
|
|
|
|
using boost::mpi::communicator;
|
|
|
|
using boost::mpi::packed_skeleton_iarchive;
|
|
using boost::mpi::packed_skeleton_oarchive;
|
|
|
|
template<typename Generator>
|
|
void
|
|
all_to_all_test(const communicator& comm, Generator generator,
|
|
const char* kind)
|
|
{
|
|
typedef typename Generator::result_type value_type;
|
|
|
|
using boost::mpi::all_to_all;
|
|
|
|
std::vector<value_type> in_values;
|
|
for (int p = 0; p < comm.size(); ++p)
|
|
in_values.push_back(generator((p + 1) * (comm.rank() + 1)));
|
|
|
|
if (comm.rank() == 0) {
|
|
std::cout << "Performing all-to-all operation on " << kind << "...";
|
|
std::cout.flush();
|
|
}
|
|
std::vector<value_type> out_values;
|
|
all_to_all(comm, in_values, out_values);
|
|
|
|
for (int p = 0; p < comm.size(); ++p) {
|
|
BOOST_CHECK(out_values[p] == generator((p + 1) * (comm.rank() + 1)));
|
|
}
|
|
|
|
if (comm.rank() == 0) {
|
|
std::cout << " done." << std::endl;
|
|
}
|
|
|
|
(comm.barrier)();
|
|
}
|
|
|
|
// Generates integers to test with all_to_all()
|
|
struct int_generator
|
|
{
|
|
typedef int result_type;
|
|
|
|
int operator()(int p) const { return 17 + p; }
|
|
};
|
|
|
|
// Generates GPS positions to test with all_to_all()
|
|
struct gps_generator
|
|
{
|
|
typedef gps_position result_type;
|
|
|
|
gps_position operator()(int p) const
|
|
{
|
|
return gps_position(39 + p, 16, 20.2799);
|
|
}
|
|
};
|
|
|
|
struct string_generator
|
|
{
|
|
typedef std::string result_type;
|
|
|
|
std::string operator()(int p) const
|
|
{
|
|
std::string result = boost::lexical_cast<std::string>(p);
|
|
result += " rosebud";
|
|
if (p != 1) result += 's';
|
|
return result;
|
|
}
|
|
};
|
|
|
|
struct string_list_generator
|
|
{
|
|
typedef std::list<std::string> result_type;
|
|
|
|
std::list<std::string> operator()(int p) const
|
|
{
|
|
std::list<std::string> result;
|
|
for (int i = 0; i <= p; ++i) {
|
|
std::string value = boost::lexical_cast<std::string>(i);
|
|
result.push_back(value);
|
|
}
|
|
return result;
|
|
}
|
|
};
|
|
|
|
BOOST_AUTO_TEST_CASE(all_to_all_check)
|
|
{
|
|
boost::mpi::environment env;
|
|
communicator comm;
|
|
|
|
all_to_all_test(comm, int_generator(), "integers");
|
|
all_to_all_test(comm, gps_generator(), "GPS positions");
|
|
all_to_all_test(comm, string_generator(), "string");
|
|
all_to_all_test(comm, string_list_generator(), "list of strings");
|
|
}
|