mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
318 lines
10 KiB
C
318 lines
10 KiB
C
/*
|
|
* Copyright 1997, Regents of the University of Minnesota
|
|
*
|
|
* stat.c
|
|
*
|
|
* This file computes various statistics
|
|
*
|
|
* Started 7/25/97
|
|
* George
|
|
*
|
|
* $Id: stat.c,v 1.2 2002/08/10 06:29:34 karypis Exp $
|
|
*
|
|
*/
|
|
|
|
#include <metislib.h>
|
|
|
|
|
|
/*************************************************************************
|
|
* This function computes cuts and balance information
|
|
**************************************************************************/
|
|
void ComputePartitionInfo(GraphType *graph, idxtype nparts, idxtype *where)
|
|
{
|
|
idxtype i, j, k, nvtxs, ncon, mustfree=0;
|
|
idxtype *xadj, *adjncy, *vwgt, *adjwgt, *kpwgts, *tmpptr;
|
|
idxtype *padjncy, *padjwgt, *padjcut;
|
|
|
|
nvtxs = graph->nvtxs;
|
|
ncon = graph->ncon;
|
|
xadj = graph->xadj;
|
|
adjncy = graph->adjncy;
|
|
vwgt = graph->vwgt;
|
|
adjwgt = graph->adjwgt;
|
|
|
|
if (vwgt == NULL) {
|
|
vwgt = graph->vwgt = idxsmalloc(nvtxs, 1, "vwgt");
|
|
mustfree = 1;
|
|
}
|
|
if (adjwgt == NULL) {
|
|
adjwgt = graph->adjwgt = idxsmalloc(xadj[nvtxs], 1, "adjwgt");
|
|
mustfree += 2;
|
|
}
|
|
|
|
mprintf("%D-way Cut: %5D, Vol: %5D, ", nparts, ComputeCut(graph, where), ComputeVolume(graph, where));
|
|
|
|
/* Compute balance information */
|
|
kpwgts = idxsmalloc(ncon*nparts, 0, "ComputePartitionInfo: kpwgts");
|
|
|
|
for (i=0; i<nvtxs; i++) {
|
|
for (j=0; j<ncon; j++)
|
|
kpwgts[where[i]*ncon+j] += vwgt[i*ncon+j];
|
|
}
|
|
|
|
if (ncon == 1) {
|
|
mprintf("\tBalance: %5.3f out of %5.3f\n",
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)),
|
|
1.0*nparts*vwgt[idxargmax(nvtxs, vwgt)]/(1.0*idxsum(nparts, kpwgts, 1)));
|
|
}
|
|
else {
|
|
mprintf("\tBalance:");
|
|
for (j=0; j<ncon; j++)
|
|
mprintf(" (%5.3f out of %5.3f)",
|
|
1.0*nparts*kpwgts[ncon*idxargmax_strd(nparts, kpwgts+j, ncon)+j]/(1.0*idxsum(nparts, kpwgts+j, ncon)),
|
|
1.0*nparts*vwgt[ncon*idxargmax_strd(nvtxs, vwgt+j, ncon)+j]/(1.0*idxsum(nparts, kpwgts+j, ncon)));
|
|
mprintf("\n");
|
|
}
|
|
|
|
|
|
/* Compute p-adjncy information */
|
|
padjncy = idxsmalloc(nparts*nparts, 0, "ComputePartitionInfo: padjncy");
|
|
padjwgt = idxsmalloc(nparts*nparts, 0, "ComputePartitionInfo: padjwgt");
|
|
padjcut = idxsmalloc(nparts*nparts, 0, "ComputePartitionInfo: padjwgt");
|
|
|
|
idxset(nparts, 0, kpwgts);
|
|
for (i=0; i<nvtxs; i++) {
|
|
for (j=xadj[i]; j<xadj[i+1]; j++) {
|
|
if (where[i] != where[adjncy[j]]) {
|
|
padjncy[where[i]*nparts+where[adjncy[j]]] = 1;
|
|
padjcut[where[i]*nparts+where[adjncy[j]]] += adjwgt[j];
|
|
if (kpwgts[where[adjncy[j]]] == 0) {
|
|
padjwgt[where[i]*nparts+where[adjncy[j]]]++;
|
|
kpwgts[where[adjncy[j]]] = 1;
|
|
}
|
|
}
|
|
}
|
|
for (j=xadj[i]; j<xadj[i+1]; j++)
|
|
kpwgts[where[adjncy[j]]] = 0;
|
|
}
|
|
|
|
for (i=0; i<nparts; i++)
|
|
kpwgts[i] = idxsum(nparts, padjncy+i*nparts, 1);
|
|
mprintf("Min/Max/Avg/Bal # of adjacent subdomains: %5D %5D %5.2f %7.3f\n",
|
|
kpwgts[idxargmin(nparts, kpwgts)], kpwgts[idxargmax(nparts, kpwgts)],
|
|
1.0*idxsum(nparts, kpwgts, 1)/(1.0*nparts),
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)));
|
|
|
|
for (i=0; i<nparts; i++)
|
|
kpwgts[i] = idxsum(nparts, padjcut+i*nparts, 1);
|
|
mprintf("Min/Max/Avg/Bal # of adjacent subdomain cuts: %5D %5D %5D %7.3f\n",
|
|
kpwgts[idxargmin(nparts, kpwgts)], kpwgts[idxargmax(nparts, kpwgts)], idxsum(nparts, kpwgts, 1)/nparts,
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)));
|
|
|
|
for (i=0; i<nparts; i++)
|
|
kpwgts[i] = idxsum(nparts, padjwgt+i*nparts, 1);
|
|
mprintf("Min/Max/Avg/Bal/Frac # of interface nodes: %5D %5D %5D %7.3f %7.3f\n",
|
|
kpwgts[idxargmin(nparts, kpwgts)], kpwgts[idxargmax(nparts, kpwgts)], idxsum(nparts, kpwgts, 1)/nparts,
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)), 1.0*idxsum(nparts, kpwgts, 1)/(1.0*nvtxs));
|
|
|
|
tmpptr = graph->where;
|
|
graph->where = where;
|
|
for (i=0; i<nparts; i++)
|
|
IsConnectedSubdomain(NULL, graph, i, 1);
|
|
graph->where = tmpptr;
|
|
|
|
if (mustfree == 1 || mustfree == 3) {
|
|
gk_free((void **)&vwgt, LTERM);
|
|
graph->vwgt = NULL;
|
|
}
|
|
if (mustfree == 2 || mustfree == 3) {
|
|
gk_free((void **)&adjwgt, LTERM);
|
|
graph->adjwgt = NULL;
|
|
}
|
|
|
|
gk_free((void **)&kpwgts, &padjncy, &padjwgt, &padjcut, LTERM);
|
|
}
|
|
|
|
|
|
/*************************************************************************
|
|
* This function computes cuts and balance information
|
|
**************************************************************************/
|
|
void ComputePartitionInfoBipartite(GraphType *graph, idxtype nparts, idxtype *where)
|
|
{
|
|
idxtype i, j, k, nvtxs, ncon, mustfree=0;
|
|
idxtype *xadj, *adjncy, *vwgt, *vsize, *adjwgt, *kpwgts, *tmpptr;
|
|
idxtype *padjncy, *padjwgt, *padjcut;
|
|
|
|
nvtxs = graph->nvtxs;
|
|
ncon = graph->ncon;
|
|
xadj = graph->xadj;
|
|
adjncy = graph->adjncy;
|
|
vwgt = graph->vwgt;
|
|
vsize = graph->vsize;
|
|
adjwgt = graph->adjwgt;
|
|
|
|
if (vwgt == NULL) {
|
|
vwgt = graph->vwgt = idxsmalloc(nvtxs, 1, "vwgt");
|
|
mustfree = 1;
|
|
}
|
|
if (adjwgt == NULL) {
|
|
adjwgt = graph->adjwgt = idxsmalloc(xadj[nvtxs], 1, "adjwgt");
|
|
mustfree += 2;
|
|
}
|
|
|
|
mprintf("%D-way Cut: %5D, Vol: %5D, ", nparts, ComputeCut(graph, where), ComputeVolume(graph, where));
|
|
|
|
/* Compute balance information */
|
|
kpwgts = idxsmalloc(ncon*nparts, 0, "ComputePartitionInfo: kpwgts");
|
|
|
|
for (i=0; i<nvtxs; i++) {
|
|
for (j=0; j<ncon; j++)
|
|
kpwgts[where[i]*ncon+j] += vwgt[i*ncon+j];
|
|
}
|
|
|
|
if (ncon == 1) {
|
|
mprintf("\tBalance: %5.3f out of %5.3f\n",
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)),
|
|
1.0*nparts*vwgt[idxargmax(nvtxs, vwgt)]/(1.0*idxsum(nparts, kpwgts, 1)));
|
|
}
|
|
else {
|
|
mprintf("\tBalance:");
|
|
for (j=0; j<ncon; j++)
|
|
mprintf(" (%5.3f out of %5.3f)",
|
|
1.0*nparts*kpwgts[ncon*idxargmax_strd(nparts, kpwgts+j, ncon)+j]/(1.0*idxsum(nparts, kpwgts+j, ncon)),
|
|
1.0*nparts*vwgt[ncon*idxargmax_strd(nvtxs, vwgt+j, ncon)+j]/(1.0*idxsum(nparts, kpwgts+j, ncon)));
|
|
mprintf("\n");
|
|
}
|
|
|
|
|
|
/* Compute p-adjncy information */
|
|
padjncy = idxsmalloc(nparts*nparts, 0, "ComputePartitionInfo: padjncy");
|
|
padjwgt = idxsmalloc(nparts*nparts, 0, "ComputePartitionInfo: padjwgt");
|
|
padjcut = idxsmalloc(nparts*nparts, 0, "ComputePartitionInfo: padjwgt");
|
|
|
|
idxset(nparts, 0, kpwgts);
|
|
for (i=0; i<nvtxs; i++) {
|
|
for (j=xadj[i]; j<xadj[i+1]; j++) {
|
|
if (where[i] != where[adjncy[j]]) {
|
|
padjncy[where[i]*nparts+where[adjncy[j]]] = 1;
|
|
padjcut[where[i]*nparts+where[adjncy[j]]] += adjwgt[j];
|
|
if (kpwgts[where[adjncy[j]]] == 0) {
|
|
padjwgt[where[i]*nparts+where[adjncy[j]]] += vsize[i];
|
|
kpwgts[where[adjncy[j]]] = 1;
|
|
}
|
|
}
|
|
}
|
|
for (j=xadj[i]; j<xadj[i+1]; j++)
|
|
kpwgts[where[adjncy[j]]] = 0;
|
|
}
|
|
|
|
for (i=0; i<nparts; i++)
|
|
kpwgts[i] = idxsum(nparts, padjncy+i*nparts, 1);
|
|
mprintf("Min/Max/Avg/Bal # of adjacent subdomains: %5D %5D %5D %7.3f\n",
|
|
kpwgts[idxargmin(nparts, kpwgts)], kpwgts[idxargmax(nparts, kpwgts)], idxsum(nparts, kpwgts, 1)/nparts,
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)));
|
|
|
|
for (i=0; i<nparts; i++)
|
|
kpwgts[i] = idxsum(nparts, padjcut+i*nparts, 1);
|
|
mprintf("Min/Max/Avg/Bal # of adjacent subdomain cuts: %5D %5D %5D %7.3f\n",
|
|
kpwgts[idxargmin(nparts, kpwgts)], kpwgts[idxargmax(nparts, kpwgts)], idxsum(nparts, kpwgts, 1)/nparts,
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)));
|
|
|
|
for (i=0; i<nparts; i++)
|
|
kpwgts[i] = idxsum(nparts, padjwgt+i*nparts, 1);
|
|
mprintf("Min/Max/Avg/Bal/Frac # of interface nodes: %5D %5D %5D %7.3f %7.3f\n",
|
|
kpwgts[idxargmin(nparts, kpwgts)], kpwgts[idxargmax(nparts, kpwgts)], idxsum(nparts, kpwgts, 1)/nparts,
|
|
1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1)), 1.0*idxsum(nparts, kpwgts, 1)/(1.0*nvtxs));
|
|
|
|
|
|
if (mustfree == 1 || mustfree == 3) {
|
|
gk_free((void **)&vwgt, LTERM);
|
|
graph->vwgt = NULL;
|
|
}
|
|
if (mustfree == 2 || mustfree == 3) {
|
|
gk_free((void **)&adjwgt, LTERM);
|
|
graph->adjwgt = NULL;
|
|
}
|
|
|
|
gk_free((void **)&kpwgts, &padjncy, &padjwgt, &padjcut, LTERM);
|
|
}
|
|
|
|
|
|
|
|
/*************************************************************************
|
|
* This function computes the balance of the partitioning
|
|
**************************************************************************/
|
|
void ComputePartitionBalance(GraphType *graph, idxtype nparts, idxtype *where, float *ubvec)
|
|
{
|
|
idxtype i, j, nvtxs, ncon;
|
|
idxtype *kpwgts, *vwgt;
|
|
float balance;
|
|
|
|
nvtxs = graph->nvtxs;
|
|
ncon = graph->ncon;
|
|
vwgt = graph->vwgt;
|
|
|
|
kpwgts = idxsmalloc(nparts, 0, "ComputePartitionInfo: kpwgts");
|
|
|
|
if (vwgt == NULL) {
|
|
for (i=0; i<nvtxs; i++)
|
|
kpwgts[where[i]]++;
|
|
ubvec[0] = 1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*nvtxs);
|
|
}
|
|
else {
|
|
for (j=0; j<ncon; j++) {
|
|
idxset(nparts, 0, kpwgts);
|
|
for (i=0; i<graph->nvtxs; i++)
|
|
kpwgts[where[i]] += vwgt[i*ncon+j];
|
|
|
|
ubvec[j] = 1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1));
|
|
}
|
|
}
|
|
|
|
gk_free((void **)&kpwgts, LTERM);
|
|
|
|
}
|
|
|
|
|
|
/*************************************************************************
|
|
* This function computes the balance of the element partitioning
|
|
**************************************************************************/
|
|
float ComputeElementBalance(idxtype ne, idxtype nparts, idxtype *where)
|
|
{
|
|
idxtype i;
|
|
idxtype *kpwgts;
|
|
float balance;
|
|
|
|
kpwgts = idxsmalloc(nparts, 0, "ComputeElementBalance: kpwgts");
|
|
|
|
for (i=0; i<ne; i++)
|
|
kpwgts[where[i]]++;
|
|
|
|
balance = 1.0*nparts*kpwgts[idxargmax(nparts, kpwgts)]/(1.0*idxsum(nparts, kpwgts, 1));
|
|
|
|
gk_free((void **)&kpwgts, LTERM);
|
|
|
|
return balance;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*************************************************************************
|
|
* This function computes the balance of the partitioning
|
|
**************************************************************************/
|
|
void Moc_ComputePartitionBalance(GraphType *graph, idxtype nparts, idxtype *where, float *ubvec)
|
|
{
|
|
idxtype i, j, nvtxs, ncon;
|
|
float *kpwgts, *nvwgt;
|
|
float balance;
|
|
|
|
nvtxs = graph->nvtxs;
|
|
ncon = graph->ncon;
|
|
nvwgt = graph->nvwgt;
|
|
|
|
kpwgts = gk_fmalloc(nparts, "ComputePartitionInfo: kpwgts");
|
|
|
|
for (j=0; j<ncon; j++) {
|
|
gk_fset(nparts, 0.0, kpwgts);
|
|
for (i=0; i<graph->nvtxs; i++)
|
|
kpwgts[where[i]] += nvwgt[i*ncon+j];
|
|
|
|
ubvec[j] = (float)nparts*kpwgts[gk_fargmax(nparts, kpwgts)]/gk_fsum(nparts, kpwgts, 1);
|
|
}
|
|
|
|
gk_free((void **)&kpwgts, LTERM);
|
|
|
|
}
|
|
|