pzgeqrf.c 4.84 KB
Newer Older
1
2
/**
 *
3
4
 * @copyright (c) 2009-2014 The University of Tennessee and The University
 *                          of Tennessee Research Foundation.
5
 *                          All rights reserved.
6
 * @copyright (c) 2012-2016 Inria. All rights reserved.
7
 * @copyright (c) 2012-2014 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria, Univ. Bordeaux. All rights reserved.
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
 *
 **/

/**
 *
 * @file pzgeqrf.c
 *
 *  MORSE auxiliary routines
 *  MORSE is a software package provided by Univ. of Tennessee,
 *  Univ. of California Berkeley and Univ. of Colorado Denver
 *
 * @version 2.5.0
 * @comment This file has been automatically generated
 *          from Plasma 2.5.0 for MORSE 1.0.0
 * @author Jakub Kurzak
 * @author Hatem Ltaief
 * @author Mathieu Faverge
 * @author Emmanuel Agullo
 * @author Cedric Castagnede
 * @date 2010-11-15
 * @precisions normal z -> s d c
 *
 **/
31
#include "control/common.h"
32
33
34

#define A(m,n) A,  m,  n
#define T(m,n) T,  m,  n
35
#if defined(CHAMELEON_COPY_DIAG)
36
#define D(k)   D,  k,  0
37
#else
38
#define D(k)   D,  k,  k
39
#endif
40

Mathieu Faverge's avatar
Mathieu Faverge committed
41
/*******************************************************************************
42
43
 *  Parallel tile QR factorization - dynamic scheduling
 **/
44
void morse_pzgeqrf(MORSE_desc_t *A, MORSE_desc_t *T, MORSE_desc_t *D,
45
46
47
48
49
50
51
52
53
54
55
                   MORSE_sequence_t *sequence, MORSE_request_t *request)
{
    MORSE_context_t *morse;
    MORSE_option_t options;
    size_t ws_worker = 0;
    size_t ws_host = 0;

    int k, m, n;
    int ldak, ldam;
    int tempkm, tempkn, tempnn, tempmm;
    int ib;
56
    int minMNT = chameleon_min(A->mt, A->nt);
57
58
59
60
61
62
63
64

    morse = morse_context_self();
    if (sequence->status != MORSE_SUCCESS)
        return;
    RUNTIME_options_init(&options, morse, sequence, request);

    ib = MORSE_IB;

65
66
67
68
    if ( D == NULL ) {
        D = A;
    }

69
70
71
72
73
74
75
76
77
    /*
     * zgeqrt = A->nb * (ib+1)
     * zunmqr = A->nb * ib
     * ztsqrt = A->nb * (ib+1)
     * ztsmqr = A->nb * ib
     */
    ws_worker = A->nb * (ib+1);

    /* Allocation of temporary (scratch) working space */
Mathieu Faverge's avatar
Mathieu Faverge committed
78
79
80
81
82
83
#if defined(CHAMELEON_USE_CUDA)
    /* Worker space
     *
     * zunmqr = A->nb * ib
     * ztsmqr = 2 * A->nb * ib
     */
84
    ws_worker = chameleon_max( ws_worker, ib * A->nb * 2 );
Mathieu Faverge's avatar
Mathieu Faverge committed
85
86
#endif

87
88
89
90
91
92
    ws_worker *= sizeof(MORSE_Complex64_t);
    ws_host   *= sizeof(MORSE_Complex64_t);

    RUNTIME_options_ws_alloc( &options, ws_worker, ws_host );

    for (k = 0; k < minMNT; k++) {
93
        RUNTIME_iteration_push(morse, k);
94

95
96
97
98
99
100
101
102
103
        tempkm = k == A->mt-1 ? A->m-k*A->mb : A->mb;
        tempkn = k == A->nt-1 ? A->n-k*A->nb : A->nb;
        ldak = BLKLDD(A, k);
        MORSE_TASK_zgeqrt(
            &options,
            tempkm, tempkn, ib, T->nb,
            A(k, k), ldak,
            T(k, k), T->mb);
        if ( k < (A->nt-1) ) {
104
#if defined(CHAMELEON_COPY_DIAG)
105
106
107
108
            MORSE_TASK_zlacpy(
                &options,
                MorseLower, A->mb, A->nb, A->nb,
                A(k, k), ldak,
109
                D(k), ldak );
Mathieu Faverge's avatar
Mathieu Faverge committed
110
#if defined(CHAMELEON_USE_CUDA)
111
112
113
114
            MORSE_TASK_zlaset(
                &options,
                MorseUpper, A->mb, A->nb,
                0., 1.,
115
                D(k), ldak );
116
#endif
117
#endif
118
        }
119
120
121
122
123
124
        for (n = k+1; n < A->nt; n++) {
            tempnn = n == A->nt-1 ? A->n-n*A->nb : A->nb;
            MORSE_TASK_zunmqr(
                &options,
                MorseLeft, MorseConjTrans,
                tempkm, tempnn, tempkm, ib, T->nb,
125
                D(k), ldak,
126
127
128
                T(k, k), T->mb,
                A(k, n), ldak);
        }
129

130
131
132
        for (m = k+1; m < A->mt; m++) {
            tempmm = m == A->mt-1 ? A->m-m*A->mb : A->mb;
            ldam = BLKLDD(A, m);
133
134
135
136

            RUNTIME_data_migrate( sequence, A(k, k),
                                  A->get_rankof( A, m, k ) );

137
            /* TS kernel */
138
            MORSE_TASK_ztpqrt(
139
                &options,
140
                tempmm, tempkn, 0, ib, T->nb,
141
142
143
                A(k, k), ldak,
                A(m, k), ldam,
                T(m, k), T->mb);
144

145
146
            for (n = k+1; n < A->nt; n++) {
                tempnn = n == A->nt-1 ? A->n-n*A->nb : A->nb;
147
148
149
150

                RUNTIME_data_migrate( sequence, A(k, n),
                                      A->get_rankof( A, m, n ) );

151
                /* TS kernel */
152
                MORSE_TASK_ztpmqrt(
153
154
                    &options,
                    MorseLeft, MorseConjTrans,
155
                    tempmm, tempnn, A->nb, 0, ib, T->nb,
156
                    A(m, k), ldam,
157
158
159
                    T(m, k), T->mb,
                    A(k, n), ldak,
                    A(m, n), ldam);
160
161
            }
        }
162

163
164
165
166
167
168
        /* Restore the original location of the tiles */
        for (n = k; n < A->nt; n++) {
            RUNTIME_data_migrate( sequence, A(k, n),
                                  A->get_rankof( A, k, n ) );
        }

169
        RUNTIME_iteration_pop(morse);
170
    }
Mathieu Faverge's avatar
Mathieu Faverge committed
171

172
173
    RUNTIME_options_ws_free(&options);
    RUNTIME_options_finalize(&options, morse);
Mathieu Faverge's avatar
Mathieu Faverge committed
174
    (void)D;
175
}