Scheduling scientific workflow in a distributed computing resource is a challenging job. It involves heterogeneous resource allocation to concurrent tasks in order to achieve the desired scheduling goal. In this paper, we are presenting a multi-workflow Earliest Cycle Time algorithm, mECT. The objective of the algorithm is to reduce schedule length while ensuring no deadlock situation occurs due to dependency violation. The algorithm is suitable for multi workflow applications that deal with large data sets and run in a cyclic order. We have carried out extensive simulations to compare the proposed algorithm with well known existing algorithms. We have also tested our algorithm for a low resolution (N48) weather Unified Model (UM-10.2) in a simulated environment developed by the Met Office, United Kingdom. Results show that mECT performs better in terms of shorter makespan and lesser deadlocks.

中文翻译：

---

异构计算集群中的多工作流并发调度

在分布式计算资源中安排科学工作流是一项艰巨的任务。它涉及对并发任务的异构资源分配，以实现所需的调度目标。在本文中，我们提出了一种多工作流最早周期时间算法mECT。该算法的目的是减少调度程序的长度，同时确保不会因依赖冲突而发生死锁情况。该算法适用于处理大型数据集并以循环顺序运行的多工作流应用程序。我们已经进行了广泛的仿真，以将提出的算法与众所周知的现有算法进行比较。我们还在英国Met Office开发的模拟环境中测试了针对低分辨率（N48）天气统一模型（UM-10.2）的算法。