A Regional Matchmaking Technique for Improving Efficiency in Volunteer Computing Environment

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.