File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Decentralized Proactive Resource Allocation for Maximizing Throughput of P2P Grid

TitleDecentralized Proactive Resource Allocation for Maximizing Throughput of P2P Grid
Authors
KeywordsAutonomous decision
Capacity distribution
Computational resources
Computing power
Conflict probability
Issue Date2012
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc
Citation
Journal of Parallel and Distributed Computing, 2012, v. 72 n. 2, p. 308-321 How to Cite?
AbstractPeer-to-peer Desktop Grids provide integrated computational resources by leveraging autonomous desktop computers located at the edge of the Internet to offer high computing power. The arbitrary arrival and serving rates of tasks on peers impedes the high throughput in large-scale P2P Grids. We propose a novel autonomous resource allocation scheme, which can maximize the throughput of self-organizing P2P Grid systems. Our design possesses three key features: (1) high adaptability to dynamic environment by proactive and convex-optimal estimation of nodes' volatile states; (2) minimized task migration conflict probability (upper bound can be limited to 2%) of over-utilized nodes individually shifting surplus loads; (3) a load-status conscious gossip protocol for optimizing distributed resource discovery effect. Based on a real-life user's workload and capacity distribution, the simulation results show that our approach could get significantly improved throughput with 23.647.1% reduction on unprocessed workload compared to other methods. We also observe high scalability of our solution under dynamic peer-churning situations. © 2011 Elsevier Inc. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152489
ISSN
2015 Impact Factor: 1.32
2015 SCImago Journal Rankings: 0.851
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong RGCHKU 7179/09E
Hong Kong UGCSEC HKU09
Funding Information:

This research is supported by a Hong Kong RGC grant HKU 7179/09E and in part by a Hong Kong UGC Special Equipment Grant (SEC HKU09).

References

 

DC FieldValueLanguage
dc.contributor.authorDi, Sen_US
dc.contributor.authorWang, CLen_US
dc.date.accessioned2012-06-26T06:39:37Z-
dc.date.available2012-06-26T06:39:37Z-
dc.date.issued2012en_US
dc.identifier.citationJournal of Parallel and Distributed Computing, 2012, v. 72 n. 2, p. 308-321en_US
dc.identifier.issn0743-7315en_US
dc.identifier.urihttp://hdl.handle.net/10722/152489-
dc.description.abstractPeer-to-peer Desktop Grids provide integrated computational resources by leveraging autonomous desktop computers located at the edge of the Internet to offer high computing power. The arbitrary arrival and serving rates of tasks on peers impedes the high throughput in large-scale P2P Grids. We propose a novel autonomous resource allocation scheme, which can maximize the throughput of self-organizing P2P Grid systems. Our design possesses three key features: (1) high adaptability to dynamic environment by proactive and convex-optimal estimation of nodes' volatile states; (2) minimized task migration conflict probability (upper bound can be limited to 2%) of over-utilized nodes individually shifting surplus loads; (3) a load-status conscious gossip protocol for optimizing distributed resource discovery effect. Based on a real-life user's workload and capacity distribution, the simulation results show that our approach could get significantly improved throughput with 23.647.1% reduction on unprocessed workload compared to other methods. We also observe high scalability of our solution under dynamic peer-churning situations. © 2011 Elsevier Inc. All rights reserved.en_US
dc.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdcen_US
dc.relation.ispartofJournal of Parallel and Distributed Computingen_US
dc.subjectAutonomous decisionen_US
dc.subjectCapacity distributionen_US
dc.subjectComputational resourcesen_US
dc.subjectComputing poweren_US
dc.subjectConflict probability-
dc.titleDecentralized Proactive Resource Allocation for Maximizing Throughput of P2P Griden_US
dc.typeArticleen_US
dc.identifier.emailDi, S: sdi@cs.hku.hken_US
dc.identifier.emailWang, CL: clwang@cs.hku.hk-
dc.identifier.authorityWang, CL=rp00183en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.jpdc.2011.10.010en_US
dc.identifier.scopuseid_2-s2.0-84855405449en_US
dc.identifier.hkuros201834-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84855405449&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume72en_US
dc.identifier.issue2en_US
dc.identifier.spage308en_US
dc.identifier.epage321en_US
dc.identifier.eissn1096-0848-
dc.identifier.isiWOS:000299139000018-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridWang, CL=7501646188en_US
dc.identifier.scopusauthoridDi, S=22733353300en_US
dc.identifier.citeulike10000402-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats