<div dir="ltr"><div dir="ltr">On Thu, Apr 16, 2020 at 9:28 PM Jacob Faibussowitsch <<a href="mailto:jacob.fai@gmail.com">jacob.fai@gmail.com</a>> wrote:<br></div><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div style="overflow-wrap: break-word;"><div><div dir="auto" style="color:rgb(0,0,0)"><div><blockquote type="cite"><div dir="ltr"><div class="gmail_quote"><div>What do you want to do? </div></div></div></blockquote>Count the global number of points per depth based on all_reduce’ing the maximum positive value returned from the IS’s listed below. This works as intended for anything but cells since global number of points = max(IS) + 1. For cells this breaks since 1 rank reports 3 as max, the next reports 6, etc.</div></div></div></div></blockquote><div><br></div><div>I do not understand this at all. This algorithm does not work for any stratum. For example, suppose that we have a straight line of quad cells,</div><div>1 per process. The vertices would be [1, 5) on all processes but there would be 2*(P + 1) vertices.</div><div><br></div><div> Thanks,</div><div><br></div><div> Matt</div><div> </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div style="overflow-wrap: break-word;"><div><div dir="auto" style="color:rgb(0,0,0)"><div><blockquote type="cite"><div dir="ltr"><div class="gmail_quote"><div> The system should be flexible enough to distribute whatever you want</div></div></div></blockquote>What is the best way to check that a non-standard distribute has been done? </div><div><br></div></div></div><div>
<div dir="auto" style="color:rgb(0,0,0);letter-spacing:normal;text-align:start;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;text-decoration:none"><div>Best regards,<br><br></div><div>Jacob Faibussowitsch<br>(Jacob Fai - booss - oh - vitch)<br>Cell: (312) 694-3391</div></div>
</div>
<div><br><blockquote type="cite"><div>On Apr 16, 2020, at 8:17 PM, Matthew Knepley <<a href="mailto:knepley@gmail.com" target="_blank">knepley@gmail.com</a>> wrote:</div><br><div><div dir="ltr" style="font-family:Helvetica;font-size:12px;font-style:normal;font-variant-caps:normal;font-weight:normal;letter-spacing:normal;text-align:start;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;text-decoration:none"><div dir="ltr">On Thu, Apr 16, 2020 at 9:04 PM Jacob Faibussowitsch <<a href="mailto:jacob.fai@gmail.com" target="_blank">jacob.fai@gmail.com</a>> wrote:<br></div><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div>Hello All,<div><br></div><div>TL;DR: Is it possible now, or is it a planned feature, for plex to distribute over anything but points with height = 0? </div><div><br></div><div>If I understand this correctly when plex currently partitions a graph, points with height 0 are only owned by a single process, but all other points can be co-owned by multiple procs. For example for a 2D plex with 8 vertices, 12 edges, and 6 cells over 2 procs these are the global-local IS’s for all points on processes (negative values indicate ownership by another proc) the final IS corresponding to cells will always have positive values as each proc is the sole owner of its cells.</div></div></blockquote><div><br></div><div>What do you want to do? The system should be flexible enough to distribute whatever you want, but the current guarantee</div><div>is that the cone of any points is always available. So if you decide to distribute something else, like faces, then it ends up</div><div>looking just like an overlapping mesh with some custom overlap. Moreover, the dual mesh only really makes sense for cells.</div><div>For faces/edges you would need a hypergraph partitioner.</div><div><br></div><div> Thanks,</div><div><br></div><div> Matt</div><div> </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div><div><u>VERTICES</u></div>IS Object: 2 MPI processes<br> type: general<br>[0] Number of indices in set 7<br>[0] 0 -2<br>[0] 1 0<br>[0] 2 -3<br>[0] 3 -4<br>[0] 4 -5<br>[0] 5 -6<br>[0] 6 -8<br>[1] Number of indices in set 7<br>[1] 0 1<br>[1] 1 2<br>[1] 2 3<br>[1] 3 4<br>[1] 4 5<br>[1] 5 6<br>[1] 6 7<div><br></div><div><u>EDGES</u><br>IS Object: 2 MPI processes<br> type: general<br>[0] Number of indices in set 9<br>[0] 0 0<br>[0] 1 1<br>[0] 2 -4<br>[0] 3 -5<br>[0] 4 -6<br>[0] 5 2<br>[0] 6 -7<br>[0] 7 -9<br>[0] 8 -11<br>[1] Number of indices in set 9<br>[1] 0 3<br>[1] 1 4<br>[1] 2 5<br>[1] 3 6<br>[1] 4 7<br>[1] 5 8<br>[1] 6 9<br>[1] 7 10<br>[1] 8 11</div><div><br></div><div><u>CELLS</u><br>IS Object: 2 MPI processes<br> type: general<br>[0] Number of indices in set 3<br>[0] 0 0<br>[0] 1 1<br>[0] 2 2<br>[1] Number of indices in set 3<br>[1] 0 3<br>[1] 1 4<br><div>[1] 2 5 </div><div><br><div><div dir="auto" style="letter-spacing:normal;text-align:start;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;text-decoration:none"><div>Best regards,<br><br>Jacob Faibussowitsch<br>(Jacob Fai - booss - oh - vitch)<br>Cell: (312) 694-3391</div></div></div><br></div></div></div></blockquote></div><br clear="all"><div><br></div>--<span> </span><br><div dir="ltr"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div>What most experimenters take for granted before they begin their experiments is infinitely more interesting than any results to which their experiments lead.<br>-- Norbert Wiener</div><div><br></div><div><a href="http://www.cse.buffalo.edu/~knepley/" target="_blank">https://www.cse.buffalo.edu/~knepley/</a></div></div></div></div></div></div></div></div></div></blockquote></div><br></div></blockquote></div><br clear="all"><div><br></div>-- <br><div dir="ltr" class="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div>What most experimenters take for granted before they begin their experiments is infinitely more interesting than any results to which their experiments lead.<br>-- Norbert Wiener</div><div><br></div><div><a href="http://www.cse.buffalo.edu/~knepley/" target="_blank">https://www.cse.buffalo.edu/~knepley/</a><br></div></div></div></div></div></div></div></div>