root / man / man3 / HPL_spreadT.3
Historique | Voir | Annoter | Télécharger (3,2 ko)
1 | 1 | equemene | .TH HPL_spreadT 3 "September 10, 2008" "HPL 2.0" "HPL Library Functions" |
---|---|---|---|
2 | 1 | equemene | .SH NAME |
3 | 1 | equemene | HPL_spreadT \- Spread row panel U and forward current column panel. |
4 | 1 | equemene | .SH SYNOPSIS |
5 | 1 | equemene | \fB\&#include "hpl.h"\fR |
6 | 1 | equemene | |
7 | 1 | equemene | \fB\&void\fR |
8 | 1 | equemene | \fB\&HPL_spreadT(\fR |
9 | 1 | equemene | \fB\&HPL_T_panel *\fR |
10 | 1 | equemene | \fI\&PBCST\fR, |
11 | 1 | equemene | \fB\&int *\fR |
12 | 1 | equemene | \fI\&IFLAG\fR, |
13 | 1 | equemene | \fB\&HPL_T_panel *\fR |
14 | 1 | equemene | \fI\&PANEL\fR, |
15 | 1 | equemene | \fB\&const enum HPL_SIDE\fR |
16 | 1 | equemene | \fI\&SIDE\fR, |
17 | 1 | equemene | \fB\&const int\fR |
18 | 1 | equemene | \fI\&N\fR, |
19 | 1 | equemene | \fB\&double *\fR |
20 | 1 | equemene | \fI\&U\fR, |
21 | 1 | equemene | \fB\&const int\fR |
22 | 1 | equemene | \fI\&LDU\fR, |
23 | 1 | equemene | \fB\&const int\fR |
24 | 1 | equemene | \fI\&SRCDIST\fR, |
25 | 1 | equemene | \fB\&const int *\fR |
26 | 1 | equemene | \fI\&IPLEN\fR, |
27 | 1 | equemene | \fB\&const int *\fR |
28 | 1 | equemene | \fI\&IPMAP\fR, |
29 | 1 | equemene | \fB\&const int *\fR |
30 | 1 | equemene | \fI\&IPMAPM1\fR |
31 | 1 | equemene | \fB\&);\fR |
32 | 1 | equemene | .SH DESCRIPTION |
33 | 1 | equemene | \fB\&HPL_spreadT\fR |
34 | 1 | equemene | spreads the local array containing local pieces of U, so |
35 | 1 | equemene | that on exit to this function, a piece of U is contained in every |
36 | 1 | equemene | process row. The array IPLEN contains the number of columns of U, |
37 | 1 | equemene | that should be spread on any given process row. This function also |
38 | 1 | equemene | probes for the presence of the column panel PBCST. If available, |
39 | 1 | equemene | this panel will be forwarded. If PBCST is NULL on input, this |
40 | 1 | equemene | probing mechanism will be disabled. |
41 | 1 | equemene | .SH ARGUMENTS |
42 | 1 | equemene | .TP 8 |
43 | 1 | equemene | PBCST (local input/output) HPL_T_panel * |
44 | 1 | equemene | On entry, PBCST points to the data structure containing the |
45 | 1 | equemene | panel (to be broadcast) information. |
46 | 1 | equemene | .TP 8 |
47 | 1 | equemene | IFLAG (local input/output) int * |
48 | 1 | equemene | On entry, IFLAG indicates whether or not the broadcast has |
49 | 1 | equemene | already been completed. If not, probing will occur, and the |
50 | 1 | equemene | outcome will be contained in IFLAG on exit. |
51 | 1 | equemene | .TP 8 |
52 | 1 | equemene | PANEL (local input/output) HPL_T_panel * |
53 | 1 | equemene | On entry, PANEL points to the data structure containing the |
54 | 1 | equemene | panel (to be spread) information. |
55 | 1 | equemene | .TP 8 |
56 | 1 | equemene | SIDE (global input) const enum HPL_SIDE |
57 | 1 | equemene | On entry, SIDE specifies whether the local piece of U located |
58 | 1 | equemene | in process IPMAP[SRCDIST] should be spread to the right or to |
59 | 1 | equemene | the left. This feature is used by the equilibration process. |
60 | 1 | equemene | .TP 8 |
61 | 1 | equemene | N (global input) const int |
62 | 1 | equemene | On entry, N specifies the local number of rows of U. N must |
63 | 1 | equemene | be at least zero. |
64 | 1 | equemene | .TP 8 |
65 | 1 | equemene | U (local input/output) double * |
66 | 1 | equemene | On entry, U is an array of dimension (LDU,*) containing the |
67 | 1 | equemene | local pieces of U. |
68 | 1 | equemene | .TP 8 |
69 | 1 | equemene | LDU (local input) const int |
70 | 1 | equemene | On entry, LDU specifies the local leading dimension of U. LDU |
71 | 1 | equemene | should be at least MAX(1,N). |
72 | 1 | equemene | .TP 8 |
73 | 1 | equemene | SRCDIST (local input) const int |
74 | 1 | equemene | On entry, SRCDIST specifies the source process that spreads |
75 | 1 | equemene | its piece of U. |
76 | 1 | equemene | .TP 8 |
77 | 1 | equemene | IPLEN (global input) const int * |
78 | 1 | equemene | On entry, IPLEN is an array of dimension NPROW+1. This array |
79 | 1 | equemene | is such that IPLEN[i+1] - IPLEN[i] is the number of rows of U |
80 | 1 | equemene | in each process before process IPMAP[i], with the convention |
81 | 1 | equemene | that IPLEN[nprow] is the total number of rows. In other words |
82 | 1 | equemene | IPLEN[i+1] - IPLEN[i] is the local number of rows of U that |
83 | 1 | equemene | should be moved to process IPMAP[i]. |
84 | 1 | equemene | .TP 8 |
85 | 1 | equemene | IPMAP (global input) const int * |
86 | 1 | equemene | On entry, IPMAP is an array of dimension NPROW. This array |
87 | 1 | equemene | contains the logarithmic mapping of the processes. In other |
88 | 1 | equemene | words, IPMAP[myrow] is the absolute coordinate of the sorted |
89 | 1 | equemene | process. |
90 | 1 | equemene | .TP 8 |
91 | 1 | equemene | IPMAPM1 (global input) const int * |
92 | 1 | equemene | On entry, IPMAPM1 is an array of dimension NPROW. This array |
93 | 1 | equemene | contains the inverse of the logarithmic mapping contained in |
94 | 1 | equemene | IPMAP: For i in [0.. NPROW) IPMAPM1[IPMAP[i]] = i. |
95 | 1 | equemene | .SH SEE ALSO |
96 | 1 | equemene | .BR HPL_pdlaswp01T \ (3). |