Statistiques
| Révision :

root / www / HPL_equil.html

Historique | Voir | Annoter | Télécharger (3,52 ko)

1
<HTML>
2
<HEAD>
3
<TITLE>HPL_equil HPL 2.0 Library Functions September 10, 2008</TITLE> 
4
</HEAD>
5

    
6
<BODY BGCOLOR="WHITE" TEXT = "#000000" LINK = "#0000ff" VLINK = "#000099"
7
      ALINK = "#ffff00">
8

    
9
<H1>Name</H1>
10
<B>HPL_equil</B> Equilibrate U and forward the column panel L.
11

    
12
<H1>Synopsis</H1>
13
<CODE>#include "hpl.h"</CODE><BR><BR>
14
<CODE>void</CODE>
15
<CODE>HPL_equil(</CODE>
16
<CODE>HPL_T_panel *</CODE>
17
<CODE>PBCST</CODE>,
18
<CODE>int *</CODE>
19
<CODE>IFLAG</CODE>,
20
<CODE>HPL_T_panel *</CODE>
21
<CODE>PANEL</CODE>,
22
<CODE>const enum HPL_TRANS</CODE>
23
<CODE>TRANS</CODE>,
24
<CODE>const int</CODE>
25
<CODE>N</CODE>,
26
<CODE>double *</CODE>
27
<CODE>U</CODE>,
28
<CODE>const int</CODE>
29
<CODE>LDU</CODE>,
30
<CODE>int *</CODE>
31
<CODE>IPLEN</CODE>,
32
<CODE>const int *</CODE>
33
<CODE>IPMAP</CODE>,
34
<CODE>const int *</CODE>
35
<CODE>IPMAPM1</CODE>,
36
<CODE>int *</CODE>
37
<CODE>IWORK</CODE>
38
<CODE>);</CODE>
39

    
40
<H1>Description</H1>
41
<B>HPL_equil</B>
42
equilibrates  the  local  pieces  of U, so that on exit to
43
this function, pieces of U contained in every process row are of the
44
same size. This phase makes the rolling phase optimal.  In addition,
45
this  function probes  for  the  column panel L and forwards it when
46
possible.
47

    
48
<H1>Arguments</H1>
49
<PRE>
50
PBCST   (local input/output)          HPL_T_panel *
51
        On entry,  PBCST  points to the data structure containing the
52
        panel (to be broadcast) information.
53
</PRE>
54
<PRE>
55
IFLAG   (local input/output)          int *
56
        On entry, IFLAG  indicates  whether or not  the broadcast has
57
        already been completed.  If not,  probing will occur, and the
58
        outcome will be contained in IFLAG on exit.
59
</PRE>
60
<PRE>
61
PANEL   (local input/output)          HPL_T_panel *
62
        On entry,  PANEL  points to the data structure containing the
63
        panel (to be equilibrated) information.
64
</PRE>
65
<PRE>
66
TRANS   (global input)                const enum HPL_TRANS
67
        On entry, TRANS specifies whether  U  is stored in transposed
68
        or non-transposed form.
69
</PRE>
70
<PRE>
71
N       (local input)                 const int
72
        On entry, N  specifies the number of rows or columns of  U. N
73
        must be at least 0.
74
</PRE>
75
<PRE>
76
U       (local input/output)          double *
77
        On entry,  U  is an array of dimension (LDU,*) containing the
78
        local pieces of U in each process row.
79
</PRE>
80
<PRE>
81
LDU     (local input)                 const int
82
        On entry, LDU specifies the local leading dimension of U. LDU
83
        should be at least MAX(1,IPLEN[nprow]) when  U  is stored  in
84
        non-transposed form, and MAX(1,N) otherwise.
85
</PRE>
86
<PRE>
87
IPLEN   (global input)                int *
88
        On entry, IPLEN is an array of dimension NPROW+1.  This array
89
        is such that IPLEN[i+1] - IPLEN[i] is the number of rows of U
90
        in process IPMAP[i].
91
</PRE>
92
<PRE>
93
IPMAP   (global input)                const int *
94
        On entry, IPMAP is an array of dimension  NPROW.  This  array
95
        contains  the  logarithmic mapping of the processes. In other
96
        words, IPMAP[myrow]  is the absolute coordinate of the sorted
97
        process.
98
</PRE>
99
<PRE>
100
IPMAPM1 (global input)                const int *
101
        On entry, IPMAPM1  is an array of dimension NPROW. This array
102
        contains  the inverse of the logarithmic mapping contained in
103
        IPMAP: For i in [0.. NPROCS) IPMAPM1[IPMAP[i]] = i.
104
</PRE>
105
<PRE>
106
IWORK   (workspace)                   int *
107
        On entry, IWORK is a workarray of dimension NPROW+1.
108
</PRE>
109

    
110
<H1>See Also</H1>
111
<A HREF="HPL_pdlaswp01N.html">HPL_pdlaswp01N</A>,
112
<A HREF="HPL_pdlaswp01T.html">HPL_pdlaswp01T</A>.
113

    
114
</BODY>
115
</HTML>