Shuming Sha1,2, Naiwang Guo3, Wang Luo1,2, Yong Zhang1,2,*
CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 5105-5124, 2024, DOI:10.32604/cmc.2024.049584
Abstract This paper focuses on the scheduling problem of workflow tasks that exhibit interdependencies. Unlike independent batch tasks, workflows typically consist of multiple subtasks with intrinsic correlations and dependencies. It necessitates the distribution of various computational tasks to appropriate computing node resources in accordance with task dependencies to ensure the smooth completion of the entire workflow. Workflow scheduling must consider an array of factors, including task dependencies, availability of computational resources, and the schedulability of tasks. Therefore, this paper delves into the distributed graph database workflow task scheduling problem and proposes a workflow scheduling methodology based… More >