Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/4982
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLuo, P-
dc.contributor.authorLü, K-
dc.contributor.authorHuang, R-
dc.contributor.authorHe, Q-
dc.contributor.authorShi, Z-
dc.date.accessioned2011-04-08T13:14:11Z-
dc.date.available2011-04-08T13:14:11Z-
dc.date.issued2006-
dc.identifier.citationExpert Systems 23(5): 258-272, Nov 2006en_US
dc.identifier.issn0266-4720-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/4982-
dc.identifier.urihttp://onlinelibrary.wiley.com/doi/10.1111/j.1468-0394.2006.00408.x/abstracten
dc.descriptionThis is an open access article, that can be obtained from the link below- Copyright @ 2006 Wiley-Blackwellen_US
dc.description.abstractThe computing-intensive data mining (DM) process calls for the support of a heterogeneous computing system, which consists of multiple computers with different configurations connected by a high-speed large-area network for increased computational power and resources. The DM process can be described as a multi-phase pipeline process, and in each phase there could be many optional methods. This makes the workflow for DM very complex and it can be modeled only by a directed acyclic graph (DAG). A heterogeneous computing system needs an effective and efficient scheduling framework, which orchestrates all the computing hardware to perform multiple competitive DM workflows. Motivated by the need for a practical solution of the scheduling problem for the DM workflow, this paper proposes a dynamic DAG scheduling algorithm according to the characteristics of an execution time estimation model for DM jobs. Based on an approximate estimation of job execution time, this algorithm first maps DM jobs to machines in a decentralized and diligent (defined in this paper) manner. Then the performance of this initial mapping can be improved through job migrations when necessary. The scheduling heuristic used considers the factors of both the minimal completion time criterion and the critical path in a DAG. We implement this system in an established multi-agent system environment, in which the reuse of existing DM algorithms is achieved by encapsulating them into agents. The system evaluation and its usage in oil well logging analysis are also discussed.en_US
dc.language.isoenen_US
dc.publisherWiley-Blackwellen_US
dc.subjectData miningen_US
dc.subjectHeterogeneous computingen_US
dc.subjectDirected acyclic graphen_US
dc.subjectMulti-agent system environmenten_US
dc.titleA heterogeneous computing system for data mining workflows in multi-agent environmentsen_US
dc.typeResearch Paperen_US
dc.identifier.doihttp://dx.doi.org/10.1111/j.1468-0394.2006.00408.x-
Appears in Collections:Business and Management
Brunel Business School Research Papers

Files in This Item:
There are no files associated with this item.


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.