MueLu Version of the Day
Loading...
Searching...
No Matches
MueLu_PreserveDirichletAggregationAlgorithm_kokkos_def.hpp
Go to the documentation of this file.
1// @HEADER
2//
3// ***********************************************************************
4//
5// MueLu: A package for multigrid based preconditioning
6// Copyright 2012 Sandia Corporation
7//
8// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9// the U.S. Government retains certain rights in this software.
10//
11// Redistribution and use in source and binary forms, with or without
12// modification, are permitted provided that the following conditions are
13// met:
14//
15// 1. Redistributions of source code must retain the above copyright
16// notice, this list of conditions and the following disclaimer.
17//
18// 2. Redistributions in binary form must reproduce the above copyright
19// notice, this list of conditions and the following disclaimer in the
20// documentation and/or other materials provided with the distribution.
21//
22// 3. Neither the name of the Corporation nor the names of the
23// contributors may be used to endorse or promote products derived from
24// this software without specific prior written permission.
25//
26// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37//
38// Questions? Contact
39// Jonathan Hu (jhu@sandia.gov)
40// Andrey Prokopenko (aprokop@sandia.gov)
41// Ray Tuminaro (rstumin@sandia.gov)
42//
43// ***********************************************************************
44//
45// @HEADER
46#ifndef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_DEF_HPP
47#define MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_DEF_HPP
48
49#include <Teuchos_Comm.hpp>
50#include <Teuchos_CommHelpers.hpp>
51
52#include <Xpetra_Vector.hpp>
53
54#include "MueLu_PreserveDirichletAggregationAlgorithm_kokkos.hpp"
55
56#include "MueLu_LWGraph_kokkos.hpp"
57#include "MueLu_Aggregates_kokkos.hpp"
58#include "MueLu_Exceptions.hpp"
59#include "MueLu_Monitor.hpp"
60
61namespace MueLu {
62
63 template <class LocalOrdinal, class GlobalOrdinal, class Node>
65 BuildAggregates(Teuchos::ParameterList const & params,
66 LWGraph_kokkos const & graph,
67 Aggregates_kokkos & aggregates,
68 Kokkos::View<unsigned*, typename LWGraph_kokkos::device_type>& aggStat,
69 LO& numNonAggregatedNodes) const {
70 Monitor m(*this, "BuildAggregates");
71 using local_ordinal_type = typename LWGraph_kokkos::local_ordinal_type;
72
73 // Extract parameters and data from:
74 // 1) the parameter list
75 const bool preserve = params.get<bool>("aggregation: preserve Dirichlet points");
76
77 // 2) the amalgamated graph
78 const LO numNodes = graph.GetNodeNumVertices();
79 const int myRank = graph.GetComm()->getRank();
80
81 // 3) the aggregates
82 auto vertex2AggId = aggregates.GetVertex2AggId()->getDeviceLocalView(Xpetra::Access::ReadWrite);
83 auto procWinner = aggregates.GetProcWinner() ->getDeviceLocalView(Xpetra::Access::ReadWrite);
84
85 // A view is needed to count on the fly the current number of local aggregates
86 Kokkos::View<LO, device_type> aggCount("aggCount");
87 if(preserve) {
88 Kokkos::deep_copy(aggCount, aggregates.GetNumAggregates());
89 }
90 Kokkos::parallel_for("MueLu - PreserveDirichlet: tagging ignored nodes",
91 Kokkos::RangePolicy<local_ordinal_type, execution_space>(0, numNodes),
92 KOKKOS_LAMBDA(const local_ordinal_type nodeIdx) {
93 if (aggStat(nodeIdx) == BOUNDARY) {
94 aggStat(nodeIdx) = IGNORED;
95 const LO aggIdx = Kokkos::atomic_fetch_add(&aggCount(), 1);
96
97 if (preserve) {
98 // aggregates.SetIsRoot(nodeIdx);
99
100 vertex2AggId(nodeIdx, 0) = aggIdx;
101 procWinner(nodeIdx, 0) = myRank;
102 }
103 }
104 });
105 typename Kokkos::View<LO, device_type>::HostMirror aggCount_h
106 = Kokkos::create_mirror_view(aggCount);
107 Kokkos::deep_copy(aggCount_h, aggCount);
108 // In this phase the number of new aggregates is the same
109 // as the number of newly aggregated nodes.
110 numNonAggregatedNodes -= (aggCount_h() - aggregates.GetNumAggregates());
111
112 // update aggregate object
113 if(preserve) {
114 aggregates.SetNumAggregates(aggCount_h());
115 }
116 }
117
118} // end namespace
119
120#endif // MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_DEF_HPP
Lightweight MueLu representation of a compressed row storage graph.
Timer to be used in non-factories.
void BuildAggregates(const Teuchos::ParameterList &params, const LWGraph_kokkos &graph, Aggregates_kokkos &aggregates, Kokkos::View< unsigned *, device_type > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
Namespace for MueLu classes and methods.
@ BOUNDARY
Definition: MueLu_Types.hpp:82