Temat: volunteer computing

Skocz do pozycji: 1.

Tytuł:: Web pages content analysis using browser-based volunteer computing
Autorzy:: Turek, W.
Nawarecki, E.
Dobrowolski, G.
Krupa, T.
Majewski, P.
Tematy:: volunteer computing
text processing
web crawling; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/305311.pdf Link otwiera się w nowym oknie
Opis:: Existing solutions to the problem of finding valuable information on the Web suffers from several limitations like simplified query languages, out-of-date in- formation or arbitrary results sorting. In this paper a different approach to this problem is described. It is based on the idea of distributed processing of Web pages content. To provide sufficient performance, the idea of browser-based volunteer computing is utilized, which requires the implementation of text processing algorithms in JavaScript. In this paper the architecture of Web pages content analysis system is presented, details concerning the implementation of the system and the text processing algorithms are described and test results are provided.
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Volunteer computing simulation using repast and mason
Autorzy:: Byrski, A.
Feluś, M.
Gawlik, J.
Jasica, R.
Kobak, P.
Jankowski, G.
Nawarecki, E.
Wroczyński, M.
Majewski, P
Krupa, T.
Strychalski, J.
Tematy:: volunteer computing
agent-based simulation
RePast
MASON; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/305347.pdf Link otwiera się w nowym oknie
Opis:: Volunteer environments usually consist of a large number of computing nodes, with highly dynamic characteristics, therefore reliable models for a planning of the whole computing are highly desired. An easy to implement approach to modelling and simulation of such environments May employ agent-based universal simulation frameworks, such as RePast or MASON. In the course of the paper the above-mentioned simulation frame Works are adapter to suport simulation of volunteer computing. After giving implementation details, selected results concerning computing time and speedup are given and are compared with the ones obtained from an actual volunteer environment.
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Comcutejs:a Web browser based platform for large-scale computations
Autorzy:: Dębski, R.
Krupa, T.
Majewski, P
Tematy:: volunteer computing
parallel computations
large-scale computations
augmented cloud computing; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/305741.pdf Link otwiera się w nowym oknie
Opis:: The paper presents a new, cost effective,volunteer computing based platform. It utilizes volunteers’web browsers as computational nodes. The computational tasks are delegated to the browsers and executed in the background (independently of any user interface scripts) making use of the HTML5 web workers technology. The capabilities of the platform hale been proved by experiments performer in a wide range of numbers of computational nodes (1–400).
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Efficient implementation of branch-and-bound method on desktop grids
Autorzy:: Tlan, B.
Posypkin, M.
Tematy:: BOINC
branch-and-bound method
distributed computing
volunteer computing
desktop grid; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/305762.pdf Link otwiera się w nowym oknie
Opis:: The Berkeley Open Infrastructure for Network Computing (BOINC) is an open-source middleware system for volunteer and desktop grid computing. In this paper, we propose BNBTEST, a BOINC version of the distributed branch-and-bound method. The crucial issues of the distributed branch-and-bound method are traversing the search tree and loading the balance. We developed a subtask packaging method and three different subtask distribution strategies to solve these.
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: Using BOINC desktop grid to solve large scale SAT problems
Autorzy:: Posypkin, M.
Semenov, A.
Zaikin, O.
Tematy:: desktop grid
Boolean satisfiability problem (SAT)
SAT
volunteer computing
BOINC; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/305605.pdf Link otwiera się w nowym oknie
Opis:: Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja