The Library
Mapping DAG-based applications to multiclusters with background workload
Tools
He, Ligang, Jarvis, Stephen A., Spooner, Daniel P., Bacigalupo, David A., Tan, G. and Nudd, G. R. (2005) Mapping DAG-based applications to multiclusters with background workload. In: 5th IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2005), Cardiff, Wales, 09-12 May 2005. Published in: IEEE International Symposium on Cluster Computing and the Grid, 2005. CCGrid 2005. , Volume 2 pp. 855-862. ISBN 0780390741. doi:10.1109/CCGRID.2005.1558651
PDF
ccgrid05_cameraReady.pdf - Published Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (223Kb) |
Official URL: http://dx.doi.org/10.1109/CCGRID.2005.1558651
Abstract
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 cluster in the multicluster is shared by background workload (from other users) and has its own independent local scheduler. The multicluster DAG mapping policy is based on theoretical analysis and its performance is evaluated through extensive experimental studies. The results show that compared with conventional DAG mapping policies, the new scheme that we present can significantly improve the scheduling performance of a DAG-based application in terms of the schedule length.
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Journal or Publication Title: | IEEE International Symposium on Cluster Computing and the Grid, 2005. CCGrid 2005. | ||||
Publisher: | IEEE | ||||
ISBN: | 0780390741 | ||||
Official Date: | 2005 | ||||
Dates: |
|
||||
Volume: | Volume 2 | ||||
Number of Pages: | 8 | ||||
Page Range: | pp. 855-862 | ||||
DOI: | 10.1109/CCGRID.2005.1558651 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Date of first compliant deposit: | 16 December 2015 | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | 5th IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2005) | ||||
Type of Event: | Conference | ||||
Location of Event: | Cardiff, Wales | ||||
Date(s) of Event: | 09-12 May 2005 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |