PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  volunteer computing
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Browser-based harnessing of voluntary computational power
Fabisiak T., Danilecki A
Foundations of Computing and Decision Sciences
|
2017
|
Vol. 42, No. 1
3--42
EN
Computers connected to internet represent an immense computing power, mostly unused by their owners. One way to utilize this public resource is via world wide web, where users can share their resources using nothing more except their browsers. We survey the techniques employing the idea of browser-based voluntary computing (BBVC), discuss their commonalities, recognize recurring problems and their solutions and finally we describe a prototype implementation aiming at efficient mining of voluntary-contributed computing power.
2
Content available remote Volunteer computing in a scalable lightweight web-based environment
Chorazyk P., Byrski A., Pietak K., Kisiel-Dorohinicki M., Turek W.
Computer Assisted Methods in Engineering and Science
|
2017
|
Vol. 24, no. 1
17--40
EN
Volunteer computing is a very appealing way of utilizing vast available resources in efficient way. However, the current platforms that support such computing style are either difficult to use or not available at all, as a results of finished scientific projects, for example. In this paper, a novel lightweight volunteer computing platform is presented and thoroughly tested in an artificial environment of a commercially available computing cloud using two computing-related tasks and one web-crawling-related task.
3
Content available remote Reliable peer-to-peer computing system
Zochniak M., Sawicki B.
Przegląd Elektrotechniczny
|
2014
|
R. 90, nr 5
61--63
EN
Paper discuss a heterogeneous, distributed computing system commonly referred as a volunteer computing. Mechanism of determining correctness of results, based on replication and trust modeling, is proposed. In presented solution owners of computational power can flexibly join the network and sell spare machine time. Prototype implementation is based on light virtual machines distributed using BitTorrent protocol.
PL
Artykuł rozważa niejednorodny, rozproszony system obliczeniowy (ang. volunteer computing). Zaproponowano mechanizmy określania poprawności wyników, które zostały oparte na modelowaniu zaufania i wiarygodności węzłów obliczeniowych. W prezentowanym rozwiązaniu właściciele mocy obliczeniowej mogą w dowolnej chwili dołączac do sieci i sprzedawać czas pracy swoich maszyn. Prototypowa implementacja została oparta na technologii lekkich maszyn wirtualnych przesyłanych za pomocą protokołu BitTorrent.
4
Content available Efficient implementation of branch-and-bound method on desktop grids
Tlan B., Posypkin M.
Computer Science
|
2014
|
Vol. 15 (3)
239--252
EN
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.
5
Content available Web pages content analysis using browser-based volunteer computing
Turek W., Nawarecki E., Dobrowolski G., Krupa T., Majewski P.
Computer Science
|
2013
|
Vol. 14 (2)
215--230
EN
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.
6
Content available Volunteer computing simulation using repast and mason
Byrski A., Feluś M., Gawlik J., Jasica R., Kobak P., Jankowski G., Nawarecki E., Wroczyński M., Majewski P, Krupa T., Strychalski J.
Computer Science
|
2013
|
Vol. 14 (1)
153--172
EN
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.
7
Content available Comcutejs:a Web browser based platform for large-scale computations
Dębski R., Krupa T., Majewski P
Computer Science
|
2013
|
Vol. 14 (1)
143--152
EN
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).
8
Content available Using BOINC desktop grid to solve large scale SAT problems
Posypkin M., Semenov A., Zaikin O.
Computer Science
|
2012
|
Vol. 13 (1)
25-34
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.