MueLu Version of the Day
Loading...
Searching...
No Matches
MueLu_OnePtAggregationAlgorithm_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_ONEPTAGGREGATIONALGORITHM_DEF_HPP
47#define MUELU_ONEPTAGGREGATIONALGORITHM_DEF_HPP
48
49#include <Teuchos_Comm.hpp>
50#include <Teuchos_CommHelpers.hpp>
51
52#include <Xpetra_Vector.hpp>
53
54#include "MueLu_OnePtAggregationAlgorithm_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 {
66 }
67
68 template <class LocalOrdinal, class GlobalOrdinal, class Node>
70 BuildAggregates(Teuchos::ParameterList const & /* params */,
71 LWGraph_kokkos const & graph,
72 Aggregates_kokkos & aggregates,
73 Kokkos::View<unsigned*, typename LWGraph_kokkos::device_type>& aggstat,
74 LO& numNonAggregatedNodes) const {
75 Monitor m(*this, "BuildAggregates");
76
77 typename Kokkos::View<unsigned*, device_type>::HostMirror aggstatHost
78 = Kokkos::create_mirror(aggstat);
79 Kokkos::deep_copy(aggstatHost, aggstat);
80 std::vector<unsigned> aggStat;
81 aggStat.resize(aggstatHost.extent(0));
82 for(size_t idx = 0; idx < aggstatHost.extent(0); ++idx) {
83 aggStat[idx] = aggstatHost(idx);
84 }
85
86 const LocalOrdinal nRows = graph.GetNodeNumVertices();
87 const int myRank = graph.GetComm()->getRank();
88
89 // vertex ids for output
90 Teuchos::ArrayRCP<LocalOrdinal> vertex2AggId = aggregates.GetVertex2AggId()->getDataNonConst(0);
91 Teuchos::ArrayRCP<LocalOrdinal> procWinner = aggregates.GetProcWinner()->getDataNonConst(0);
92
93 // some internal variables
94 LocalOrdinal nLocalAggregates = aggregates.GetNumAggregates(); // number of local aggregates on current proc
95 LocalOrdinal iNode1 = 0; // current node
96
97 // main loop over all local rows of graph(A)
98 while (iNode1 < nRows) {
99
100 if (aggStat[iNode1] == ONEPT) {
101
102 aggregates.SetIsRoot(iNode1); // mark iNode1 as root node for new aggregate 'ag'
103 std::vector<int> aggList;
104 aggList.push_back(iNode1);
105 int aggIndex = nLocalAggregates++;
106
107 // finalize aggregate
108 for (size_t k = 0; k < aggList.size(); k++) {
109 aggStat[aggList[k]] = IGNORED;
110 vertex2AggId[aggList[k]] = aggIndex;
111 procWinner[aggList[k]] = myRank;
112 }
113 numNonAggregatedNodes -= aggList.size();
114 }
115
116 iNode1++;
117 } // end while
118
119 for(size_t idx = 0; idx < aggstatHost.extent(0); ++idx) {
120 aggstatHost(idx) = aggStat[idx];
121 }
122 Kokkos::deep_copy(aggstat, aggstatHost);
123
124 // update aggregate object
125 aggregates.SetNumAggregates(nLocalAggregates);
126 }
127
128} // end namespace
129
130#endif // MUELU_ONEPTAGGREGATIONALGORITHM_KOKKOS_DEF_HPP
MueLu::DefaultLocalOrdinal LocalOrdinal
Lightweight MueLu representation of a compressed row storage graph.
Timer to be used in non-factories.
void BuildAggregates(Teuchos::ParameterList const &params, LWGraph_kokkos const &graph, Aggregates_kokkos &aggregates, Kokkos::View< unsigned *, device_type > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
OnePtAggregationAlgorithm_kokkos(RCP< const FactoryBase > const &graphFact=Teuchos::null)
Constructor.
Namespace for MueLu classes and methods.