PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 11, 2026Computation0 citationsOpen Access

Multi-Level Parallel CPU Execution Method for Accelerated Portion-Based Variant Call Format Data Processing

LMLesia MochuradITIvan TsmotsVMVita Mostova

Key Points

  • The aim is to develop a high-throughput method for processing VCF data efficiently and accurately.
  • Proposed a multi-level CPU execution method for processing VCF data.
  • Integrated block-based partitioning for localized fragment processing.
  • Utilized task-level decomposition for feature construction.
  • Implemented JIT compilation for numerical kernel execution.
  • Introduced resource-control to manage effective parallelism.
  • Achieved a runtime reduction from 291.25 s to 73.82 s, a speedup of 3.95×.
  • With model training, further reduced runtime to 51.18 s, a 5.69× speedup.
  • Classification metrics maintained high accuracy (0.8483), precision (0.8758), recall (0.8261), and F1 score (0.8502).
  • Stage-wise ablation confirmed consistent performance scaling under resource constraints.

Abstract

This paper proposes and experimentally evaluates a multi-level CPU-oriented execution method for high-throughput portion-based processing of file-backed Variant Call Format (VCF) data and automated mutation classification. The approach is based on a formally defined local processing scheme and integrates three coordinated levels of parallelism: block-based partitioning of file-backed VCF portions read sequentially into localized fragments with data-level parallel processing; task-level decomposition of feature construction into independent transformations; and execution-level specialization via JIT compilation of numerical kernels. To prevent performance degradation caused by nested parallelism, a resource-control mechanism is introduced as an execution rule that bounds effective parallelism and mitigates oversubscription, improving throughput stability on a single multi-core CPU node. Experiments on a public chromosome-17 VCF dataset for BRCA1-region pathogenicity classification demonstrate that the proposed multi-level local CPU execution (parsing/filtering, feature construction, and JIT-specialized numeric kernels) reduces runtime from 291.25 s (sequential) to 73.82 s, yielding a 3.95× speedup. When combined with resource-coordinated parallel model training, the end-to-end runtime further decreases to 51.18 s, corresponding to a 5.69× speedup, while preserving classification quality (accuracy 0.8483, precision 0.8758, recall 0.8261, F1 0.8502). A stage-wise ablation analysis quantifies the contribution of each execution level and confirms consistent scaling under resource-bounded execution.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Mochurad et al. (2026) studied this question.

synapsesocial.com/papers/698c1bef267fb587c655de7fhttps://doi.org/10.3390/computation14020048
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Learning-based parallel acceleration for HaplotypeCaller2025 · 1 citations
  2. 2Optimization of parallel compilation techniques using genetic algorithms2024
  3. 3Enhancing AdaBoost Performance: Comparative Analysis of CPU Parallel Processing on Breast Cancer Classification2024
  4. 4Abstract 1498: A generalizable software framework for ultra-rapid sequence analysis and its application in enabling 1 day deep multi-omic data analysis turnaround for brain cancer precision oncology2026
  5. 5Adaptive Parallelization Based on Frame‐Level and Tile‐Level Parallelisms for VVC Encoding2025