Scheduling Algorithm Based on Storage Capacity of Communicat

发布时间：2024-01-27 03:35

　　In this paper, the storage capacity of communication among cores and processors is taken into account and a maximum D-value-first algorithm is proposed. By improving the hardware parallelism in the task execution process, the maximum storage requirements for communication are minimized. Experimental results with various directed acyclic graph models showed that compared with the earliest-task-first algorithm, the storage requirements for communication were reduced by 22.46%, on average, while th...

【文章页数】：5 页


本文编号：3886227