1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/*
* mutil.c
*
* This file contains various utility functions for the MOC portion of the
* code
*
* Started 2/15/98
* George
*
* $Id: mutil.c,v 1.1 2003/07/16 15:55:13 karypis Exp $
*
*/
#include <metis.h>
/*************************************************************************
* This function checks if the vertex weights of two vertices are below
* a given set of values
**************************************************************************/
int AreAllVwgtsBelow(int ncon, float alpha, float *vwgt1, float beta, float *vwgt2, float limit)
{
int i;
for (i=0; i<ncon; i++)
if (alpha*vwgt1[i] + beta*vwgt2[i] > limit)
return 0;
return 1;
}
/*************************************************************************
* This function checks if the vertex weights of two vertices are below
* a given set of values
**************************************************************************/
int AreAnyVwgtsBelow(int ncon, float alpha, float *vwgt1, float beta, float *vwgt2, float limit)
{
int i;
for (i=0; i<ncon; i++)
if (alpha*vwgt1[i] + beta*vwgt2[i] < limit)
return 1;
return 0;
}
/*************************************************************************
* This function checks if the vertex weights of two vertices are above
* a given set of values
**************************************************************************/
int AreAllVwgtsAbove(int ncon, float alpha, float *vwgt1, float beta, float *vwgt2, float limit)
{
int i;
for (i=0; i<ncon; i++)
if (alpha*vwgt1[i] + beta*vwgt2[i] < limit)
return 0;
return 1;
}
/*************************************************************************
* This function computes the load imbalance over all the constrains
* For now assume that we just want balanced partitionings
**************************************************************************/
float ComputeLoadImbalance(int ncon, int nparts, float *npwgts, float *tpwgts)
{
int i, j;
float max, lb=0.0;
for (i=0; i<ncon; i++) {
max = 0.0;
for (j=0; j<nparts; j++) {
if (npwgts[j*ncon+i] > max)
max = npwgts[j*ncon+i];
}
if (max*nparts > lb)
lb = max*nparts;
}
return lb;
}
/*************************************************************************
* This function checks if the vertex weights of two vertices are below
* a given set of values
**************************************************************************/
int AreAllBelow(int ncon, float *v1, float *v2)
{
int i;
for (i=0; i<ncon; i++)
if (v1[i] > v2[i])
return 0;
return 1;
}
|
