Scheduling Bag-of-Task-Chains in Distributed Systems

Distributed resources required for processing complex parallel applications are becoming larger in scale day-by-day. They need to be used efficiently in order to provide Quality of Service (QoS). Therefore, resource allocation and scheduling are of paramount importance. In this paper we investigate issues involved with the scheduling of parallel jobs that are bag-of-task-chains in distributed systems. Two task-chain scheduling techniques in two different cases of resource allocation are studied. The performance of the task-chain scheduling algorithms is evaluated via simulation, under different cases of system workload. The experimental results show that the performance of the task-chain scheduling strategies depends on the employed resource allocation techniques.