YLYifan Li

Yifan Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yifan Li has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Sparse Linear Algebra Accelerates Genotype Representation Graph Computation at Biobank Scale

    by Yifan Li, Qingyao Sun, Drew DeHaas, Max Xiaohang Zhao, Adam R. Boyko, Shaila A. Musharoff, Xinzhu Wei, Giulia Guidi

    Biobank-scale genomic analyses are increasingly constrained by computational costs, as hundreds of thousands to millions of samples and variants must be analyzed together. The genotype representation graph (GRG) compactly encodes population genetic variation to accelerate computation, but its graph-traversal implementation does not exploit modern accelerators. This work introduces M ikado , a methodology that expresses GRG-based computation using sparse linear algebra primitives. Under a reverse topological ordering, the GRG adjacency matrix is strictly block-lower-triangular, and the genotype matrix-vector product becomes a sparse triangular solve, decomposed into a pipelined sequence of blocked sparse matrix-vector multiplies. Because GRGs are shallow by construction, the solve completes in only a few sequential stages, exposing fine-grained parallelism and enabling vendor-optimized sparse primitives on GPUs. On the full All of Us cohort, M ikado computes principal components in minutes , where PLINK2 cannot complete one chromosome in 72 hours, and runs genome-wide BOLT-LMM-inf in under 19 minutes on one GPU, where the official BOLT-LMM analysis would be impractical. Our two-stage reformulation is independent of the hardware: the same code runs unchanged across GPU architectures and, on CPUs, gives a 1.8 × single-threaded speedup over the existing GRG library together with multi-threaded scaling, providing a scalable, portable approach for population genetics as biobanks continue to grow.

  • Critique of “Data Flow Lifecycles for Optimizing Workflow Coordination” by SCC Team From Tsinghua University

    by Yifan Li, Yucheng Wang, Kai Yang, Zhiyu Xue, Yuqing Yang, Chengyu Shi, Mingshu Zhai, Wentao Han, Yuyang Jin, Jidong Zhai

    In this article we present our results from the SC24 Student Cluster Competition Reproducibility Challenge. The challenge entails reproducing the article entitled “Data Flow Lifecycles for Optimizing Workflow Coordination”, presented at SC23, which proposes data flow analysis for workflows. Data flow lifecycles (DFL) enrich task DAGs with data objects and properties that describe interactions between tasks and data flow. The authors use lifecycles and opportunity analysis to reason about improved task placement and reduce data movement for scientific workflows. Their work is implemented in the DataLife tool. Our study reproduces results associated with the 1000 Genomes workflow reported in the original article. We first monitored the I/O behavior of the workflow, drew the DFL graph and caterpillar tree graph, and subsequently improved workflow coordination based on insights from this analysis. Our experiments demonstrated that the DataLife tool effectively analyzes and visualizes existing workflows' task DAG and data flow properties, with the generated plots offering opportunities for optimization. However, we were unable to replicate the reported acceleration under our experimental settings and observed a maximum speedup discrepancy of 416%. To investigate this gap, we examined the source code and conducted experiments across varying CPU frequencies. While we identified several contributing factors, we could not draw definitive conclusions about all discrepancies due to the limited information disclosed about the original experimental setup.

  • Open Access

    High-Performance Sorting-Based K-mer Counting in Distributed Memory with Flexible Hybrid Parallelism

    by Yifan Li, Giulia Guidi

    In generating large quantities of DNA data, high-throughput sequencing technologies require advanced bioinformatics infrastructures for efficient data analysis. k-mer counting, the process of quantifying the frequency of fixed-length k DNA subsequences, is a fundamental step in various bioinformatics pipelines, including genome assembly and protein prediction. Due to the growing volume of data, the scaling of the counting process is critical. In the literature, distributed memory software uses hash tables, which exhibit poor cache friendliness and consume excessive memory. They often also lack support for flexible parallelism, which makes integration into existing bioinformatics pipelines difficult. In this work, we propose HySortK, a highly efficient sorting-based distributed memory k-mer counter. HySortK reduces the communication volume through a carefully designed communication scheme and domain-specific optimization strategies. Furthermore, we introduce an abstract task layer for flexible hybrid parallelism to address load imbalances in different scenarios. HySortK achieves a 2-10 × speedup compared to the GPU baseline on 4 and 8 nodes. Compared to state-of-the-art CPU software, HySortK achieves up to 2 × speedup while reducing peak memory usage by 30% on 16 nodes. Finally, we integrated HySortK into an existing genome assembly pipeline and achieved up to 1.8 × speedup, proving its flexibility and practicality in real-world scenarios.