CQUniversity
Browse

File(s) not publicly available

Achieving dynamic workload balancing for P2P Volunteer Computing

conference contribution
posted on 2017-12-06, 00:00 authored by Wei LiWei Li, Wanwu GuoWanwu Guo, E Franzinelli
This paper argues that the decentralization feature of Peer-to-Peer (P2P) overlay is more suitable for Volunteer Computing (VC), compared to the centralized master/worker structure in terms of performance bottleneck and single point of failure. Based on the P2P overlay Chord, this paper focused on the design of a workload balancing protocol to coordinate VC. The goal of the protocol was to maximize overall speed-up against the heterogeneity and churn of volunteers. The roles of a facilitator and volunteers (peers) were defined; the key components were designed, including job, result and container. Distributed workload balancing algorithms were proposed to direct the workflow of the key roles for joining and leaving, job search and distribution and result collection. Criteria and metrics were proposed to evaluate the algorithms in regards to the effectiveness against churn and the overall speed-up against number of volunteers. Simulations were devised and completed upon the N-Queen Problem to measure these qualities. Conclusions confirmed that the results were on the right track.

History

Parent Title

Proceedings of The 44th International Conference on Parallel Processing (ICPP-2015) Workshops, 1-4 September 2015, Beijing, China.

Start Page

240

End Page

249

Number of Pages

10

Start Date

2015-01-01

Finish Date

2015-01-01

ISSN

1530-2016

ISBN-13

9781467375894

Location

Beijing, China

Publisher

IEEE

Place of Publication

Piscataway, NJ

Peer Reviewed

  • Yes

Open Access

  • No

External Author Affiliations

CQUniversity Student; School of Engineering and Technology (2013- );

Era Eligible

  • Yes

Name of Conference

International Conference on Parallel Processing Workshops

Usage metrics

    CQUniversity

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC