Dynamic Load Balancing for the Distributed Mining of Molecular Structures


Dateien zu dieser Ressource

Prüfsumme: MD5:8b8857e72d37e606c8b1a8595503408d

DI FATTA, Giuseppe, Michael R. BERTHOLD, 2006. Dynamic Load Balancing for the Distributed Mining of Molecular Structures. In: IEEE Transactions on Parallel and Distributed Systems. 17(8), pp. 773-785

@article{Di Fatta2006Dynam-5670, title={Dynamic Load Balancing for the Distributed Mining of Molecular Structures}, year={2006}, doi={10.1109/TPDS.2006.101}, number={8}, volume={17}, journal={IEEE Transactions on Parallel and Distributed Systems}, pages={773--785}, author={Di Fatta, Giuseppe and Berthold, Michael R.} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5670"> <dc:creator>Berthold, Michael R.</dc:creator> <dcterms:bibliographicCitation>First publ. in: IEEE Transactions on Parallel and Distributed Systems 17 (2006), 8, pp. 773-785</dcterms:bibliographicCitation> <dc:contributor>Di Fatta, Giuseppe</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5670"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:14Z</dcterms:available> <dc:creator>Di Fatta, Giuseppe</dc:creator> <dc:rights>deposit-license</dc:rights> <dcterms:title>Dynamic Load Balancing for the Distributed Mining of Molecular Structures</dcterms:title> <dc:contributor>Berthold, Michael R.</dc:contributor> <dcterms:abstract xml:lang="eng">In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a nondedicated computational environment. These features make it suitable for large-scale, multidomain, heterogeneous environments, such as computational grids.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:14Z</dc:date> <dc:language>eng</dc:language> <dcterms:issued>2006</dcterms:issued> <dc:format>application/pdf</dc:format> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

FaBe06_DistrMofa_ieeetds.pdf 85

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Mein Benutzerkonto