Browsing by Subject "distributed computing"

Now showing 1 - 9 of 9

Access status: Open Access ,
Building science gateways by utilizing the generic WS-PGRADE/gUSE workflow system
(Wydawnictwa AGH, 2013) Balaskó, Ákos; Farkas, Zoltán; Kacsuk, Péter
Enabling scientists to use remote distributed infrastructures, parametrize and execute common science-domain applications transparently is actual and a highly relevant field of distributed computing. For this purpose a general solution is the concept of Science Gateways. WS-PGRADE/gUSE system offers a transparent and web-based interface to access distributed resources (grids, clusters or clouds), extended by a powerful generic purpose workflow editor and enactment system, which can be used to compose scientific applications into data-flow based workflow structures. It’s a generic web-based portal solution to organize scientific applications in a workflow structure and execute them on remote computational resources. As the portal defines nodes as black-box applications uploaded by the users, it does not provide any application specific interface by default. In this paper we show what kind of tools, APIs and interfaces are available in WS-PGRADE/gUSE to customize it to have an application specific gateway.
Access status: Open Access ,
Circle formation by asynchronous opaque robots on infinite grid
(Wydawnictwa AGH, 2021) Adhikary, Ranendu; Kundu, Manash Kumar; Sau, Buddhadeb
This paper presents a distributed algorithm for the Circle Formation problem under the infinite grid environment by asynchronous mobile opaque robots. Initially, all of the robots acquire distinct positions, and they must form a circle over the grid. The movements of the robots are only restricted along the grid lines, they do not share any global coordinate system. The robots are controlled by an asynchronous adversarial scheduler that operates in Look-Compute-Move cycles. The robots are indistinguishable by their nature, and they do not have any memory of their past configurations nor previous actions. We consider the problem under a luminous model, where robots communicate via lights, other than that, they do not have any external communication systems. Our protocol solves the Circle Formation problem using seven colors. A subroutine of our algorithm also solves the Line Formation problem using three colors.
Access status: Open Access ,
Efficient implementation of branch-and-bound method on desktop grids
(Wydawnictwa AGH, 2014) Tian, Bo Ye; Posypkin, Mihail Anatol'evič
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.
Access status: Open Access ,
From quantity to quality: massive molecular dynamics simulation of nanostructures dunder plastic deformation in desktop and service grid distributed computing infrastructure
(Wydawnictwa AGH, 2013) Gatsenko, Olexander; Bekenev, Lev Valer'evič; Pavlov, Evgen Valerijovič; Gordienko, Ûri G.
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.
Access status: Restricted ,
Możliwości implementacji środowisk rozproszonych bazujących na przeglądarkach internetowych
(Data obrony: 2014-10-03) Szemla, Przemysław Witold
Wydział Geologii, Geofizyki i Ochrony Środowiska
The goal of the master’s thesis is a presentation of possibilities of implementation of development environments which allows on creation of distributed applications. The environments should provide the DistributedFor functionality. This mechanism lets on implementation of loops which are executed on many nodes simultaneously. Very important assumption is usage of web browsers, on a client-side, and high-level programming languages such as Java or C#. Moreover, created environments should be characterized by maximal ease of use. The thesis includes also accurate description of algorithms and detailed comparisons of all the aspects of construction of the applications which use technologies mentioned above. Additionally, the author presents, for the .NET based implemention, a solution which allows on parallel execution of code on each node of the system.
Access status: Open Access ,
Parallel allocation of the distributed software using node label controlled graph grammars
(Wydawnictwa AGH, 2008) Kotulski, Leszek
Centralization of a graph's data is useful while we consider properties of some system specification but it seems to be not acceptable in the case of the support an efficient, high reliably system with a dynamic software allocation. In the paper, we introduce the aedNLC graph grammar, that has both polynomial computational complexity and enough descriptive power to coordinate parallel modification of a few local graphs (representing parts of the system), in such a way that the global consistency of the distributed system specification can be maintained.
Access status: Open Access ,
Projekt środowiska rozproszonego do badania systemów nieliniowych z wykorzystaniem technologii Java RMI
(Wydawnictwa AGH, 2008) Ciesielski, Grzegorz; Albrecht, Andrzej; Wojciechowski, Rafał
In the paper, the usage of distributed computing mechanisms for the nonlinear system research was shown. The project of generalized distributed environment using the Java RMI technology was described. The concept of the environment for nonlinear system research was introduced and the functional requirements were given. The communication protocol allowing the management and data exchange between system modules was discussed. The requirements for the client API including the organization of modules flow, data types standardization and data exchange, were introduced. The grammar concept of the script language for the environment automatization was also described.
Access status: Restricted ,
Rozproszony system do obliczeń czasów przejazdów pojazdów
(Data obrony: 2018-01-29) Pazdalski, Tomasz
Wydział Geologii, Geofizyki i Ochrony Środowiska
Tematem pracy było zaprojektowanie i zaimplementowanie rozproszonego systemu do obliczeń mapy pokrycia czasów przejazdu pojazdów. System został zaimplementowany w oparciu o technologię .NET Remoting oraz program MapPoint. System został zaprojektowany, aby umożliwić synchronizację wielu aplikacji klienckich, które były odpowiedzialne za obliczanie czasów przejazdów z wykorzystaniem programu MapPoint. Serwer otrzymywał dane, które rozdzielał pomiędzy węzłami, synchronizował wyniki oraz zapisywał rezultaty w postaci wyników cząstkowych do plików w formacie CSV. Środowiskiem testowym systemu była sieć komputerów klasy PC, połączonych siecią LAN. Analiza wydajności systemu opierała się o mierzony czas obliczeń danych w postaci siatki punktów zawierających koordynaty geograficzne.
Access status: Restricted ,
System agentowy do monitorowania komputerów w sieci heterogenicznej
(Data obrony: 2014-09-30) Śliwa, Mateusz
Wydział Geologii, Geofizyki i Ochrony Środowiska
The purpose of this study is an overview of Agent Systems working in heterogenous environment. Agent System is an example of an approach used in distributed programming that focuses on specific task assignment and task execution by certain parts of a program (e.g. agent autonomy). The subjects of this study covers: the basics of distributed programming and agent systems, examples of technologies which can be used to implement agent system with a focus on future use in heterogenous environment. During the study, an agent program was implemented for monitoring performance of a computers within a network, using Java RMI technology (communication) and using Sigar (data collection) and AmCharts (data display) libraries. This program, representing main subject of a study, can be applied into distributed computing systems as a major optimization aid.