mirror of
https://github.com/amd/blis.git
synced 2026-04-26 02:28:51 +00:00
Details:
- Parallelism within the IC loop (3rd loop around the microkernel) is
now supported within the trsm operation. This is done via a new branch
on each of the control and thread trees, which guide execution of a
new trsm-only subproblem from within bli_trsm_blk_var1(). This trsm
subproblem corresponds to the macrokernel computation on only the
block of A that contains the diagonal (labeled as A11 in algorithms
with FLAME-like partitioning), and the corresponding row panel of C.
During the trsm subproblem, all threads within the JC communicator
participate and parallelize along the JR loop, including any
parallelism that was specified for the IC loop. (IR loop parallelism
is not supported for trsm due to inter-iteration dependencies.) After
this trsm subproblem is complete, a barrier synchronizes all
participating threads and then they proceed to apply the prescribed
BLIS_IC_NT (or equivalent) ways of parallelism (and any BLIS_JR_NT
parallelism specified within) to the remaining gemm subproblem (the
rank-k update that is performed using the newly updated row-panel of
B). Thus, trsm now supports JC, IC, and JR loop parallelism.
- Modified bli_trsm_l_cntl_create() to create the new "prenode" branch
of the trsm_l cntl_t tree. The trsm_r tree was left unchanged, for
now, since it is not currently used. (All trsm problems are cast in
terms of left-side trsm.)
- Updated bli_cntl_free_w_thrinfo() to be able to free the newly shaped
trsm cntl_t trees. Fixed a potentially latent bug whereby a cntl_t
subnode is only recursed upon if there existed a corresponding
thrinfo_t node, which may not always exist (for problems too small
to employ full parallelization due to the minimum granularity imposed
by micropanels).
- Updated other functions in frame/base/bli_cntl.c, such as
bli_cntl_copy() and bli_cntl_mark_family(), to recurse on sub-prenodes
if they exist.
- Updated bli_thrinfo_free() to recurse into sub-nodes and prenodes
when they exist, and added support for growing a prenode branch to
bli_thrinfo_grow() via a corresponding set of help functions named
with the _prenode() suffix.
- Added a bszid_t field thrinfo_t nodes. This field comes in handy when
debugging the allocation/release of thrinfo_t nodes, as it helps trace
the "identity" of each nodes as it is created/destroyed.
- Renamed
bli_l3_thrinfo_print_paths() -> bli_l3_thrinfo_print_gemm_paths()
and created a separate bli_l3_thrinfo_print_trsm_paths() function to
print out the newly reconfigured thrinfo_t trees for the trsm
operation.
- Trival changes to bli_gemm_blk_var?.c and bli_trsm_blk_var?.c
regarding variable declarations.
- Removed subpart_t enum values BLIS_SUBPART1T, BLIS_SUBPART1B,
BLIS_SUBPART1L, BLIS_SUBPART1R. Then added support for two new labels
(semantically speaking): BLIS_SUBPART1A and BLIS_SUBPART1B, which
represent the subpartition ahead of and behind, respectively,
BLIS_SUBPART1. Updated check functions in bli_check.c accordingly.
- Shuffled layering/APIs for bli_acquire_mpart_[mn]dim() and
bli_acquire_mpart_t2b/b2t(), _l2r/r2l().
- Deprecated old functions in frame/3/bli_l3_thrinfo.c.
228 lines
5.1 KiB
C
228 lines
5.1 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2014, The University of Texas at Austin
|
|
Copyright (C) 2018, Advanced Micro Devices, Inc.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are
|
|
met:
|
|
- Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
- Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
- Neither the name(s) of the copyright holder(s) nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
/*
|
|
// -- Control tree node definition --
|
|
|
|
struct cntl_s
|
|
{
|
|
// Basic fields (usually required).
|
|
opid_t family;
|
|
bszid_t bszid;
|
|
void* var_func;
|
|
struct cntl_s* sub_prenode;
|
|
struct cntl_s* sub_node;
|
|
|
|
// Optional fields (needed only by some operations such as packm).
|
|
// NOTE: first field of params must be a uint64_t containing the size
|
|
// of the struct.
|
|
void* params;
|
|
|
|
// Internal fields that track "cached" data.
|
|
mem_t pack_mem;
|
|
};
|
|
typedef struct cntl_s cntl_t;
|
|
*/
|
|
|
|
|
|
// -- Control tree prototypes --
|
|
|
|
cntl_t* bli_cntl_create_node
|
|
(
|
|
rntm_t* rntm,
|
|
opid_t family,
|
|
bszid_t bszid,
|
|
void* var_func,
|
|
void* params,
|
|
cntl_t* sub_node
|
|
);
|
|
|
|
void bli_cntl_free_node
|
|
(
|
|
rntm_t* rntm,
|
|
cntl_t* cntl
|
|
);
|
|
|
|
void bli_cntl_clear_node
|
|
(
|
|
cntl_t* cntl
|
|
);
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
void bli_cntl_free
|
|
(
|
|
rntm_t* rntm,
|
|
cntl_t* cntl,
|
|
thrinfo_t* thread
|
|
);
|
|
|
|
void bli_cntl_free_w_thrinfo
|
|
(
|
|
rntm_t* rntm,
|
|
cntl_t* cntl,
|
|
thrinfo_t* thread
|
|
);
|
|
|
|
void bli_cntl_free_wo_thrinfo
|
|
(
|
|
rntm_t* rntm,
|
|
cntl_t* cntl
|
|
);
|
|
|
|
cntl_t* bli_cntl_copy
|
|
(
|
|
rntm_t* rntm,
|
|
cntl_t* cntl
|
|
);
|
|
|
|
void bli_cntl_mark_family
|
|
(
|
|
opid_t family,
|
|
cntl_t* cntl
|
|
);
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
dim_t bli_cntl_calc_num_threads_in
|
|
(
|
|
rntm_t* rntm,
|
|
cntl_t* cntl
|
|
);
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
// cntl_t query (fields only)
|
|
|
|
static opid_t bli_cntl_family( cntl_t* cntl )
|
|
{
|
|
return cntl->family;
|
|
}
|
|
|
|
static bszid_t bli_cntl_bszid( cntl_t* cntl )
|
|
{
|
|
return cntl->bszid;
|
|
}
|
|
|
|
static void* bli_cntl_var_func( cntl_t* cntl )
|
|
{
|
|
return cntl->var_func;
|
|
}
|
|
|
|
static cntl_t* bli_cntl_sub_prenode( cntl_t* cntl )
|
|
{
|
|
return cntl->sub_prenode;
|
|
}
|
|
|
|
static cntl_t* bli_cntl_sub_node( cntl_t* cntl )
|
|
{
|
|
return cntl->sub_node;
|
|
}
|
|
|
|
static void* bli_cntl_params( cntl_t* cntl )
|
|
{
|
|
return cntl->params;
|
|
}
|
|
|
|
static uint64_t bli_cntl_params_size( cntl_t* cntl )
|
|
{
|
|
// The first 64 bytes is always the size of the params structure.
|
|
return *( ( uint64_t* )(cntl->params) );
|
|
}
|
|
|
|
static mem_t* bli_cntl_pack_mem( cntl_t* cntl )
|
|
{
|
|
return &(cntl->pack_mem);
|
|
}
|
|
|
|
// cntl_t query (complex)
|
|
|
|
static bool_t bli_cntl_is_null( cntl_t* cntl )
|
|
{
|
|
return ( bool_t )
|
|
( cntl == NULL );
|
|
}
|
|
|
|
static bool_t bli_cntl_is_leaf( cntl_t* cntl )
|
|
{
|
|
return ( bool_t )
|
|
( bli_cntl_sub_node( cntl ) == NULL );
|
|
}
|
|
|
|
static bool_t bli_cntl_does_part( cntl_t* cntl )
|
|
{
|
|
return ( bool_t )
|
|
( bli_cntl_bszid( cntl ) != BLIS_NO_PART );
|
|
}
|
|
|
|
// cntl_t modification
|
|
|
|
static void bli_cntl_set_family( opid_t family, cntl_t* cntl )
|
|
{
|
|
cntl->family = family;
|
|
}
|
|
|
|
static void bli_cntl_set_bszid( bszid_t bszid, cntl_t* cntl )
|
|
{
|
|
cntl->bszid = bszid;
|
|
}
|
|
|
|
static void bli_cntl_set_var_func( void* var_func, cntl_t* cntl )
|
|
{
|
|
cntl->var_func = var_func;
|
|
}
|
|
|
|
static void bli_cntl_set_sub_prenode( cntl_t* sub_prenode, cntl_t* cntl )
|
|
{
|
|
cntl->sub_prenode = sub_prenode;
|
|
}
|
|
|
|
static void bli_cntl_set_sub_node( cntl_t* sub_node, cntl_t* cntl )
|
|
{
|
|
cntl->sub_node = sub_node;
|
|
}
|
|
|
|
static void bli_cntl_set_params( void* params, cntl_t* cntl )
|
|
{
|
|
cntl->params = params;
|
|
}
|
|
|
|
static void bli_cntl_set_pack_mem( mem_t* pack_mem, cntl_t* cntl )
|
|
{
|
|
cntl->pack_mem = *pack_mem;
|
|
}
|
|
|