Decentralized load balancing for highly irregular search problems

Zitieren

Dateien zu dieser Ressource

Prüfsumme: 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="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/rdf/resource/123456789/3031"> <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"/> <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="https://kops.uni-konstanz.de/bitstream/123456789/3031/1/Decentralized%20load%20balancing-erl.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:51Z</dcterms:available> <dcterms:title>Decentralized load balancing for highly irregular search problems</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:bibliographicCitation>Microprocessors and microsystems, 31 (2007), 4. - S. 273-281</dcterms:bibliographicCitation> <dc:rights>deposit-license</dc:rights> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:51Z</dc:date> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3031"/> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3031/1/Decentralized%20load%20balancing-erl.pdf"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Decentralized load balancing-erl.pdf 155

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto