  This article conducts a reexamination of the research conducted by
Kwasniewski et al., focusing on their adaptation of the 2.5D LU factorization
algorithm with tournament pivoting, known as \func{COnfLUX}. Our reexamination
reveals potential concerns regarding the upper bound, empirical investigation
methods, and lower bound, despite the original study providing a theoretical
foundation and an instantiation of the proposed algorithm. This paper offers a
reexamination of these matters, highlighting probable shortcomings in the
original investigation. Our observations are intended to enhance the
development and comprehension of parallel matrix factorization algorithms.
