/usr/include/spooles/MT/spoolesMT.h is in libspooles-dev 2.2-10build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 | /* spoolesMT.h */
#include "../FrontMtx.h"
#include "../Lock.h"
/*--------------------------------------------------------------------*/
/*
-------------------------------------------------------------------
parallel factorization method for A.
all but two input parameters are the same as the serial method.
this is a wrapper method around FrontMtx_MT_factorInpMtx().
ownersIV -- pointer to IV object that holds map from fronts
to threads
lookahead -- lookahead parameter that allows computation at
higher levels of the front tree to proceed when
lower fronts are not yet finish. use lookahead = 0
to turn off this option. otherwise lookahead ancestors
of an active unfinished front can be active.
return value -- pointer to the first Chv object in a list
that contains postponed data
created -- 98may16, cca
-------------------------------------------------------------------
*/
Chv *
FrontMtx_MT_factorInpMtx (
FrontMtx *frontmtx,
InpMtx *inpmtx,
double tau,
double droptol,
ChvManager *chvmanager,
IV *ownersIV,
int lookahead,
int *perror,
double cpus[],
int stats[],
int msglvl,
FILE *msgFile
) ;
/*
-------------------------------------------------------------------
parallel factorization method for A + sigma*B.
all but two input parameters are the same
as the FrontMtx_factorPencil method.
ownersIV -- pointer to IV object that holds map from fronts
to threads
lookahead -- lookahead parameter that allows computation at
higher levels of the front tree to proceed when
lower fronts are not yet finish. use lookahead = 0
to turn off this option. otherwise lookahead ancestors
of an active unfinished front can be active.
return value -- pointer to the first Chv object in a list
that contains postponed data
created -- 98may16, cca
-------------------------------------------------------------------
*/
Chv *
FrontMtx_MT_factorPencil (
FrontMtx *frontmtx,
Pencil *pencil,
double tau,
double droptol,
ChvManager *chvmanager,
IV *ownersIV,
int lookahead,
int *perror,
double cpus[],
int stats[],
int msglvl,
FILE *msgFile
) ;
/*
----------------------------------------------------
multithreaded solve method for (L + I)D(I + U) X = B
or (U^T + I)D(I + U) X = B.
created -- 98mar19, cca
----------------------------------------------------
*/
void
FrontMtx_MT_solve (
FrontMtx *frontmtx,
DenseMtx *solmtx,
DenseMtx *rhsmtx,
SubMtxManager *mtxmanager,
SolveMap *solvemap,
double cpus[],
int msglvl,
FILE *msgFile
) ;
/*
------------------------------------------------------------
purpose -- compute a QR factorization using multiple threads
created -- 98may29, cca
------------------------------------------------------------
*/
void
FrontMtx_MT_QR_factor (
FrontMtx *frontmtx,
InpMtx *mtxA,
ChvManager *chvmanager,
IV *ownersIV,
double cpus[],
double *pfacops,
int msglvl,
FILE *msgFile
) ;
/*
--------------------------------------------------------
multithreaded version:
minimize ||b - Ax||_2 by
solving (U^T + I) * D * (I + U) X = A^T * B
where A = QR = QD(I + U)
by calling FrontMtx_solve()
note: if A is square, mtxX and mtxB must not be the same
cpus -- vector of cpu time breakdowns
cpus[0] -- set up solves
cpus[1] -- fetch rhs and store solution
cpus[2] -- forward solve
cpus[3] -- diagonal solve
cpus[4] -- backward solve
cpus[5] -- total solve time
cpus[6] -- time to compute A^T * B
cpus[7] -- total time
created -- 98may30, cca
--------------------------------------------------------
*/
void
FrontMtx_MT_QR_solve (
FrontMtx *frontmtx,
InpMtx *mtxA,
DenseMtx *mtxX,
DenseMtx *mtxB,
SubMtxManager *mtxmanager,
SolveMap *solvemap,
double cpus[],
int msglvl,
FILE *msgFile
) ;
/*--------------------------------------------------------------------*/
/*
----------------------------------------
purpose -- to compute Y := Y + alpha*A*X
created -- 98may02, cca
----------------------------------------
*/
void
InpMtx_MT_nonsym_mmm (
InpMtx *A,
DenseMtx *Y,
double alpha[],
DenseMtx *X,
int nthread,
int msglvl,
FILE *msgFile
) ;
/*
----------------------------------------
purpose -- to compute Y := Y + alpha*A*X
created -- 98jul09, cca
----------------------------------------
*/
void
InpMtx_MT_sym_mmm (
InpMtx *A,
DenseMtx *Y,
double alpha[],
DenseMtx *X,
int nthread,
int msglvl,
FILE *msgFile
) ;
/*
----------------------------------------
purpose -- to compute Y := Y + alpha*A*X
created -- 98jul09, cca
----------------------------------------
*/
void
InpMtx_MT_herm_mmm (
InpMtx *A,
DenseMtx *Y,
double alpha[],
DenseMtx *X,
int nthread,
int msglvl,
FILE *msgFile
) ;
/*
----------------------------------------
purpose -- to compute Y := Y + alpha*A*X
created -- 98jul09, cca
----------------------------------------
*/
void
InpMtx_MT_nonsym_mmm_T (
InpMtx *A,
DenseMtx *Y,
double alpha[],
DenseMtx *X,
int nthread,
int msglvl,
FILE *msgFile
) ;
/*
----------------------------------------
purpose -- to compute Y := Y + alpha*A*X
created -- 98jul09, cca
----------------------------------------
*/
void
InpMtx_MT_nonsym_mmm_H (
InpMtx *A,
DenseMtx *Y,
double alpha[],
DenseMtx *X,
int nthread,
int msglvl,
FILE *msgFile
) ;
/*--------------------------------------------------------------------*/
|