- Tytuł:
- Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems
- Autorzy:
-
Chmaj, G.
Walkowiak, K.
Tarnawski, M.
Kucharzak, M. - Powiązania:
- https://bibliotekanauki.pl/articles/330970.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
system obliczeniowy P2P
przetwarzanie rozproszone
optymalizacja
heurystyka
algorytm ewolucyjny
P2P computing system
distributed computing
optimization
heuristics
evolutionary algorithms - Opis:
- Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational projects. A significant example of the P2P computing idea is the BOINC (Berkeley Open Infrastructure for Network Computing) project. To improve the performance of the computing system, we propose to use the P2P approach to distribute results of computational projects, i.e., results are transmitted in the system like in P2P file sharing systems (e.g., BitTorrent). In this work, we concentrate on offline optimization of the P2P computing system including two elements: scheduling of computations and data distribution. The objective is to minimize the system OPEX cost related to data processing and data transmission. We formulate an Integer Linear Problem (ILP) to model the system and apply this formulation to obtain optimal results using the CPLEX solver. Next, we propose two heuristic algorithms that provide results very close to an optimum and can be used for larger problem instances than those solvable by CPLEX or other ILP solvers.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 733-748
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł