Mapping DAG-based applications to multiclusters with background workload

Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG-based application) to be executed at each computational resource are determined. The tasks are then sent to the corresponding resources, where they are orchestrated in the pre-designed pattern to complete the work. Most DAG mapping policies in the literature assume that each computational resource is a processing node of a single processor, i.e. the tasks mapped to a resource are to be run in sequence. Our studies demonstrate that if the resource is actually a cluster with multiple processing nodes, this assumption will cause a misperception in the tasks’ execution time and execution order. This will disturb the pre-designed cooperation among tasks so that the expected performance cannot be achieved. In this paper, a DAG mapping algorithm is presented for multicluster architectures. Each constituent cluste...

• Type: Conference
• Year: 2005
• Where: CCGRID
• Authors: Ligang He, Stephen A. Jarvis, Daniel P. Spooner, David A. Bacigalupo, Guang Tan, Graham R. Nudd
• Keywords: CCGRID 2005, Cluster Computing, DAG Mapping, DAG Mapping Policies, DAG Mapping Policy