Home
Author Guide
Editor Guide
Reviewer Guide
Special Issues
Special Issue Introduction
Special Issues List
Topics
Published Issues
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2010
2009
2008
2007
2006
journal menu
Aims and Scope
Editorial Board
Indexing Service
Article Processing Charge
Open Access Policy
Publication Ethics
Digital Preservation Policy
Editorial Process
Subscription
Contact Us
General Information
ISSN:
1796-2021 (Online); 2374-4367 (Print)
Abbreviated Title:
J. Commun.
Frequency:
Monthly
DOI:
10.12720/jcm
Abstracting/Indexing:
Scopus
;
DBLP
;
CrossRef
,
EBSCO
,
Google Scholar
;
CNKI,
etc.
E-mail questions
or comments to
editor@jocm.us
Acceptance Rate:
27%
APC:
800 USD
Average Days to Accept:
88 days
3.4
2023
CiteScore
51st percentile
Powered by
Article Metrics in Dimensions
Editor-in-Chief
Prof. Maode Ma
College of Engineering, Qatar University, Doha, Qatar
I'm very happy and honored to take on the position of editor-in-chief of JCM, which is a high-quality journal with potential and I'll try my every effort to bring JCM to a next level...
[Read More]
What's New
2024-08-20
Vol. 19, No. 8 has been published online!
2024-07-22
Vol. 19, No. 7 has been published online!
2024-06-20
Volume 19, No. 4 has been indexed by Scopus.
Home
>
Published Issues
>
2017
>
Volume 12 No.10, October. 2017
>
Work Stealing Based Volunteer Computing Coordination in P2P Environments
Wei Li and William W. Guo
School of Engineering & Technology, Central Queensland University, Australia
Abstract
—This paper aims at the evaluation of work stealing based Volunteer Computing (VC) coordination with the goal of confirming the scalability of VC for Peer-to-Peer (P2P) environments. Our previous work has successfully modelled work stealing for VC coordination and been evaluated by a few applications and a small number of machines. However, this paper argues that the evaluation of scalability of VC by the statistical data of real world applications or through mathematical modelling is either limited by the number of volunteer machines or difficult to achieve because of the peer churn in P2P opportunistic environments. This paper proposes a simulation model for the same VC functions but performing the virtual work so that the statistical data can be quickly obtained for the dynamic behaviors of a large number of volunteers. The initial evaluation results have demonstrated that the work stealing based VC coordination scales up to 10K volunteers against varying churn rate, communication cost and stealing granularity. The confirmation of scalability ensures that VC can be effectively applied to P2P opportunistic environments.
Index Terms
—Work stealing, simulation, volunteer computing, peer-to-peer.
Cite: Wei Li and William W. Guo, "Work Stealing Based Volunteer Computing Coordination in P2P Environments," Journal of Communications, vol. 12, no. 10, pp. 557-564, 2017. Doi: 10.12720/jcm.12.10.557-564.
2
PREVIOUS PAPER
A Comparative Study on Improving Quality of Service in Networks Carrying Multi-Service Level Data over Resource-Limited Multi-Hop Wireless Networks
NEXT PAPER
Audit of a Real Wi-Fi Deployment to Provide Data, VoIP Communications and an IIoT Item Location Service