Science AI Journal
Computer Science · Research topic

Open research questions in Parallel Computing and Optimization Techniques

207 gap statements mined from Parallel Computing and Optimization Techniques papers in our 7.9M-paper local library, which holds 1,849 papers on the topic — drawn mostly from each paper's own stated research gap, future-work, challenge and limitation notes, and its abstract. The ones listed below are a selection still marked open; each names the study that raised it, with a DOI link where the paper has one.

Choosing where to publish on Parallel Computing and Optimization Techniques? See the ranked Computer Science journals.

What the literature leaves open

  • Existing methods for solving ODEs have limitations in terms of efficiency and scalability. The Parareal method has a higher computational complexity compared to the proposed method. There is a need for improved parallel-in-time solvers for nonlinear ODEs.

    A Parallel-in-Time Newton’s Method-Based ODE Solver · 2026 · DOI

  • However, the design space of these formats spanned by shared scale, weight, and activation format combinations has not been systematically explored, and the joint accuracy-silicon tradeoff across this space remains uncharacterized, leaving the true Pareto-optimal configurations for NPU-based edge LLM deployment an open question.

    MX-Like Tensor Core for LLM Inference with NPU Integration via Hardware-Software Co-Design Exploration · 2026

  • Finally, we identify persistent open challenges: memory bandwidth constraints, irregular matrix structures, and short unbalanced rows, underscoring the need for further optimization and architectural improvements.

    Demystifying SpMV Performance: Bottleneck Characterization and Open Challenges · 2026 · DOI

  • Although prior sparse-kernel acceleration has largely centered on GPUs, CPUs remain a first-order inference platform in CPU-only deployments and in heterogeneous serving when GPUs are scarce or memory-constrained.

    Optimizing Deep Neural Network Sparse Kernels on Multi-core CPUs · 2026 · DOI

  • Instrumented binaries run much slower than production builds and have memory efficiency issues. Selective instrumentation and adaptive profiling are needed to balance insight quality and system performance. Privacy concerns are raised when profiling production traffic at scale.

    Closed-Loop Binary Optimization: Integrating De-Identified Production Telemetry into the Build Lifecycle · 2026 · DOI

  • There is a gap between compiling source code to machine code and executing instructions on the processor. Static compilation cannot predict dynamic control flow and cache behavior.

    Closed-Loop Binary Optimization: Integrating De-Identified Production Telemetry into the Build Lifecycle · 2026 · DOI

  • Existing Rust-based data libraries focus primarily on either API breadth or specialized domains. There is a gap for a library that simultaneously provides a comprehensive SIMD-optimized operation stack, first-class bindings for both Python and WebAssembly, custom memory management, and modular feature composition.

    Veloxx: An Ultra-High Performance Data Processing Library with SIMD-Accelerated Columnar Operations · 2026 · DOI

  • Compilation time overhead from Rust monomorphization with full SIMD feature flags is mentioned but not quantified; a systematic analysis comparing incremental vs. full compilation times across feature subsets (CSV-only, CSV + filtering, full feature set) should be conducted to characterize the compile-time vs. runtime performance trade-off in Veloxx's feature flag system.

    Veloxx: An Ultra-High Performance Data Processing Library with SIMD-Accelerated Columnar Operations · 2026 · DOI

  • Traditional optimizations for CPUs and GPUs are not easily applicable to modern DSPs. There is a need for efficient GEMM libraries that can maximize computational capabilities and bandwidth utilization of multi-core DSPs.

    mtGEMM: An Efficient GEMM Library for Modern Multi-Core DSPs · 2026 · DOI

  • Existing analysis approaches have significant limitations. There is a need for a memory-centric analysis framework that can provide detailed insights into system behavior.

    An integrated framework for memory-centric analysis: from trace collection to co-design · 2026 · DOI

  • Future work will explore the integration of SVE2 (Scalable Vector Extensions) for wider logic gates, the expansion of the bit-sliced model to complex join operations and multi-dimensional spatial queries, and the application of this primitive to emerging domains such as real-time feature extraction for large-scale ML pipelines.

    AarchGate: A Domain-General Bit-Sliced JIT Execution Primitive for ARM64 - Technical Architecture and Implementation · 2026 · DOI

  • Future research will focus on scaling these optimizations to thousand-GPU clusters by integrating with hybrid parallelism strategies and generalizing cost-fitting models for emerging architectures like State Space Models (SSMs).

    AdaptiveLoad: Towards Efficient Video Diffusion Transformer Training · 2026

  • Building on KVDrive, our future research will focus on three key directions. First, we aim to extend our holistic management to multimodal models, which present distinct KV cache access patterns compared to text-only LLMs. Second, we plan to investigate Processing-in-Memory hardware to offload selection and partial computation directly into storage tiers, further mitigating data movement bottlenecks.

    KVDrive: A Holistic Multi-Tier KV Cache Management System for Long-Context LLM Inference · 2026

  • The evaluation of the statistical quality of PRNGs is challenging due to the complexity of the tests. The selection of the best PRNG for a specific application is difficult due to the lack of guidance. The development of new PRNGs with improved statistical quality is a challenging task.

    ASSESSING THE STOCHASTIC PROPERTIES OF MODERN PSEUDO-RANDOM GENERATORS FOR PARALLEL COMPUTING · 2026

  • The study only evaluates a limited number of generators. The tests are conducted under consistent conditions, but may not reflect real-world usage. The study does not provide a comprehensive comparison of all available generators.

    ASSESSING THE STOCHASTIC PROPERTIES OF MODERN PSEUDO-RANDOM GENERATORS FOR PARALLEL COMPUTING · 2026

  • For compressed sparse data representations, index-matching is critical in these kernels due to time-consuming memory accesses.

    SIMA: Scalable Scratchpad-Based Index-Matching Hardware Accelerator for Sparse Linear Algebra · 2026 · DOI

  • Limited registers within a DSP core. Instruction-level parallelism (ILP) optimization.

    mtGEMM: An Efficient GEMM Library for Modern Multi-Core DSPs · 2026 · DOI

  • INT2 KV-cache quantization is a challenging problem for long-context LLM serving. Simple rotations such as Hadamard transforms are not aligned with downstream attention.

    OSCAR: Offline Spectral Covariance-Aware Rotation for 2-bit KV Cache Quantization · 2026

  • 3DGS rendering remains too expensive for many latency-sensitive scenarios. Exploiting Tensor Cores for 3DGS is non-trivial because rasterization does not naturally match their execution model.

    Accelerating 3D Gaussian Splatting using Tensor Cores · 2026

  • End-to-end integration remains challenging for current models. Hardware resource utilization remains low, indicating there is substantial room for improved design strategies and optimization. The evaluation was conducted using simulation only.

    HSCO-Bench: An Agent-Driven End-to-End Hardware-Software Co-design Benchmark for Systems-on-Chip · 2026

  • Little work addresses multi-model scheduling under GPU memory constraints.

    Towards Multi-Model LLM Schedulers: Empirical Insights into Offloading and Preemption · 2026

  • To bridge this gap, we conduct a joint hardware-software (HW-SW) co-design exploration of the above underexplored MX-like design space with three innovations.

    MX-Like Tensor Core for LLM Inference with NPU Integration via Hardware-Software Co-Design Exploration · 2026

  • The computational cost of exact GP inference. The heavy dependency footprint of existing Python libraries like GPyTorch.

    Lightweight Gaussian Process Inference in C++ on Metal and CUDA · 2026

  • Extending the compiler with a continuation passing style translation to lift PopPy's restrictions. Improving the execution time overhead of PopPy for certain programs.

    PopPy: Opportunistically Exploiting Parallelism in Python Compound AI Applications · 2026

  • Exploring performance-resource trade-offs under varying resource constraints. Investigating the impact of different accelerator templates on SoC generation.

    HSCO-Bench: An Agent-Driven End-to-End Hardware-Software Co-design Benchmark for Systems-on-Chip · 2026

Most-cited papers in Parallel Computing and Optimization Techniques

Most recent work

Find a gap in your own Parallel Computing and Optimization Techniques sub-topic

This page shows what the Parallel Computing and Optimization Techniques literature already flags as unresolved. To narrow it to your specific question, search the Research Gap Finder: the search is free with a free account and lists the papers closest to your topic first. Unlocking that topic (50 credits, charged once) fills the comparison table from our 7.9M-paper local library and writes the gaps from its rows.

Open the Research Gap Finder →

Related topics in Computer Science

Online Learning and Analytics
1,253 open questions
Advanced Neural Network Applications
1,236 open questions
AI in Service Interactions
1,161 open questions
Virtual Reality Applications and Impacts
1,060 open questions
Computational Drug Discovery Methods
1,019 open questions
Quantum Computing Algorithms and Architecture
877 open questions
AI in cancer detection
835 open questions
Topic Modeling
780 open questions
Open questions raised by papers listed on this page include: (1) There is a need for improved parallel-in-time solvers for nonlinear ODEs (“A Parallel-in-Time Newton’s Method-Based ODE Solver”, 2026); (2) Although prior sparse-kernel acceleration has largely centered on GPUs, CPUs remain a first-order inference platform in CPU-only deployments and in heterogeneous serving when GPUs are scarce or memory-constrained (“Optimizing Deep Neural Network Sparse Kernels on Multi-core CPUs”, 2026); (3) Selective instrumentation and adaptive profiling are needed to balance insight quality and system performance (“Closed-Loop Binary Optimization: Integrating De-Identified Production Telemetry…”, 2026); (4) There is a need for efficient GEMM libraries that can maximize computational capabilities and bandwidth utilization of multi-core DSPs (“mtGEMM: An Efficient GEMM Library for Modern Multi-Core DSPs”, 2026); (5) There is a need for a memory-centric analysis framework that can provide detailed insights into system behavior (“An integrated framework for memory-centric analysis: from trace collection to…”, 2026). 207 gap statements have been mined from Parallel Computing and Optimization Techniques papers in our 7.9M-paper local library, which holds 1,849 papers on the topic; the gaps come from whichever of those papers state one. They are mostly the research gaps the authors state and the papers' abstracts, plus future-work, limitations and challenges passages. The ones listed below are a selection still marked open; each names the study that raised it, with a DOI link where the paper has one, so you can read the original claim in context.

Tools for your next paper

Gaps & Literature SearchFind open questions in any field — 1,100,000+ open gaps mined from our own library.Pre-CheckIs your paper ready? Acceptance odds for top, mid and open/emerging journals, in seconds.Journal FinderA ranked shortlist of target journals from a 17,500-venue index.Duplicate Publication CheckerCheck for prior publication across 7 sources and our local library.Citation GeneratorFreeA DOI or title → APA, MLA, Vancouver, Chicago, BibTeX, RIS. No signup.Graphical Abstract MakerFreeTurn your findings into a colorblind-safe graphical abstract.

How Pre-Check worksHow AI Review works

Compare the category — Honest roundups of the AI research tools, ours listed alongside the alternatives.

Command palette

Jump anywhere, run any action.