x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
scan.hpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\mpi\collectives\scan.hpp
Girar
Efecto
Propiedad
Historial
// Copyright (C) 2005-2006 Douglas Gregor
. // Copyright (C) 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 // Message Passing Interface 1.1 -- Section 4.9.1. Scan #ifndef BOOST_MPI_SCAN_HPP #define BOOST_MPI_SCAN_HPP #include
#include
// For (de-)serializing sends and receives #include
#include
// For packed_[io]archive sends and receives #include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace mpi { /************************************************************************ * Implementation details * ************************************************************************/ namespace detail { /********************************************************************** * Simple prefix reduction with MPI_Scan * **********************************************************************/ // We are performing prefix reduction for a type that has an // associated MPI datatype and operation, so we'll use MPI_Scan // directly. template
void scan_impl(const communicator& comm, const T* in_values, int n, T* out_values, Op op, mpl::true_ /*is_mpi_op*/, mpl::true_ /*is_mpi_datatype*/) { BOOST_MPI_CHECK_RESULT(MPI_Scan, (const_cast
(in_values), out_values, n, boost::mpi::get_mpi_datatype
(*in_values), is_mpi_op
::op(), comm)); } /********************************************************************** * User-defined prefix reduction with MPI_Scan * **********************************************************************/ // We are performing prefix reduction for a type that has an // associated MPI datatype but with a custom operation. We'll use // MPI_Scan directly, but we'll need to create an MPI_Op manually. template
void scan_impl(const communicator& comm, const T* in_values, int n, T* out_values, Op op, mpl::false_ /*is_mpi_op*/, mpl::true_ /*is_mpi_datatype*/) { user_op
mpi_op(op); BOOST_MPI_CHECK_RESULT(MPI_Scan, (const_cast
(in_values), out_values, n, boost::mpi::get_mpi_datatype
(*in_values), mpi_op.get_mpi_op(), comm)); } /********************************************************************** * User-defined, tree-based reduction for non-MPI data types * **********************************************************************/ template
void upper_lower_scan(const communicator& comm, const T* in_values, int n, T* out_values, Op& op, int lower, int upper) { int tag = environment::collectives_tag(); int rank = comm.rank(); if (lower + 1 == upper) { std::copy(in_values, in_values + n, out_values); } else { int middle = (lower + upper) / 2; if (rank < middle) { // Lower half upper_lower_scan(comm, in_values, n, out_values, op, lower, middle); // If we're the last process in the lower half, send our values // to everyone in the upper half. if (rank == middle - 1) { packed_oarchive oa(comm); for (int i = 0; i < n; ++i) oa << out_values[i]; for (int p = middle; p < upper; ++p) comm.send(p, tag, oa); } } else { // Upper half upper_lower_scan(comm, in_values, n, out_values, op, middle, upper); // Receive value from the last process in the lower half. packed_iarchive ia(comm); comm.recv(middle - 1, tag, ia); // Combine value that came from the left with our value T left_value; for (int i = 0; i < n; ++i) { ia >> left_value; out_values[i] = op(left_value, out_values[i]); } } } } // We are performing prefix reduction for a type that has no // associated MPI datatype and operation, so we'll use a simple // upper/lower algorithm. template
inline void scan_impl(const communicator& comm, const T* in_values, int n, T* out_values, Op op, mpl::false_ /*is_mpi_op*/, mpl::false_/*is_mpi_datatype*/) { upper_lower_scan(comm, in_values, n, out_values, op, 0, comm.size()); } } // end namespace detail template
inline void scan(const communicator& comm, const T& in_value, T& out_value, Op op) { detail::scan_impl(comm, &in_value, 1, &out_value, op, is_mpi_op
(), is_mpi_datatype
()); } template
inline void scan(const communicator& comm, const T* in_values, int n, T* out_values, Op op) { detail::scan_impl(comm, in_values, n, out_values, op, is_mpi_op
(), is_mpi_datatype
()); } template
inline T scan(const communicator& comm, const T& in_value, Op op) { T out_value; detail::scan_impl(comm, &in_value, 1, &out_value, op, is_mpi_op
(), is_mpi_datatype
()); return out_value; } } } // end namespace boost::mpi #endif // BOOST_MPI_SCAN_HPP
scan.hpp
Dirección de la página
Dirección del archivo
Anterior
7/8
Siguiente
Descargar
( 5 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.