Algebraic multigrid (AMG) methods are particularly efficient to solve a wide range of sparse linear systems, due to their good flexibility and adaptability. Even though modern parallel devices, such as GPUs, brought massive parallelism to AMG, the latest major hardware features, i.e., tensor core units and their low precision compute power, have not been exploited to accelerate AMG. This paper proposes AmgT, a new AMG solver that utilizes the tensor core and mixed precision ability of the latest GPUs during multiple phases of the AMG algorithm. Considering that the sparse general matrix-matrix multiplication (SpGEMM) and sparse matrix-vector multiplication (SpMV) are extensively used in the setup and solve phases, respectively, we propose a novel method based on a new unified sparse storage format that leverages tensor cores and their variable precision. Our method improves both the performance of GPU kernels, and also reduces the cost of format conversion in the whole data flow of AMG. To better utilize the algorithm components in existing libraries, the data format and compute kernels of the AmgT solver are incorporated into the HYPRE library. The experimental results on NVIDIA A100, H100 and AMD MI210 GPUs show that our AmgT outperforms the original GPU version of HYPRE by a factor of on geomean $1.46 \times, 1.32 \times$ and $2.24 \times$ (up to $2.10 \times, 2.06 \times$ and $3.67 \times$), respectively.

Sparse direct solvers play a vital role in large-scale high performance computing in science and engineering. Existing distributed sparse direct methods employ multifrontal/supernodal patterns to aggregate columns of nearly identical forms and to exploit dense basic linear algebra subprograms (BLAS) for computation. However, such a data layout may bring more unevenness when the structure of the input matrix is not ideal, and using dense BLAS may waste many floating-point operations on zero fill-ins.

Circular RNAs (circRNAs) are specifically and abnormally expressed in disease tissues, and thus can be used as biomarkers to diagnose relevant diseases. Predicting circRNA-disease associations will provide essential clues to reveal molecular mechanisms of disease development and discover novel therapeutic targets. Existing algorithms ignore the heterogeneous biological association information related to microRNAs (miRNAs). Based on a heterogeneous graph embedding model, a novel circRNA-disease association prediction method called HGECDA is developed in this paper. The heterogeneous graph network containing circRNA-miRNA-disease association information is first constructed. To sample the heterogeneous information, the meta-path-based random walk that can capture the relevance between various types of nodes is employed. Then, the path embedding model based on skip-gram and random negative sampling is built to acquire the initial feature vectors of circRNAs and diseases. Finally, the CosMulformer model with linearized self-attention and Hadamard product is designed to obtain the circRNA-disease interaction vectors and conduct the prediction task. Experimental results demonstrate the critical role of miRNA in enriching the information of the feature space, the effectiveness of the CosMulformer model in picking out deep local interaction features, and the feasibility of the Hadamard product chosen as the integration pattern in the CosMulformer model. Compared with existing state-of-the-art methods on the same dataset, HGECDA performs better than the other seven algorithms. Moreover, the case studies about breast cancer and colorectal cancer demonstrate the practical value of HGECDA in predicting potential circRNA-disease associations.

In this paper, we propose an efficient batch Bayesian optimization algorithm for analog circuit synthesis based on the multi-points selection criterion. Simplex evolution operator and Niching Migratory Multi-Swarm Optimizer (NMMSO) are used to generate candidates. The multi-point selection criterion is adopted to select multiple points from the candidates for parallel evaluation which can make full use of the computing resources. The experimental results demonstrate that this method can reduce the simulation time effectively while achieving better optimization results. Compared with the Multi-objective Acquisition function Ensemble (MACE) and the weighted expected improvement based Bayesian optimization (WEIBO), our proposed approach can accelerate the optimization process by up to $3 \times$ and $27 \times$.