LAUSR

The heterogeneous computing system (HCS), which is used to deal with complex and enormous business or scientific workflows, is playing a very important role as cloud computing rapidly develops. For multiple workflows computing in HCS, one of challenging issues is how to make a reasonable tradeoff between the schedule length and energy consumption. In this paper, we focus on a workflow that can be represented by a directed acyclic graph (DAG). We propose the corresponding algorithms which cooperate with dynamic voltage and frequency scaling (DVFS) technique to address the aforementioned concern and evaluate the algorithms in terms of randomly generated DAGs, real application DAGs and their hybrids under DVFS-enabled HCS. From the experimental results, we draw the conclusion that interleaving workflows lead to a better average tradeoff when scheduling multiple workflows in HCS.