File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Conflict-minimizing dynamic load balancing for P2P desktop Grid

TitleConflict-minimizing dynamic load balancing for P2P desktop Grid
Authors
KeywordsArrival rates
Bernoulli trials
Conflict probability
Decentralized resource allocation
Dynamic load balancing
Issue Date2010
PublisherIEEE.
Citation
The 11th IEEE/ACM International Conference on Grid Computing (Grid 2010), Brussels, Belgium, 25-28 October 2010. In Proceeedings of 11th Grid, 2010, p. 137-144 How to Cite?
AbstractFully decentralized resource allocation for P2P desktop Grid allows each participating node to act as both resource provider and requester. The system performance indicators (including throughput, makespan, etc) are easily degraded by the unbalanced load distribution, which is probably caused by the fast-changing states of heterogeneous resources due to arbitrary task submissions. Although the cooperative load rebalancing methods can mitigate the problem, they are likely to introduce the contention on under-utilized resources with growing task arrival rates, leading to the sub-optimal load balancing efficacy. Our focus is on how to optimize load balancing status by taking into account minimizing the conflict of autonomic task migration decisions in P2P desktop Grid. Our load rebalancing process is modeled as a set of independent stochastic Bernoulli trials by letting each heavily loaded node push its surplus loads to its surrounding lightly loaded nodes. We proved that the surplus load amount should be shifted based on a proper ratio by considering decision conflicts and designed a novel load balancing algorithm with provably small decision conflict probability. We derived an upper-bound for this probability, which will be reduced down to about 2% under our algorithm. Finally, we validated via simulation that the system performance can be significantly improved accordingly. © 2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/125712
ISBN
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorDi, Sen_HK
dc.contributor.authorWang, CLen_HK
dc.date.accessioned2010-10-31T11:47:31Z-
dc.date.available2010-10-31T11:47:31Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 11th IEEE/ACM International Conference on Grid Computing (Grid 2010), Brussels, Belgium, 25-28 October 2010. In Proceeedings of 11th Grid, 2010, p. 137-144en_HK
dc.identifier.isbn978-1-4244-9349-4-
dc.identifier.issn1550-5510en_HK
dc.identifier.urihttp://hdl.handle.net/10722/125712-
dc.description.abstractFully decentralized resource allocation for P2P desktop Grid allows each participating node to act as both resource provider and requester. The system performance indicators (including throughput, makespan, etc) are easily degraded by the unbalanced load distribution, which is probably caused by the fast-changing states of heterogeneous resources due to arbitrary task submissions. Although the cooperative load rebalancing methods can mitigate the problem, they are likely to introduce the contention on under-utilized resources with growing task arrival rates, leading to the sub-optimal load balancing efficacy. Our focus is on how to optimize load balancing status by taking into account minimizing the conflict of autonomic task migration decisions in P2P desktop Grid. Our load rebalancing process is modeled as a set of independent stochastic Bernoulli trials by letting each heavily loaded node push its surplus loads to its surrounding lightly loaded nodes. We proved that the surplus load amount should be shifted based on a proper ratio by considering decision conflicts and designed a novel load balancing algorithm with provably small decision conflict probability. We derived an upper-bound for this probability, which will be reduced down to about 2% under our algorithm. Finally, we validated via simulation that the system performance can be significantly improved accordingly. © 2010 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.-
dc.relation.ispartofProceedings of the 11th IEEE/ACM International Workshop on Grid Computing, Grid 2010en_HK
dc.rightsProceedings of the 11th IEEE/ACM International Workshop on Grid Computing. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectArrival rates-
dc.subjectBernoulli trials-
dc.subjectConflict probability-
dc.subjectDecentralized resource allocation-
dc.subjectDynamic load balancing-
dc.titleConflict-minimizing dynamic load balancing for P2P desktop Griden_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-9349-4&volume=&spage=137&epage=144&date=2010&atitle=Conflict-minimizing+dynamic+load+balancing+for+P2P+desktop+grid-
dc.identifier.emailWang, CL:clwang@cs.hku.hken_HK
dc.identifier.authorityWang, CL=rp00183en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/GRID.2010.5697946en_HK
dc.identifier.scopuseid_2-s2.0-79951590474en_HK
dc.identifier.hkuros179401en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79951590474&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage137en_HK
dc.identifier.epage144en_HK
dc.publisher.placeUnited Statesen_HK
dc.description.otherThe 11th IEEE/ACM International Conference on Grid Computing (Grid 2010), Brussels, Belgium, 25-28 October 2010. In Proceeedings of 11th Grid, 2010, p. 137-144-
dc.identifier.scopusauthoridDi, S=22733353300en_HK
dc.identifier.scopusauthoridWang, CL=7501646188en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats