PDLACP3(l)
β¨ PDLACP3 β the lil helper that shuttles data between your global parallel array and a local replicated one β¨
okay bestie, buckle up, because this one is a LAPACK routine and it's lowkey a supporting character but it carries π«Ά. It lives in the l manual, and yes, that's PDLACP3(l) for the girlies keeping score. Version energy: LAPACK routine version 1.5. Let's get into it π
πΈ NAME πΈ
PDLACP3 β she's an auxiliary routine that copies from a global parallel array into a local replicated array, or vise versa πβ¨
π SYNOPSIS π
SUBROUTINE PDLACP3( M, I, A, DESCA, B, LDB, II, JJ, REV )
INTEGER I, II, JJ, LDB, M, REV
INTEGER DESCA( * )
DOUBLE PRECISION A( * ), B( LDB, * )
π PURPOSE π
PDLACP3 is an auxiliary routine that copies from a global parallel array into a local replicated array, or vise versa. π Notice that the entire submatrix that is copied gets placed on one node or more. The receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes. no cap, it's giving flexible π
π Notes π
Every global data object is described by an associated description vector. This vector stores the information required to establish the mapping between an object element and its corresponding process and memory location. (iykyk π§ )
Let A be a generic term for any 2D block cyclicly distributed array. Such a global array has an associated description vector DESCA. In the following comments, the character _ should be read as "of the global array".
Here's the whole lore, laid out for u:
DTYPE_A(global) β stored inDESCA( DTYPE_ )β the descriptor type. In this case,DTYPE_A = 1.CTXT_A(global) β stored inDESCA( CTXT_ )β the BLACS context handle, indicating the BLACS process gridAis distributed over. The context itself is global, but the handle (the integer value) may vary. she's global but her handle is local, iconic πM_A(global) β stored inDESCA( M_ )β the number of rows in the global arrayA.N_A(global) β stored inDESCA( N_ )β the number of columns in the global arrayA.MB_A(global) β stored inDESCA( MB_ )β the blocking factor used to distribute the rows of the array.NB_A(global) β stored inDESCA( NB_ )β the blocking factor used to distribute the columns of the array.RSRC_A(global) β stored inDESCA( RSRC_ )β the process row over which the first row of the arrayAis distributed.CSRC_A(global) β stored inDESCA( CSRC_ )β the process column over which the first column of the arrayAis distributed.LLD_A(local) β stored inDESCA( LLD_ )β the leading dimension of the local array.LLD_A >= MAX(1,LOCr(M_A)).
Let K be the number of rows or columns of a distributed matrix, and assume that its process grid has dimension p x q.
LOCr( K ) denotes the number of elements of K that a process would receive if K were distributed over the p processes of its process column.
Similarly, LOCc( K ) denotes the number of elements of K that a process would receive if K were distributed over the q processes of its process row.
The values of LOCr() and LOCc() may be determined via a call to the ScaLAPACK tool function, NUMROC:
LOCr( M ) = NUMROC( M, MB_A, MYROW, RSRC_A, NPROW ),
LOCc( N ) = NUMROC( N, NB_A, MYCOL, CSRC_A, NPCOL ).
An upper bound for these quantities may be computed by:
LOCr( M ) <= ceil( ceil(M/MB_A)/NPROW )*MB_A
LOCc( N ) <= ceil( ceil(N/NB_A)/NPCOL )*NB_A
π ARGUMENTS π
Mβ (global input) INTEGER βMis the order of the square submatrix that is copied.M >= 0. Unchanged on exit. she comes in, she leaves, no notes πIβ (global input) INTEGER βA(I,I)is the global location that the copying starts from. Unchanged on exit.Aβ (global input/output) DOUBLE PRECISION array, dimension(DESCA(LLD_),*)β On entry, the parallel matrix to be copied into or from. On exit, ifREV=1, the copied data. Unchanged on exit ifREV=0.DESCAβ (global and local input) INTEGER array of dimensionDLEN_β the array descriptor for the distributed matrixA. it's the vibe check for where everything lives πΊοΈBβ (local input/output) DOUBLE PRECISION array of size(LDB,M)β IfREV=0, this is the global portion of the arrayA(I:I+M-1,I:I+M-1). IfREV=1, this is the unchanged on exit.LDBβ (local input) INTEGER β the leading dimension ofB.IIβ (global input) INTEGER β By usingREV0&1, data can be sent out and returned again. IfREV=0, thenIIis destination row index for the node(s) receiving the replicatedB. IfII>=0,JJ>=0, then node(II,JJ)receives the data. IfII=-1,JJ>=0, then all rows in columnJJreceive the data. IfII>=0,JJ=-1, then all cols in rowIIreceive the data. IfII=-1,JJ=-1, then all nodes receive the data. IfREV<>0, thenIIis the source row index for the node(s) sending the replicatedB. ok the negative-one thing is doing a LOT of work here and honestly? respect πJJβ (global input) INTEGER β similar description asIIabove πREVβ (global input) INTEGER β useREV = 0to send globalAinto locally replicatedB(on node(II,JJ)). UseREV <> 0to send locally replicatedBfrom node(II,JJ)to its owner (which changes depending on its location inA) into the globalA.
π¨ heads up bestie:REV = 0andREV <> 0are the two whole modes. don't freestyle it, pick one on purpose.
Implemented by: G. Henry, May 1, 1997 π (shoutout to G. Henry, the original main character of this file, May 1, 1997, no cap π«‘)
and that's the whole page!! ππ This was LAPACK version 1.5, dated 12 May 1997 β PDLACP3(l), signed, sealed, delivered, periodt β¨π¦π Go copy something, you got this π
π¦ where this page comes from
- ubuntu jammy: scalapack-doc 1.5-11
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms