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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
|
/* ---------------------------------------------------------------------
*
* -- PBLAS routine (version 2.0) --
* University of Tennessee, Knoxville, Oak Ridge National Laboratory,
* and University of California, Berkeley.
* April 1, 1998
*
* ---------------------------------------------------------------------
*/
/*
* Include files
*/
#include "pblas.h"
#include "PBpblas.h"
#include "PBtools.h"
#include "PBblacs.h"
#include "PBblas.h"
#ifdef __STDC__
void psasum_( Int * N, float * ASUM,
float * X, Int * IX, Int * JX, Int * DESCX, Int * INCX )
#else
void psasum_( N, ASUM, X, IX, JX, DESCX, INCX )
/*
* .. Scalar Arguments ..
*/
Int * INCX, * IX, * JX, * N;
float * ASUM;
/*
* .. Array Arguments ..
*/
Int * DESCX;
float * X;
#endif
{
/*
* Purpose
* =======
*
* PSASUM returns the sum of absolute values of the entries of a subvec-
* tor sub( X ),
*
* where
*
* sub( X ) denotes X(IX,JX:JX+N-1) if INCX = M_X,
* X(IX:IX+N-1,JX) if INCX = 1 and INCX <> M_X.
*
* Notes
* =====
*
* A description vector is associated with each 2D block-cyclicly dis-
* tributed matrix. This vector stores the information required to
* establish the mapping between a matrix entry and its corresponding
* process and memory location.
*
* In the following comments, the character _ should be read as
* "of the distributed matrix". Let A be a generic term for any 2D
* block cyclicly distributed matrix. Its description vector is DESC_A:
*
* NOTATION STORED IN EXPLANATION
* ---------------- --------------- ------------------------------------
* DTYPE_A (global) DESCA[ DTYPE_ ] The descriptor type.
* CTXT_A (global) DESCA[ CTXT_ ] The BLACS context handle, indicating
* the NPROW x NPCOL BLACS process grid
* A is distributed over. The context
* itself is global, but the handle
* (the integer value) may vary.
* M_A (global) DESCA[ M_ ] The number of rows in the distribu-
* ted matrix A, M_A >= 0.
* N_A (global) DESCA[ N_ ] The number of columns in the distri-
* buted matrix A, N_A >= 0.
* IMB_A (global) DESCA[ IMB_ ] The number of rows of the upper left
* block of the matrix A, IMB_A > 0.
* INB_A (global) DESCA[ INB_ ] The number of columns of the upper
* left block of the matrix A,
* INB_A > 0.
* MB_A (global) DESCA[ MB_ ] The blocking factor used to distri-
* bute the last M_A-IMB_A rows of A,
* MB_A > 0.
* NB_A (global) DESCA[ NB_ ] The blocking factor used to distri-
* bute the last N_A-INB_A columns of
* A, NB_A > 0.
* RSRC_A (global) DESCA[ RSRC_ ] The process row over which the first
* row of the matrix A is distributed,
* NPROW > RSRC_A >= 0.
* CSRC_A (global) DESCA[ CSRC_ ] The process column over which the
* first column of A is distributed.
* NPCOL > CSRC_A >= 0.
* LLD_A (local) DESCA[ LLD_ ] The leading dimension of the local
* array storing the local blocks of
* the distributed matrix A,
* IF( Lc( 1, N_A ) > 0 )
* LLD_A >= MAX( 1, Lr( 1, M_A ) )
* ELSE
* LLD_A >= 1.
*
* Let K be the number of rows of a matrix A starting at the global in-
* dex IA,i.e, A( IA:IA+K-1, : ). Lr( IA, K ) denotes the number of rows
* that the process of row coordinate MYROW ( 0 <= MYROW < NPROW ) would
* receive if these K rows were distributed over NPROW processes. If K
* is the number of columns of a matrix A starting at the global index
* JA, i.e, A( :, JA:JA+K-1, : ), Lc( JA, K ) denotes the number of co-
* lumns that the process MYCOL ( 0 <= MYCOL < NPCOL ) would receive if
* these K columns were distributed over NPCOL processes.
*
* The values of Lr() and Lc() may be determined via a call to the func-
* tion PB_Cnumroc:
* Lr( IA, K ) = PB_Cnumroc( K, IA, IMB_A, MB_A, MYROW, RSRC_A, NPROW )
* Lc( JA, K ) = PB_Cnumroc( K, JA, INB_A, NB_A, MYCOL, CSRC_A, NPCOL )
*
* Arguments
* =========
*
* N (global input) INTEGER
* On entry, N specifies the length of the subvector sub( X ).
* N must be at least zero.
*
* ASUM (local output) REAL
* On exit, ASUM specifies the sum of absolute values of the
* subvector sub( X ) only in its scope (See below for further
* details).
*
* X (local input) REAL array
* On entry, X is an array of dimension (LLD_X, Kx), where LLD_X
* is at least MAX( 1, Lr( 1, IX ) ) when INCX = M_X and
* MAX( 1, Lr( 1, IX+N-1 ) ) otherwise, and, Kx is at least
* Lc( 1, JX+N-1 ) when INCX = M_X and Lc( 1, JX ) otherwise.
* Before entry, this array contains the local entries of the
* matrix X.
*
* IX (global input) INTEGER
* On entry, IX specifies X's global row index, which points to
* the beginning of the submatrix sub( X ).
*
* JX (global input) INTEGER
* On entry, JX specifies X's global column index, which points
* to the beginning of the submatrix sub( X ).
*
* DESCX (global and local input) INTEGER array
* On entry, DESCX is an integer array of dimension DLEN_. This
* is the array descriptor for the matrix X.
*
* INCX (global input) INTEGER
* On entry, INCX specifies the global increment for the
* elements of X. Only two values of INCX are supported in
* this version, namely 1 and M_X. INCX must not be zero.
*
* Further Details
* ===============
*
* When the result of a vector-oriented PBLAS call is a scalar, this
* scalar is set only within the process scope which owns the vector(s)
* being operated on. Let sub( X ) be a generic term for the input vec-
* tor(s). Then, the processes owning the correct the answer is determi-
* ned as follows: if an operation involves more than one vector, the
* processes receiving the result will be the union of the following set
* of processes for each vector:
*
* If N = 1, M_X = 1 and INCX = 1, then one cannot determine if a pro-
* cess row or process column owns the vector operand, therefore only
* the process owning sub( X ) receives the correct result;
*
* If INCX = M_X, then sub( X ) is a vector distributed over a process
* row. Each process in this row receives the result;
*
* If INCX = 1, then sub( X ) is a vector distributed over a process
* column. Each process in this column receives the result;
*
* -- Written on April 1, 1998 by
* Antoine Petitet, University of Tennessee, Knoxville 37996, USA.
*
* ---------------------------------------------------------------------
*/
/*
* .. Local Scalars ..
*/
char top;
Int Xcol, Xi, Xii, Xj, Xjj, Xld, Xnp, Xnq, Xrow, ctxt, info,
mycol, myrow, npcol, nprow;
/*
* .. Local Arrays ..
*/
Int Xd[DLEN_];
/* ..
* .. Executable Statements ..
*
*/
PB_CargFtoC( *IX, *JX, DESCX, &Xi, &Xj, Xd );
#ifndef NO_ARGCHK
/*
* Test the input parameters
*/
Cblacs_gridinfo( ( ctxt = Xd[CTXT_] ), &nprow, &npcol, &myrow, &mycol );
if( !( info = ( ( nprow == -1 ) ? -( 601 + CTXT_ ) : 0 ) ) )
PB_Cchkvec( ctxt, "PSASUM", "X", *N, 1, Xi, Xj, Xd, *INCX, 6, &info );
if( info ) { PB_Cabort( ctxt, "PSASUM", info ); return; }
#endif
/*
* Initialize ASUM
*/
*ASUM = ZERO;
/*
* Quick return if possible
*/
if( *N == 0 ) return;
/*
* Retrieve process grid information
*/
#ifdef NO_ARGCHK
Cblacs_gridinfo( ( ctxt = Xd[CTXT_] ), &nprow, &npcol, &myrow, &mycol );
#endif
/*
* Retrieve sub( X )'s local information: Xii, Xjj, Xrow, Xcol
*/
PB_Cinfog2l( Xi, Xj, Xd, nprow, npcol, myrow, mycol, &Xii, &Xjj,
&Xrow, &Xcol );
/*
* Handle degenerate case separately, sub( X )'s scope is just one process
*/
if( ( *N == 1 ) && ( *INCX == 1 ) && ( Xd[M_] == 1 ) )
{
/*
* Make sure I own some data and compute ASUM
*/
if( ( ( myrow == Xrow ) || ( Xrow < 0 ) ) &&
( ( mycol == Xcol ) || ( Xcol < 0 ) ) )
{
*ASUM = ABS( *Mptr(X,Xii,Xjj,Xd[LLD_],1) );
}
return;
}
else if( *INCX == Xd[M_] )
{
/*
* sub( X ) resides in (a) process row(s)
*/
if( ( myrow == Xrow ) || ( Xrow < 0 ) )
{
/*
* Make sure I own some data and compute the local sum
*/
Xnq = PB_Cnumroc( *N, Xj, Xd[INB_], Xd[NB_], mycol, Xd[CSRC_], npcol );
if( Xnq > 0 )
{
Xld = Xd[LLD_];
svasum_( &Xnq, ((char *) ASUM), ((char *)Mptr( X,Xii,Xjj,Xld,1) ),
&Xld );
}
/*
* If Xnq <= 0, ASUM is zero (see initialization above)
*/
if( ( npcol > 1 ) && ( Xcol >= 0 ) )
{
/*
* Combine the local results if npcol > 1 and Xcol >= 0, i.e sub( X ) is
* distributed.
*/
top = *PB_Ctop( &ctxt, COMBINE, ROW, TOP_GET );
Csgsum2d( ctxt, ROW, &top, 1, 1, ((char *)ASUM), 1, -1,
mycol );
}
}
return;
}
else
{
/*
* sub( X ) resides in (a) process column(s)
*/
if( ( mycol == Xcol ) || ( Xcol < 0 ) )
{
/*
* Make sure I own some data and compute the local sum
*/
Xnp = PB_Cnumroc( *N, Xi, Xd[IMB_], Xd[MB_], myrow, Xd[RSRC_], nprow );
if( Xnp > 0 )
{
svasum_( &Xnp, ((char *) ASUM),
((char *)Mptr( X,Xii,Xjj,Xd[LLD_],1) ), INCX );
}
/*
* If Xnp <= 0, ASUM is zero (see initialization above)
*/
if( ( nprow > 1 ) && ( Xrow >= 0 ) )
{
/*
* Combine the local results if nprow > 1 and Xrow >= 0, i.e sub( X ) is
* distributed.
*/
top = *PB_Ctop( &ctxt, COMBINE, COLUMN, TOP_GET );
Csgsum2d( ctxt, COLUMN, &top, 1, 1, ((char *)ASUM), 1, -1,
mycol );
}
}
return;
}
/*
* End of PSASUM
*/
}
|
