DynamiQ: Unlocking the Potential of Dynamic Task Allocation in Parallel Fuzzing

• URL: http://arxiv.org/abs/2510.04469v2
• Date: Tue, 07 Oct 2025 03:59:15 GMT
• Title: DynamiQ: Unlocking the Potential of Dynamic Task Allocation in Parallel Fuzzing
• Abstract summary: We present DynamiQ, a full-fledged and optimized successor to AFLTeam that supports dynamic and adaptive parallel fuzzing.<n>DynamiQ leverages structural information from the program's call graph to define tasks and continuously refines task allocation using runtime feedback.<n> Evaluated on 12 real-world targets from OSS-Fuzz and FuzzBench over 25,000 CPU hours, DynamiQ outperforms state-of-the-art parallel fuzzers in both code coverage and vulnerability discovery.
• Score: 18.082974145476843
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present DynamiQ, a full-fledged and optimized successor to AFLTeam that supports dynamic and adaptive parallel fuzzing. Unlike most existing approaches that treat individual seeds as tasks, DynamiQ leverages structural information from the program's call graph to define tasks and continuously refines task allocation using runtime feedback. This design significantly reduces redundant exploration and enhances fuzzing efficiency at scale. Built on top of the state-of-the-art LibAFL framework, DynamiQ incorporates several practical optimizations in both task allocation and task-aware fuzzing. Evaluated on 12 real-world targets from OSS-Fuzz and FuzzBench over 25,000 CPU hours, DynamiQ outperforms state-of-the-art parallel fuzzers in both code coverage and vulnerability discovery, uncovering 9 previously unknown bugs in widely used and extensively fuzzed open-source software.

Related papers

• Temporal Logic Guided Universal Task Representations for Reinforcement Learning [14.92202580772709]
  LOTUS is a temporal logic inspired universal task representation framework.<n>It can be seamlessly integrated into any RL algorithm to enhance agent performance across diverse task settings.<n>We show that LOTUS accelerates convergence over 20% in single-task scenarios, achieves a 15%-45% higher success rate in unseen manipulation tasks, and improves generalization performance over 25% in complex multi-task environments.
  arXiv  Detail & Related papers  (2026-08-16T03:28:43Z)
• Event Tensor: A Unified Abstraction for Compiling Dynamic Megakernel [17.931727429220874]
  Event Compiler (ETC) applies static and dynamic scheduling to generate high-performance persistent kernels.<n>ETC achieves state-of-the-art serving latency while significantly reducing warmup overhead.
  arXiv  Detail & Related papers  (2026-04-14T22:19:51Z)
• MagicAgent: Towards Generalized Agent Planning [73.21129030631421]
  We present textbfMagicAgent, a series of foundation models specifically designed for generalized agent planning.<n>We introduce a lightweight and scalable synthetic data framework that generates high-quality trajectories across diverse planning tasks.<n>We show that MagicAgent-32B and MagicAgent-30B-A3B achieve superior performance across diverse open-source benchmarks.
  arXiv  Detail & Related papers  (2026-02-22T01:39:16Z)
• IntentCUA: Learning Intent-level Representations for Skill Abstraction and Multi-Agent Planning in Computer-Use Agents [4.655926959889001]
  We present IntentCUA, a computer-use framework designed to stabilize long-horizon execution through intent-aligned plan memory.<n>Int Intent prototypes retrieve subgroup-aligned skills and inject them into partial plans, reducing redundant re-planning.<n>Int IntentCUA achieved a 74.83% task success rate with a Step Efficiency Ratio of 0.91, outperforming RL-based and trajectory-centric baselines.
  arXiv  Detail & Related papers  (2026-02-19T03:42:15Z)
• Vulcan: Instance-Optimal Systems Heuristics Through LLM-Driven Search [8.11393834061004]
  We propose instance-optimals -- specialized for the exact workloads and hardware where they will be deployed -- using code-generating large language models (LLMs)<n>With these interfaces, users specify the inputs and objectives of their desired policy, while Vulcan searches for performant policies via evolutionary search over LLM-generated code.<n>We use Vulcan to synthesize performants for cache eviction and memory tiering, and find that these Vulcans outperform all human-designed state-of-the-art algorithms by upto 69% and 7.9% in performance for each of these tasks respectively.
  arXiv  Detail & Related papers  (2025-12-31T18:58:19Z)
• Feature-aligned Motion Transformation for Efficient Dynamic Point Cloud Compression [96.50160784402338]
  We introduce a Motion Transformation Feature (FMT) framework for dynamic point cloud compression.<n>FMT replaces explicit motion vectors with an alignment strategy that implicitly models continuous temporal variations.<n>Our method surpasses D-DPCC and AdaDPCC in both encoding and decoding efficiency, while also achieving BD-Rate reductions of 20% and 9.4%.
  arXiv  Detail & Related papers  (2025-09-18T03:51:06Z)
• Trainable Dynamic Mask Sparse Attention [11.506985057671015]
  We introduce a trainable dynamic mask sparse attention mechanism, a method that merges the advantages of both position-aware and content-aware approaches.<n>We demonstrate that the introduced dynamic mask and sparse weights do not obstruct gradients, supporting end-to-end training.
  arXiv  Detail & Related papers  (2025-08-04T07:05:15Z)
• Sliding Window Attention Training for Efficient Large Language Models [55.56483740523027]
  We introduce SWAT, which enables efficient long-context handling via Sliding Window Attention Training.<n>This paper first attributes the inefficiency of Transformers to the attention sink phenomenon.<n>We replace softmax with the sigmoid function and utilize a balanced ALiBi and Rotary Position Embedding for efficient information compression and retention.
  arXiv  Detail & Related papers  (2025-02-26T05:31:44Z)
• Birdie: Advancing State Space Models with Reward-Driven Objectives and Curricula [23.071384759427072]
  State space models (SSMs) offer advantages over Transformers but struggle with tasks requiring long-range in-context retrieval-like text copying, associative recall, and question answering over long contexts.<n>We propose a novel training procedure, Birdie, that significantly enhances the in-context retrieval capabilities of SSMs without altering their architecture.
  arXiv  Detail & Related papers  (2024-11-01T21:01:13Z)
• Sparse-DySta: Sparsity-Aware Dynamic and Static Scheduling for Sparse Multi-DNN Workloads [65.47816359465155]
  Running multiple deep neural networks (DNNs) in parallel has become an emerging workload in both edge devices. We propose Dysta, a novel scheduler that utilizes both static sparsity patterns and dynamic sparsity information for the sparse multi-DNN scheduling. Our proposed approach outperforms the state-of-the-art methods with up to 10% decrease in latency constraint violation rate and nearly 4X reduction in average normalized turnaround time.
  arXiv  Detail & Related papers  (2023-10-17T09:25:17Z)
• Dynamic Perceiver for Efficient Visual Recognition [87.08210214417309]
  We propose Dynamic Perceiver (Dyn-Perceiver) to decouple the feature extraction procedure and the early classification task. A feature branch serves to extract image features, while a classification branch processes a latent code assigned for classification tasks. Early exits are placed exclusively within the classification branch, thus eliminating the need for linear separability in low-level features.
  arXiv  Detail & Related papers  (2023-06-20T03:00:22Z)
• FAMO: Fast Adaptive Multitask Optimization [48.59232177073481]
  We introduce Fast Adaptive Multitask Optimization FAMO, a dynamic weighting method that decreases task losses in a balanced way. Our results indicate that FAMO achieves comparable or superior performance to state-of-the-art gradient manipulation techniques.
  arXiv  Detail & Related papers  (2023-06-06T15:39:54Z)
• Performance Embeddings: A Similarity-based Approach to Automatic Performance Optimization [71.69092462147292]
  Performance embeddings enable knowledge transfer of performance tuning between applications. We demonstrate this transfer tuning approach on case studies in deep neural networks, dense and sparse linear algebra compositions, and numerical weather prediction stencils.
  arXiv  Detail & Related papers  (2023-03-14T15:51:35Z)
• DyTox: Transformers for Continual Learning with DYnamic TOken eXpansion [89.92242000948026]
  We propose a transformer architecture based on a dedicated encoder/decoder framework. Through a dynamic expansion of special tokens, we specialize each forward of our decoder network on a task distribution. Our strategy scales to a large number of tasks while having negligible memory and time overheads.
  arXiv  Detail & Related papers  (2021-11-22T16:29:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.