Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-15 Thread Mark Adams via petsc-dev
> >> I wonder if the their symbolic setup is getting called every time. You do >> 50 solves it looks like and that should be enough to amortize a one time >> setup cost. >> > > Hypre does not have concept called symbolic. They do everything from > scratch, and won't reuse any data. > Really, Hypre

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-15 Thread Mark Adams via petsc-dev
> > So you could reorder your equations and see a block diagonal matrix with >> 576 blocks. right? >> > > I not sure I understand the question correctly. For each mesh vertex, we > have a 576x576 diagonal matrix. The unknowns are ordered in this way: > v0, v2.., v575 for vertex 1, and another 576

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-15 Thread Mark Adams via petsc-dev
On Mon, Apr 15, 2019 at 2:56 PM Fande Kong wrote: > > > On Mon, Apr 15, 2019 at 6:49 AM Matthew Knepley wrote: > >> On Mon, Apr 15, 2019 at 12:41 AM Fande Kong via petsc-dev < >> petsc-dev@mcs.anl.gov> wrote: >> >>> On Fri, Apr 12, 2019 at 7:27 AM Mark Adams wrote: >>> On Thu, Ap

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-15 Thread Mark Adams via petsc-dev
> > > I guess you are interested in the performance of the new algorithms on > small problems. I will try to test a petsc example such as > mat/examples/tests/ex96.c. > It's not a big deal. And the fact that they are similar on one node tells us the kernels are similar. > > >> >> And are you su

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-12 Thread Zhang, Hong via petsc-dev
I would suggest Fande add this new implementation into petsc. What is the algorithm? I'll try to see if I can further reduce memory consumption of the current symbolic PtAP when I get time. Hong On Fri, Apr 12, 2019 at 8:27 AM Mark Adams via petsc-dev mailto:petsc-dev@mcs.anl.gov>> wrote: On

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-12 Thread hong--- via petsc-dev
I would suggest Fande add this new implementation into petsc. What is the algorithm? I'll try to see if I can further reduce memory consumption of the current implementation of symbolic PtAP when I get time. Hong On Fri, Apr 12, 2019 at 8:27 AM Mark Adams via petsc-dev < petsc-dev@mcs.anl.gov> wro

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-12 Thread Mark Adams via petsc-dev
On Thu, Apr 11, 2019 at 11:42 PM Smith, Barry F. wrote: > > > > On Apr 11, 2019, at 9:07 PM, Mark Adams via petsc-dev < > petsc-dev@mcs.anl.gov> wrote: > > > > Interesting, nice work. > > > > It would be interesting to get the flop counters working. > > > > This looks like GMG, I assume 3D. > > >

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-11 Thread Smith, Barry F. via petsc-dev
> On Apr 11, 2019, at 9:07 PM, Mark Adams via petsc-dev > wrote: > > Interesting, nice work. > > It would be interesting to get the flop counters working. > > This looks like GMG, I assume 3D. > > The degree of parallelism is not very realistic. You should probably run a > 10x smaller pro

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-11 Thread Mark Adams via petsc-dev
Interesting, nice work. It would be interesting to get the flop counters working. This looks like GMG, I assume 3D. The degree of parallelism is not very realistic. You should probably run a 10x smaller problem, at least, or use 10x more processes. I guess it does not matter. This basically like

Re: [petsc-dev] New implementation of PtAP based on all-at-once algorithm

2019-04-11 Thread Smith, Barry F. via petsc-dev
Excellent! Thanks Barry > On Apr 11, 2019, at 6:08 PM, Fande Kong via petsc-dev > wrote: > > Hi Developers, > > I just want to share a good news. It is known PETSc-ptap-scalable is taking > too much memory for some applications because it needs to build intermediate > data structur