An Efficient Algorithm for Scheduling Jobs in Volunteer Computing Platforms

As a type of distributed computing, volunteer computing (VC) has provided unlimited computing capacity at a low cost in recent decades. The architecture of most volunteer computing platforms (VCPs) is a master–worker model, which defines a master–slave relationship. Therefore, VCPs can be considered asymmetric multiprocessing systems (AMSs). As AMSs, VCPs are very promising for providing computing services for users. Users can submit tasks with deadline constraints to the VCPs. If the tasks are completed within their deadlines, VCPs will obtain the benefits. For this application scenario, this paper proposes a new task assignment problem with the maximum benefits in VCPs for the first time. To address the problem, we first proposed a list-based task assignment (LTA) strategy, and we proved that the LTA strategy could complete the task with a deadline constraint as soon as possible. Then, based on the LTA strategy, we proposed a maximum benefit scheduling (MBS) algorithm, which aimed at maximizing the benefits of VCPs. The MBS algorithm determined the acceptable tasks using a pruning strategy. Finally, the experiment results show that our proposed algorithm is more effective than current algorithms in the aspects of benefits, task acceptance rate and task completion rate.

Download Full-text

A efficient algorithm for molecular dynamics simulation on hybrid CPU-GPU computing platforms

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) ◽

10.1109/fskd.2016.7603376 ◽

2016 ◽

Author(s):

Dapu Li ◽

Wei Ai ◽

Yu Ye ◽

Jie Liang

Keyword(s):

Molecular Dynamics ◽

Molecular Dynamics Simulation ◽

Efficient Algorithm ◽

Gpu Computing ◽

Dynamics Simulation ◽

Computing Platforms

Download Full-text

Task Assignment Algorithm Based on Trust in Volunteer Computing Platforms

Information ◽

10.3390/info10070244 ◽

2019 ◽

Vol 10 (7) ◽

pp. 244 ◽

Cited By ~ 1

Author(s):

Ling Xu ◽

Jianzhong Qiao ◽

Shukuan Lin ◽

Ruihua Qi

Keyword(s):

Completion Time ◽

Fuzzy Model ◽

Task Assignment ◽

Experimental Results ◽

Volunteer Computing ◽

Time Interval ◽

Reliability Model ◽

Assignment Algorithm ◽

Computing Platforms ◽

Task Segmentation

In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this paper, we propose two novel task assignment algorithms to minimize completion time (makespan) by a flexible task assignment. Firstly, this paper proposes a reliability model, which uses a simple fuzzy model to predict the time interval provided by a VN. This reliability model can reduce inconsistencies between the expected availability time and actual availability time. Secondly, based on the reliability model, this paper proposes an algorithm called EFTT (Earliest Finish Task based on Trust, EFTT), which can minimize makespan. However, EFTT may induce resource waste in task assignment. To make full use of computing resources and reduce task segmentation rate, an algorithm IEFTT (improved earliest finish task based on trust, IEFTT) is further proposed. Finally, experimental results verify the efficiency of the proposed algorithms.

Download Full-text

A Performance Study of Secure Data Mining on the Cell Processor

Cyber Crime ◽

10.4018/978-1-61350-323-2.ch416 ◽

2013 ◽

pp. 966-978

Author(s):

Hong Wang ◽

Hiroyuki Takizawa ◽

Hiroaki Kobayashi

Keyword(s):

Data Mining ◽

Clustering Algorithm ◽

Hardware Security ◽

Volunteer Computing ◽

Cell Processor ◽

Performance Study ◽

Sensitive Data ◽

Privacy And Security ◽

Secure Data ◽

Computing Platforms

This article examines the potential of the Cell processor as a platform for secure data mining on the future volunteer computing systems. Volunteer computing platforms have the potential to provide massive computing power. However, privacy and security concerns prevent using volunteer computing for data mining of sensitive data. The Cell processor comes with hardware security features. The secure volunteer data mining can be achieved by using those hardware security features. In this article, we present a general security scheme for the volunteer computing, and a secure parallelized K-Means clustering algorithm for the Cell processor. We also evaluate the performance of the algorithm on the Cell secure system simulator. Evaluation results indicate that the proposed secure data clustering outperforms a non-secure clustering algorithm on the general purpose CPU, but incurs a huge performance overhead introduced by the decryption process of the Cell security features. Possible optimization for the secure K-Means clustering is discussed.

Download Full-text

Model for Improved Load Balancing in Volunteer Computing Platforms

Information Systems - Lecture Notes in Business Information Processing ◽

10.1007/978-3-030-11395-7_13 ◽

2019 ◽

pp. 131-143

Author(s):

Levente Filep

Keyword(s):

Load Balancing ◽

Volunteer Computing ◽

Computing Platforms

Download Full-text

Adaptive Control of Redundant Task Execution for Dependable Volunteer Computing

Cloud, Grid and High Performance Computing ◽

10.4018/978-1-60960-603-9.ch009 ◽

2011 ◽

pp. 135-154

Author(s):

Hong Wang ◽

Yoshitomo Murata ◽

Hiroyuki Takizawa ◽

Hiroaki Kobayashi

Keyword(s):

Adaptive Control ◽

Failure Probability ◽

Task Assignment ◽

Probability Estimation ◽

Volunteer Computing ◽

Data Sets ◽

Task Dependency ◽

Computing Platforms ◽

Multiple Task ◽

Dispatch Policy

On the volunteer computing platforms, inter-task dependency leads to serious performance degradation for failed task re-execution because of volatile peers. This paper discusses a performance-oriented task dispatch policy based on the failure probability estimation. The tasks with the highest failure probabilities are selected for dispatch when multiple task enquiries come to the dispatcher. The estimated failure probability is used to find the optimized task assignment that minimizes the overall failure probability of these tasks. This performance-oriented task dispatch policy is evaluated with two real world trace data sets on a simulator. Evaluation results demonstrate the effectiveness of this policy.

Download Full-text

Evolutionary Algorithms on Volunteer Computing Platforms: The MilkyWay@Home Project

Studies in Computational Intelligence - Parallel and Distributed Computational Intelligence ◽

10.1007/978-3-642-10675-0_4 ◽

2010 ◽

pp. 63-90 ◽

Cited By ~ 10

Author(s):

Nate Cole ◽

Travis Desell ◽

Daniel Lombraña González ◽

Francisco Fernández de Vega ◽

Malik Magdon-Ismail ◽

...

Keyword(s):

Evolutionary Algorithms ◽

Volunteer Computing ◽

Computing Platforms

Download Full-text

Computational Micrograph Registration with Sieve Processes

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s0424820100164660 ◽

1996 ◽

Vol 54 ◽

pp. 440-441

Author(s):

P.J. Phillips ◽

J. Huang ◽

S. M. Dunn

Keyword(s):

Planar Graph ◽

Efficient Algorithm ◽

Spatial Organization ◽

Spatial Arrangement ◽

Stereo Image ◽

Image Model ◽

Geometric Invariants ◽

Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Download Full-text