#include <lbdeux.h>
|
double | sum () |
| Sums costs up the tree returning to everyone the total cost.
|
|
|
static bool | compare (const std::pair< keyT, double > &a, const std::pair< keyT, double > &b) |
| Used to sort results into descending order.
|
|
◆ const_iteratorT
template<std::size_t NDIM>
◆ iteratorT
template<std::size_t NDIM>
◆ keyT
template<std::size_t NDIM>
◆ nodeT
template<std::size_t NDIM>
◆ treeT
template<std::size_t NDIM>
◆ LoadBalanceDeux()
template<std::size_t NDIM>
◆ add_tree()
template<std::size_t NDIM>
template<typename
T , typename costT >
Accumulates cost from a function.
References madness::f.
Referenced by DF::DF_load_balance(), doit(), madness::SCF::initial_guess(), madness::SCF::initial_load_bal(), initial_loadbal(), iterate(), madness::load_balance(), EmbeddedDirichlet::load_balance(), load_balance(), madness::SCF::loadbal(), loadbal(), loadbal(), loadbal(), main(), madness::SCF::make_fock_matrix(), preloadbal(), run(), test(), and trotter().
◆ compare()
template<std::size_t NDIM>
◆ load_balance()
template<std::size_t NDIM>
Actually does the partitioning of the tree.
References madness::WorldContainer< keyT, valueT, hashfunT >::begin(), madness::WorldGopInterface::broadcast_serializable(), madness::LoadBalanceDeux< NDIM >::compare(), madness::WorldGopInterface::concat0(), madness::LoadBalanceDeux< NDIM >::CostPerProc::cost, madness::WorldContainer< keyT, valueT, hashfunT >::end(), madness::f, madness::WorldGopInterface::fence(), madness::World::gop, madness::WorldContainer< keyT, valueT, hashfunT >::owner(), p(), madness::print(), madness::LoadBalanceDeux< NDIM >::CostPerProc::proc, madness::World::rank(), madness::WorldContainer< keyT, valueT, hashfunT >::send(), madness::World::size(), madness::LoadBalanceDeux< NDIM >::sum(), madness::LoadBalanceDeux< NDIM >::tree, and madness::LoadBalanceDeux< NDIM >::world.
Referenced by DF::DF_load_balance(), doit(), madness::SCF::initial_guess(), madness::SCF::initial_load_bal(), initial_loadbal(), iterate(), madness::load_balance(), EmbeddedDirichlet::load_balance(), load_balance(), madness::SCF::loadbal(), loadbal(), loadbal(), loadbal(), main(), madness::SCF::make_fock_matrix(), preloadbal(), run(), test(), and trotter().
◆ print_tree()
template<std::size_t NDIM>
◆ sum()
template<std::size_t NDIM>
Sums costs up the tree returning to everyone the total cost.
References madness::WorldContainer< keyT, valueT, hashfunT >::begin(), madness::WorldGopInterface::broadcast(), madness::WorldContainer< keyT, valueT, hashfunT >::end(), madness::WorldGopInterface::fence(), madness::WorldContainer< keyT, valueT, hashfunT >::find(), madness::World::gop, madness::WorldContainer< keyT, valueT, hashfunT >::owner(), madness::World::rank(), madness::WorldContainer< keyT, valueT, hashfunT >::task(), madness::LoadBalanceDeux< NDIM >::tree, and madness::LoadBalanceDeux< NDIM >::world.
Referenced by madness::LoadBalanceDeux< NDIM >::load_balance().
◆ tree
template<std::size_t NDIM>
◆ world
template<std::size_t NDIM>
The documentation for this class was generated from the following file: