Decentralized load balancing for highly irregular search problems

Di Fatta, Giuseppe; Berthold, Michael R.

Decentralized load balancing for highly irregular search problems

Dateien

Decentralized load balancing-erl.pdfGröße: 5.34 MBDownloads: 426

Datum

2007

Autor:innen

Di Fatta, Giuseppe

Berthold, Michael R.

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Microprocessors and Microsystems. 2007, 31(4), pp. 273-281. ISSN 0141-9331. eISSN 1872-9436. Available under: doi: 10.1016/j.micpro.2007.01.004

Zusammenfassung

In this paper, we present a distributed computing framework for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available. The framework is based on a peer-to-peer computing environment and dynamic load balancing. The system allows for dynamic resource aggregation, does not depend on any specific meta-computing middleware and is suitable for large-scale, multi-domain, heterogeneous environments, such as computational Grids. Dynamic load balancing policies based on global statistics are known to provide optimal load balancing performance, while randomized techniques provide high scalability. The proposed method combines both advantages and adopts distributed job-pools and a randomized polling technique. The framework has been successfully adopted in a parallel search algorithm for subgraph mining and evaluated on a molecular compounds dataset. The parallel application has shown good scalability and close-to linear speedup in a distributed network of workstations.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

distributed computing, dynamic load balancing, irregular search problems, peer-to-peer-computing, subgraph mining

Zitieren

ISO 690

DI FATTA, Giuseppe, Michael R. BERTHOLD, 2007. Decentralized load balancing for highly irregular search problems. In: Microprocessors and Microsystems. 2007, 31(4), pp. 273-281. ISSN 0141-9331. eISSN 1872-9436. Available under: doi: 10.1016/j.micpro.2007.01.004

BibTex

@article{DiFatta2007Decen-3031,
  year={2007},
  doi={10.1016/j.micpro.2007.01.004},
  title={Decentralized load balancing for highly irregular search problems},
  number={4},
  volume={31},
  issn={0141-9331},
  journal={Microprocessors and Microsystems},
  pages={273--281},
  author={Di Fatta, Giuseppe and Berthold, Michael R.}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/3031">
    <dcterms:abstract xml:lang="eng">In this paper, we present a distributed computing framework for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available. The framework is based on a peer-to-peer computing environment and dynamic load balancing. The system allows for dynamic resource aggregation, does not depend on any specific meta-computing middleware and is suitable for large-scale, multi-domain, heterogeneous environments, such as computational Grids. Dynamic load balancing policies based on global statistics are known to provide optimal load balancing performance, while randomized techniques provide high scalability. The proposed method combines both advantages and adopts distributed job-pools and a randomized polling technique. The framework has been successfully adopted in a parallel search algorithm for subgraph mining and evaluated on a molecular compounds dataset. The parallel application has shown good scalability and close-to linear speedup in a distributed network of workstations.</dcterms:abstract>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3031/1/Decentralized%20load%20balancing-erl.pdf"/>
    <dcterms:bibliographicCitation>Microprocessors and microsystems, 31 (2007), 4. - S. 273-281</dcterms:bibliographicCitation>
    <dc:creator>Di Fatta, Giuseppe</dc:creator>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dcterms:title>Decentralized load balancing for highly irregular search problems</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3031"/>
    <dcterms:issued>2007</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:51Z</dcterms:available>
    <dc:contributor>Di Fatta, Giuseppe</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3031/1/Decentralized%20load%20balancing-erl.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:51Z</dc:date>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja