N. Kopal, O. Kieselmann, und A. Wacker. Organic Computing: Doctoral Dissertation Colloquium 2014, 4, Seite 129-139. Kassel University Press GmbH., (2014)
Zusammenfassung
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.
%0 Conference Paper
%1 kopal2014selforganized
%A Kopal, Nils
%A Kieselmann, Olga
%A Wacker, Arno
%B Organic Computing: Doctoral Dissertation Colloquium 2014
%D 2014
%E Sick, Bernhard
%E Tomforde, Sven
%I Kassel University Press GmbH.
%K Volunteer-Computing myown
%P 129-139
%T Self-Organized Volunteer Computing
%V 4
%X 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.
@inproceedings{kopal2014selforganized,
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.},
added-at = {2014-10-16T14:35:04.000+0200},
author = {Kopal, Nils and Kieselmann, Olga and Wacker, Arno},
biburl = {https://www.bibsonomy.org/bibtex/237c9c5be252d5c7f1d5849f1dfdb52e6/olya},
booktitle = {Organic Computing: Doctoral Dissertation Colloquium 2014},
editor = {Sick, Bernhard and Tomforde, Sven},
interhash = {82bd6aff0cec196b226afd0039bd3494},
intrahash = {37c9c5be252d5c7f1d5849f1dfdb52e6},
keywords = {Volunteer-Computing myown},
pages = {129-139},
publisher = {Kassel University Press GmbH.},
timestamp = {2014-10-16T14:35:04.000+0200},
title = {Self-Organized Volunteer Computing},
volume = 4,
year = 2014
}