The Library
Performance evaluation of scheduling applications with DAG topologies on multiclusters with independent local schedulers
Tools
He, Ligang, Jarvis, Stephen A., Spooner, Daniel P. and Nudd, G. R. (2006) Performance evaluation of scheduling applications with DAG topologies on multiclusters with independent local schedulers. In: 5th International Workshop on Performance Modelling, Evaluation and Optimization of Parallel and Distributed Systems (PMEO'06), Rhodes Island, Greece, 25-29 Apr 2006. Published in: 20th International Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. ISBN 1424400546. doi:10.1109/IPDPS.2006.1639635
PDF
performance_evaluation_of_scheduling_applications_with_dag_topologies_on_multiclusters_with_independent_local_schedulers.pdf - Published Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (124Kb) |
Official URL: http://dx.doi.org/10.1109/IPDPS.2006.1639635
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: | 20th International Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. | ||||
Publisher: | IEEE | ||||
ISBN: | 1424400546 | ||||
Official Date: | 2006 | ||||
Dates: |
|
||||
DOI: | 10.1109/IPDPS.2006.1639635 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Date of first compliant deposit: | 27 December 2015 | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | 5th International Workshop on Performance Modelling, Evaluation and Optimization of Parallel and Distributed Systems (PMEO'06) | ||||
Type of Event: | Workshop | ||||
Location of Event: | Rhodes Island, Greece | ||||
Date(s) of Event: | 25-29 Apr 2006 | ||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |