Abstract. Next-generation computational sciences feature large-scale workflows of many computing modules that must be deployed and executed in distributed network environments. With limited computing resources, it is often unavoidable to map multiple workflow modules to the same computer node with possible concurrent module execution, whose scheduling may significantly affect the workflow's end-to-end performance in the network. We formulate this on-node workflow scheduling problem as an optimization problem and prove it to be NPcomplete. We then conduct a deep investigation into workflow execution dynamics and propose a Critical Path-based Priority Scheduling (CPPS) algorithm to achieve Minimum End-to-end Delay (MED) under a given workflow mapping scheme. The performance superiority of the proposed CPPS algorithm is illustrated by extensive simulation results in comparison with a traditional fair-share (FS) scheduling policy and is further verified by proof-of-concept experiments based on a real-life scientific workflow for climate modeling deployed and executed in a testbed network.
The work in REF investigates the task scheduling problem for Minimum End-to-end Delay (MED) in unitary processing applications under a given workflow mapping scheme, and shows that the performance could be improved by deciding an appropriate resource sharing policy among concurrent workflow modules mapped to the same node.
On Workflow Scheduling for End-to-End Performance Optimization in Distributed Network Environments
JSSPP
Computer Science