Dynamic competition perception workflow scheduling method for heterogeneous computing system

By constructing a scheduling problem model and a dynamic contention-aware simulator, and combining genetic algorithms and ant colony algorithms, task scheduling and bus allocation are optimized, solving the scheduling deviation problem caused by dynamic contention in CPU-FPGA heterogeneous computing systems, and improving resource utilization and completion time.

CN121541992APending Publication Date: 2026-02-17HANGZHOU DIANZI UNIV
0 Cites 1 Cited by

Patent Information

Application Number
CN202511634760.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-11-10
Publication Date
2026-02-17

AI Technical Summary

Technical Problem

Existing technologies in CPU-FPGA heterogeneous computing systems neglect the dynamic competition between multiple concurrent data transmissions under a shared bus, leading to scheduling deviations and making it difficult to reflect the impact of instantaneous load fluctuations on effective bandwidth, thus affecting the system's total completion time and resource utilization.

Method used

A dynamic contention-aware scheduling method is adopted. By constructing a scheduling problem model and a dynamic contention-aware simulator, and combining the hybrid earliest-to-complete time genetic algorithm and the quota-weighted ant colony algorithm, task scheduling and bus allocation are optimized to generate high-precision scheduling solutions and dynamically evaluate effective bandwidth and transmission completion conditions.

Benefits of technology

It improves the resource utilization and scheduling accuracy of heterogeneous computing systems, shortens the total completion time of workflows, and is suitable for real heterogeneous computing systems.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

A dynamic competition perception workflow scheduling method for a heterogeneous computing system comprises the following steps: constructing a scheduling problem model based on a scheduling object set and bus resources of an obtained system; constructing a dynamic competition perception simulator according to the scheduling problem model, wherein the method comprises the following steps of: decomposing a time-varying behavior of cross-domain bus data transmission into a time-invariant meta-process; each meta-process is mapped into a timeout event carrying a specific timestamp; the completion event indicates that all the timeout events to which the same scheduling object belongs are completed, so that the end of the task or cross-domain bus data transmission is marked; according to an event-driven mechanism, a completion event is arranged on the premise that the preorder constraint of a scheduling object is met, and total completion time estimation is generated while integration of multiple scheduling strategies is supported; according to the total completion time estimation, generating an approximate optimal scheduling solution by using a hybrid earliest completion time genetic algorithm; and optimizing the approximate optimal scheduling solution by adopting a quota weighted ant colony algorithm to generate a final scheduling solution.
Need to check novelty before this filing date? Find Prior Art