2024/04/10 by Yuan Yan Tang, Tang, Yuan
Computer Science · Engineering · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Numerical Analysis (math.NA) #Parallel #and Cluster Computing (cs.DC) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2404.06713
openalex publication_date 2024/04/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 \funcCOnfLUX. 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.