22 #include "sopalin/sopalin_data.h"
59 if ( cblk->
cblktype & CBLK_TASKS_2D ) {
61 for ( blokA = blokB; blokA < lblk; blokA++ ) {
64 cblk, fcblk, blokA, blokB, prio );
67 while ( ( blokA < lblk ) &&
68 ( blokA[0].fcblknm == blokA[1].fcblknm ) &&
69 ( blokA[0].lcblknm == blokA[1].lcblknm ) )
77 cblk, blokB, fcblk, prio );
106 if ( cblk->
cblktype & CBLK_TASKS_2D ) {
110 for ( blok = cblk->
fblokptr + 1, m = 0; blok < lblk; blok++, m++ ) {
117 while ( ( blok < lblk ) &&
118 ( blok[0].fcblknm == blok[1].fcblknm ) &&
119 ( blok[0].lcblknm == blok[1].lcblknm ) )
164 for (k=0; k<solvmtx->
cblknbr; k++, cblk++){
166 if ( cblk->
cblktype & CBLK_IN_SCHUR ) {
177 for(m=0; blok < lblk; blok++, m++ )
180 cblk_n = fcblk - solvmtx->
cblktab;
183 cblknbr - pastix_imin( k + m, cblk_n ) );
224 for ( k = 0; k < solvmtx->
cblknbr; k++, fcblk++ ) {
226 for ( m = fcblk[0].brownum; m < fcblk[1].
brownum; m++ ) {
230 if ( cblk->
cblktype & CBLK_IN_SCHUR ) {
235 cblk, blok, fcblk, cblknbr - k );
238 if ( fcblk->
cblktype & CBLK_IN_SCHUR ) {
247 for ( k = 0; k < solvmtx->
cblknbr; k++, cblk++ ) {
289 for ( k = 0; k <= solvmtx->
cblkmax1d; k++, cblk++ ) {
291 if ( cblk->
cblktype & CBLK_IN_SCHUR ) {
295 if ( cblk->
cblktype & CBLK_TASKS_2D ) {
303 for ( blok = cblk->
fblokptr + 1, m = 0; blok < lblk; blok++, m++ ) {
308 cblknbr - pastix_imin( k + m, cblk_n ) );
315 for ( k = solvmtx->
cblkmin2d; k < solvmtx->cblknbr; k++, cblk++ ) {
317 if ( cblk->
cblktype & CBLK_IN_SCHUR ) {
321 if ( ! ( cblk->
cblktype & CBLK_TASKS_2D ) ) {
329 for ( blok = cblk->
fblokptr + 1, m = 0; blok < lblk; blok++, m++ ) {
334 cblknbr - pastix_imin( k + m, cblk_n ) );
337 while( ( blok < lblk ) &&
339 ( blok[0].lcblknm == blok[1].lcblknm ) )
385 for ( k = 0; k < cblknbr; k++, fcblk++ ) {
387 for ( m = fcblk[0].brownum; m < fcblk[1].
brownum; m++ ) {
392 if ( cblk->
cblktype & CBLK_IN_SCHUR ) {
396 if( ( cblk->
cblktype & CBLK_TASKS_2D ) &&
397 ( blok_prev != NULL ) &&
408 if ( fcblk->
cblktype & CBLK_IN_SCHUR ) {
416 for ( k = 0; k < solvmtx->
cblknbr; k++, cblk++ ) {
452 sopalin_data_t *sopalin_data )
461 if (pastix_data->
starpu == NULL) {
466 if ( sdesc == NULL ) {
473 sdesc = sopalin_data->
solvmtx->starpu_desc;
476 starpu_profiling_status_set(STARPU_PROFILING_ENABLE);
477 #if defined(STARPU_USE_FXT)
479 starpu_fxt_start_profiling();
482 #if defined(PASTIX_STARPU_STATS)
510 #if defined(PASTIX_STARPU_STATS)
515 starpu_task_wait_for_all();
516 #if defined(PASTIX_WITH_MPI)
517 starpu_mpi_wait_for_all( pastix_data->
pastix_comm );
521 #if defined(STARPU_USE_FXT)
523 starpu_fxt_stop_profiling();
526 starpu_profiling_status_set(STARPU_PROFILING_DISABLE);
527 #if defined(PASTIX_STARPU_STATS)
529 print_stats( sub, com, pastix_data->
solvmatr );
BEGIN_C_DECLS typedef int pastix_int_t
void starpu_sparse_matrix_getoncpu(starpu_sparse_matrix_desc_t *desc)
Submit asynchronous calls to retrieve the data on main memory.
void starpu_task_cblk_dpotrfsp(sopalin_data_t *sopalin_data, SolverCblk *cblk, int prio)
TODO.
void starpu_sparse_matrix_init(SolverMatrix *solvmtx, pastix_mtxtype_t mtxtype, int nodes, int myrank, pastix_coeftype_t flttype)
Generate the StarPU descriptor of the sparse matrix.
void pastix_starpu_init(pastix_data_t *pastix, int *argc, char **argv[], const int *bindtab)
Startup the StarPU runtime system.
void starpu_task_blok_dpotrf(sopalin_data_t *sopalin_data, SolverCblk *cblk, int prio)
TODO.
void starpu_sparse_cblk_wont_use(pastix_coefside_t coef, SolverCblk *cblk)
Submit asynchronous calls to retrieve the data on main memory.
void starpu_task_blok_dtrsmsp(sopalin_data_t *sopalin_data, pastix_coefside_t coef, pastix_side_t side, pastix_uplo_t uplo, pastix_trans_t trans, pastix_diag_t diag, const SolverCblk *cblk, SolverBlok *blok, int prio)
StarPU GPU implementation.
void starpu_task_cblk_dgemmsp(sopalin_data_t *sopalin_data, pastix_coefside_t sideA, pastix_coefside_t sideB, pastix_trans_t trans, const SolverCblk *cblk, const SolverBlok *blok, SolverCblk *fcblk, int prio)
StarPU GPU implementation.
void starpu_task_blok_dgemmsp(sopalin_data_t *sopalin_data, pastix_coefside_t sideA, pastix_coefside_t sideB, pastix_trans_t trans, SolverCblk *cblk, SolverCblk *fcblk, const SolverBlok *blokA, const SolverBlok *blokB, int prio)
StarPU GPU implementation.
StarPU descriptor stucture for the sparse matrix.
PASTIX_Comm inter_node_comm
Main PaStiX data structure.
void starpu_dpotrf_sp1dplus_ll(sopalin_data_t *sopalin_data, starpu_sparse_matrix_desc_t *desc)
Perform a sparse Cholesky factorization with 1D kernels.
void starpu_task_dpotrfsp(sopalin_data_t *sopalin_data, SolverCblk *cblk, int prio)
TODO.
void starpu_dpotrf_sp1dplus_rl(sopalin_data_t *sopalin_data, starpu_sparse_matrix_desc_t *desc)
Perform a sparse Cholesky factorization with 1D kernels.
void starpu_dpotrf_sp2d_ll(sopalin_data_t *sopalin_data, starpu_sparse_matrix_desc_t *desc)
Perform a sparse Cholesky factorization with 1D and 2D kernels.
void starpu_dpotrf(pastix_data_t *pastix_data, sopalin_data_t *sopalin_data)
Perform a sparse Cholesky factorization using StarPU runtime.
void starpu_dpotrf_sp2d_rl(sopalin_data_t *sopalin_data, starpu_sparse_matrix_desc_t *desc)
Perform a sparse Cholesky factorization with 1D and 2D kernels.
void starpu_task_potrf_dgemmsp(sopalin_data_t *sopalin_data, SolverCblk *cblk, const SolverBlok *blokB, SolverCblk *fcblk, int prio)
TODO.
SolverBlok *restrict bloktab
pastix_int_t *restrict browtab
SolverCblk *restrict cblktab
Solver column block structure.
Solver column block structure.