Abstract
In this paper, we present two new algorithms for distributed volunteer computing. Both algorithms have in common, that they are self-organized. Due to the self-* properties of our algorithms, the reliability of the distributed computing is increased. The network, which builds the basis for the distribution, is an unstructured peer-to-peer (p2p) network. Since there is no central managing unit and no structured addressable overlay in such networks, each peer has to self-organize the job
selecting process, the distribution of jobs, and the merging of finished jobs obtained from neighbors. After presenting our two algorithms, namely
the Epoch-Distribution-Algorithm and the Sliding-Window-Distribution-Algorithm, we present open questions. Since these algorithms are strongly based on self-organization and peers are working absolute autonomously and other some self-* properties, the algorithms can be classified into to world of the organic computing.
Users
Please
log in to take part in the discussion (add own reviews or comments).