Wyniki wyszukiwania - BazTech

1

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

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.

3

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.

4

From quantity to quality: massive molecular dynamics simulation of nanostructures under plastic deformation in desktop and service grid distributed computing infrastructure

Gatsenko O., Bekenev L., Pavlov E., Gordienko Y. G.

Computer Science

|

2013

|

Vol. 14 (1)

27--44

EN

The distributed computing infrastructure (DCI) on the basis of BOINC and EDGeS-bridge technologies for high-performance distributed computing is used for porting the sequential molecular dynamics (MD) application to its parallel version for DCIwith Desktop Grids (DGs) and Service Grids (SGs). The actual metrics of the working DG-SG DCI were measured, and the normal distribution of host performances, and signs of log-normal distributions of Rother characteristics (CPUs, RAM, and HDD per host) were found. The practical feasibility and high efficiency of the MD simulations on the basis of DG-SG DCI were demonstrated during the experiment with the massive MD simulations for the large quantity of aluminum nanocrystals (Statistical analysis (Kolmogorov-Smirnov test, moment analysis, and bootstrapping analysis) of the defect density distribution over the ensemble of nanocrystals had show that change of plastic deformation mode is followed by the qualitative change of defect density distribution type over ensemble of nanocrystals. Some limitations (fluctuating performance, unpredictable availability of resources, etc.) of the typical DG-SG DCI were outlined, and some advantages (high efficiency, high speedup, and low cost) were demonstrated. Deploying on DG DCI allows to get new scientific quality from the simulated quantity of numerous configurations by harnessing sufficient computational power to undertake MD simulations in a wider range of physical parameters (configurations) in a much shorter timeframe.

5

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.