PDLACP2(l)
π PDLACP2 π
okay bestie, welcome to PDLACP2(l) β a LAPACK auxiliary routine, version 1.5, and she's serving pure local-copy realness. no drama, no network, just vibes and memcpy energy. let's get into it π«Ά
β¨ NAME β¨
PDLACP2 β copies all or part of a distributed matrix A to another distributed matrix B. that's it. that's the whole job. and she does it flawlessly. π
πΈ SYNOPSIS πΈ
SUBROUTINE PDLACP2( UPLO, M, N, A, IA, JA, DESCA, B, IB, JB, DESCB )
CHARACTER UPLO
INTEGER IA, IB, JA, JB, M, N
INTEGER DESCA( * ), DESCB( * )
DOUBLE PRECISION A( * ), B( * )
π¦ PURPOSE π¦
okay so here's the tea, bestie: PDLACP2 copies all or part of a distributed matrix A to another distributed matrix B. No communication is performed. none. zero. not a single message gets sent. it is purely a local copy β the page says sub( A ) := sub( B ), where sub( A ) denotes A(IA:IA+M-1,JA:JA+N-1) and sub( B ) denotes B(IB:IB+M-1,JB:JB+N-1). (yep, that's literally how the page writes it, and the argument descriptions below walk through the copy going from A into B β iykyk. π)
and PDLACP2 requires that only the dimension of the matrix operands is distributed. that's the whole rule. respect it. π
π Notes π
every global data object gets described by an associated description vector. this vector stores all the info you need to establish the mapping between an object element and its corresponding process and memory location. it's giving β¨paperworkβ¨ but make it essential.
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 notation breakdown, no skips, no cuts, we keep every crumb:
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 grid A is distributed over. the context itself is global, but the handle (the integer value) may vary.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
like, that's the math, and she's gorgeous. πβ¨
π ARGUMENTS π
UPLOβ (global input)CHARACTERβ specifies the part of the distributed matrixsub( A )to be copied:= 'U': upper triangular part is copied; the strictly lower triangular part ofsub( A )is not referenced.= 'L': lower triangular part is copied; the strictly upper triangular part ofsub( A )is not referenced.- otherwise: all of the matrix
sub( A )is copied.
Mβ (global input)INTEGERβ the number of rows to be operated on, i.e the number of rows of the distributed submatrixsub( A ).M >= 0.Nβ (global input)INTEGERβ the number of columns to be operated on, i.e the number of columns of the distributed submatrixsub( A ).N >= 0.Aβ (local input)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_A, LOCc(JA+N-1) ). this array contains the local pieces of the distributed matrixsub( A )to be copied from.IAβ (global input)INTEGERβ the row index in the global arrayAindicating the first row ofsub( A ).JAβ (global input)INTEGERβ the column index in the global arrayAindicating the first column ofsub( A ).DESCAβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrixA.Bβ (local output)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_B, LOCc(JB+N-1) ). this array contains on exit the local pieces of the distributed matrixsub( B )set as follows:- if
UPLO = 'U',B(IB+i-1,JB+j-1) = A(IA+i-1,JA+j-1),1<=i<=j,1<=j<=N; - if
UPLO = 'L',B(IB+i-1,JB+j-1) = A(IA+i-1,JA+j-1),j<=i<=M,1<=j<=N; - otherwise,
B(IB+i-1,JB+j-1) = A(IA+i-1,JA+j-1),1<=i<=M,1<=j<=N.
- if
IBβ (global input)INTEGERβ the row index in the global arrayBindicating the first row ofsub( B ).JBβ (global input)INTEGERβ the column index in the global arrayBindicating the first column ofsub( B ).DESCBβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrixB.
fr fr, that's every single argument, every single bound, every single formula. nothing got left on read. π«Ά
and that's the page, bestie!! she's LAPACK version 1.5, dated 12 May 1997, and she's still out here copying submatrices with zero communication and maximum main character energy. periodt. ππβ¨
π¦ 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