File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.jpdc.2011.10.010
- Scopus: eid_2-s2.0-84855405449
- WOS: WOS:000299139000018
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Decentralized Proactive Resource Allocation for Maximizing Throughput of P2P Grid
Title | Decentralized Proactive Resource Allocation for Maximizing Throughput of P2P Grid | ||||||
---|---|---|---|---|---|---|---|
Authors | |||||||
Keywords | Autonomous decision Capacity distribution Computational resources Computing power Conflict probability | ||||||
Issue Date | 2012 | ||||||
Publisher | Academic 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? | ||||||
Abstract | Peer-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 Identifier | http://hdl.handle.net/10722/152489 | ||||||
ISSN | 2023 Impact Factor: 3.4 2023 SCImago Journal Rankings: 1.187 | ||||||
ISI Accession Number ID |
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 Field | Value | Language |
---|---|---|
dc.contributor.author | Di, S | en_US |
dc.contributor.author | Wang, CL | en_US |
dc.date.accessioned | 2012-06-26T06:39:37Z | - |
dc.date.available | 2012-06-26T06:39:37Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | Journal of Parallel and Distributed Computing, 2012, v. 72 n. 2, p. 308-321 | en_US |
dc.identifier.issn | 0743-7315 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/152489 | - |
dc.description.abstract | Peer-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.language | eng | en_US |
dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc | en_US |
dc.relation.ispartof | Journal of Parallel and Distributed Computing | en_US |
dc.subject | Autonomous decision | en_US |
dc.subject | Capacity distribution | en_US |
dc.subject | Computational resources | en_US |
dc.subject | Computing power | en_US |
dc.subject | Conflict probability | - |
dc.title | Decentralized Proactive Resource Allocation for Maximizing Throughput of P2P Grid | en_US |
dc.type | Article | en_US |
dc.identifier.email | Di, S: sdi@cs.hku.hk | en_US |
dc.identifier.email | Wang, CL: clwang@cs.hku.hk | - |
dc.identifier.authority | Wang, CL=rp00183 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/j.jpdc.2011.10.010 | en_US |
dc.identifier.scopus | eid_2-s2.0-84855405449 | en_US |
dc.identifier.hkuros | 201834 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84855405449&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 72 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 308 | en_US |
dc.identifier.epage | 321 | en_US |
dc.identifier.eissn | 1096-0848 | - |
dc.identifier.isi | WOS:000299139000018 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Wang, CL=7501646188 | en_US |
dc.identifier.scopusauthorid | Di, S=22733353300 | en_US |
dc.identifier.citeulike | 10000402 | - |
dc.identifier.issnl | 0743-7315 | - |