Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können derzeit keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted currently.)

Decentralized load balancing for highly irregular search problems

Cite This

Files in this item

Checksum: MD5:195cdacb9d0405962091fa120b164f75

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

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

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Berthold, Michael R.</dc:creator> <dc:contributor>Di Fatta, Giuseppe</dc:contributor> <dcterms:issued>2007</dcterms:issued> <dc:creator>Di Fatta, Giuseppe</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:rights rdf:resource=""/> <dc:contributor>Berthold, Michael R.</dc:contributor> <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=""/> <dcterms:available rdf:datatype="">2011-03-23T10:15:51Z</dcterms:available> <dcterms:title>Decentralized load balancing for highly irregular search problems</dcterms:title> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:bibliographicCitation>Microprocessors and microsystems, 31 (2007), 4. - S. 273-281</dcterms:bibliographicCitation> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource=""/> <dc:date rdf:datatype="">2011-03-23T10:15:51Z</dc:date> <bibo:uri rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Decentralized load balancing-erl.pdf 522

This item appears in the following Collection(s)

Search KOPS


My Account