Summary
Volunteer computing is a computing paradigm in which the operations of a large-scale application are processed by idle resources of Internet-connected computers. The redundant-work distribution techniques are mainly used to exclude the malicious participants in the volunteer computing environment. However, the techniques cause some problems like delay of the work completion time or inefficiency of the work execution due to continuous requests of the work redistribution which arise from the reason that the techniques do not consider the characteristics of works and dynamic resources. To cope with such problems this paper suggests a regional matchmaking technique which can redistribute works in consideration of the characteristics of the works and the participant resources.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Luis, F.G.S., Satoshi, H.: Bayanihan: building and studying web-based vol-unteer computing systems using Java, pp. 675–686. Elsevier Science Publishers B. V, Amsterdam (1999)
Choi, J.H., et al.: Non-disturbance Scheduling based on User Usage Pattern for Volunteer Computing. In: Proc. of International Conference on Convergence Technology and Information Convergence (2007)
Anderson, D.P., Korpela, E., Walton, R.: High-performance task distribu-tion for volunteer computing. In: Proc. of First International Conference on e-Science and Grid Computing (2005)
Uppuluri, P., et al.: P2P grid: service oriented framework for distributed re-source management. In: Proc. of IEEE International Conference on Services Computing (2005)
Chakravarti, A.J., Baumgartner, G., Lauria, M.: The organic grid: self-organizing computation on a peer-to-peer network. IEEE Transactions on Sys-tems, Man and Cybernetics, Part A 35(3), 373–384 (2005)
Alain Roy, M.L.: Condor and preemptive resume scheduling, pp. 135–144 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheon, E., Kim, M., Kuk, S., Kim, H.S. (2011). A Regional Matchmaking Technique for Improving Efficiency in Volunteer Computing Environment. In: Lee, R. (eds) Computers,Networks, Systems, and Industrial Engineering 2011. Studies in Computational Intelligence, vol 365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21375-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21375-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21374-8
Online ISBN: 978-3-642-21375-5
eBook Packages: EngineeringEngineering (R0)