On Thu, Feb 16, 2012 at 3:38 AM, Mohammad Mirzadeh <span dir="ltr"><<a href="mailto:mirzadeh@gmail.com">mirzadeh@gmail.com</a>></span> wrote:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr">Hi guys,<div><br></div><div>I'm wondering if there is any implementation for ParMETIS_V3_PartGeomKway()? All I can find is the implementation for ParMETIS_V3_PartKway and I'm wondering if including the vertex positions could help me get a better partitioning?</div>
</div></blockquote><div><br></div><div>As far as communication goes, it will not help.</div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">
<div>Also I have a general question. Is minimizing number of edge cuts essentially the same as minimizing communication? I understand that they are related, but communication is proportional to the number of ghost points which is not exactly equal (its actually less than) to the number of edge cuts. So then is it possible that this could actually result in larger number of ghost points, at least for some of processors? </div>
</div></blockquote><div><br></div><div>It of course depends on your problem and the graph you draw, but you can always draw a graph</div><div>where the edge cut is exactly your communication.</div><div><br></div><div> Matt</div>
<div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div>Thanks,</div><div>Mohammad</div></div></blockquote></div>-- <br>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<br>