An Integrated Scheduling Algorithm for Multi-Device-Processes with the Strategy of Exchanging Adjacent Parallel Processes of The Same Device

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

The current integrated scheduling algorithm ignores the influence of the pre-process on the post-process when solving the multi-device-process integrated scheduling problem, which leads to the problem of poor tightness between serial processes and low parallelism between parallel processes. This paper points out that there is no restriction of scheduling sequence between adjacent parallel processes on the same processing device, and the scheduling sequence between parallel processes on the same device can be flexibly processed to optimize the scheduling results, on the basis of the current algorithm scheduling scheme, this paper proposes the application of multi-device adjacent parallel process interchange strategy and multi-device adjacent parallel process interchange adjustment strategy, which avoid the influence of the pre-process on the post-process, improves the compactness of the serial process and the parallelism of the parallel process, and optimizes the scheduling results.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-06-05T02:00:03.366016+00:00
License: CC-BY-4.0