Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "computing systems" wg kryterium: Temat


Wyświetlanie 1-8 z 8
Tytuł:
Building science gateways by utilizing the generic WS-PGRADE/gUSE workflow system
Autorzy:
Balasko, A.
Farkas, Z.
Kacsuk, P.
Powiązania:
https://bibliotekanauki.pl/articles/305768.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
distributed computing
workflow systems
Science Gateway
Opis:
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.
Źródło:
Computer Science; 2013, 14 (2); 307-325
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using Redis supported by NVRAM in HPC applications
Autorzy:
Malinowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/305650.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
high performance computing
storage systems
NoSQL
NVRAM
Opis:
Nowadays, the efficiency of a storage systems is a bottleneck in many moern HPC clusters. High performance in traditional approach – processing using files – is often difficult to obtain because of model complexity and its read/write patterns. Alternative approach is applying a key-value database, which usually has low latency and scales well. On the other hand, many key-value stores suffer from limitation of memory capacity and vulnerability to serious faiures, which is caused by processing in RAM. Moreover, some research suggests, that scientific data models are not applicable to storage structures of key-value databases. In this paper, the author proposes resolving mentioned issues by replacing RAM with NVRAM. Practical example is based on Redis NoSQL. The article contains also a three domain specific APIs, that show the idea bhind transformation from HPC data model to Redis structures, as well as two micro-benchmarks results.
Źródło:
Computer Science; 2017, 18 (3); 287-300
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of distributed systems dynamics with Erlang Performance Lab
Autorzy:
Ślaski, M.
Turek, W.
Gil, A.
Szafran, B.
Paciorek, M.
Byrski, A.
Powiązania:
https://bibliotekanauki.pl/articles/305613.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
software engineering
distributed computing and simulation
distributed systems monitoring
Opis:
Modern, highly concurrent, and large-scale systems require new methods for design, testing, and monitoring. Their dynamics and scale require real-time tools that provide a holistic view of the whole system and the ability to show a more detailed view when needed. Such tools can help identify the causes of unwanted states, which is hardly possible with a static analysis or metrics-based approach. In this paper, a new tool for the analysis of distributed systems in Erlang is presented. It provides the real-time monitoring of system dynamics on diferent levels of abstraction. The tool has been used for analyzing a large-scale urban trafic simulation system running on a cluster of 20 computing nodes.
Źródło:
Computer Science; 2018, 19 (2); 139-155
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A crisis management approach to mission survivability in computational multi-agent systems
Utrzymanie krytycznych zadań oparte na zarządzaniu kryzysowym w obliczeniowych systemach wieloagentowych
Autorzy:
Byrski, A.
Kisiel-Dorohinicki, M.
Carvalho, M.
Powiązania:
https://bibliotekanauki.pl/articles/305626.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
systemy agentowe
zarządzanie kryzysowe
soft computing
agent systems
crisis management
Opis:
In this paper we present a biologically-inspired approach for mission survivability (considered as the capability of fulfilling a task such as computation) that allows the system to be aware of the possible threats or crises that may arise. This approach uses the notion of resources used by living organisms to control their populations. We present the concept of energetic selection in agent-based evolutionary systems as well as the means to manipulate the configuration of the computation according to the crises or user's specific demands.
W artykule prezentujemy biologicznie inspirowany mechanizm wspomagający utrzymanie krytycznych zadań (tzw. mission survivability) który umożliwia wykrywanie oraz przeciwdziałanie wybranym zagrożeniom. Przedstawione podejście wzorowane jest na wykorzystywaniu przez żywe organizmy zasobów do kontroli populacji. Prezentujemy koncepcje selekcji energetycznej mającej zastosowanie w ewolucyjnych systemach wieloagentowych (EMAS) oraz sposoby konfiguracji obliczenia w celu przeciwdziałania sytuacjom kryzysowym, według preferencji użytkownika.
Źródło:
Computer Science; 2010, 11; 99-113
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Enabling generic distributed computing infrastructure compatibility for workflow management systems
Autorzy:
Kozlovszky, M.
Karoczkai, K.
Marton, I.
Balasko, A.
Marosi, A.
Kacsuk, P.
Powiązania:
https://bibliotekanauki.pl/articles/305454.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
workflow management systems
infrastructure interoperability
Distributed Computing Infrastructure
DCI
DCI Bridge
Opis:
Solving workflow management system’s Distributed Computing Infrastructure (DCI) incompatibility and their workflow interoperability issues are very challenging and complex tasks. Workflow management systems (and therefore their workflows, workflow developers and also their end-users) are bounded tightly to some limited number of supported DCIs, and efforts required to allow additional DCI support. In this paper we are specifying a concept how to enable generic DCI compatibility for grid workflow management systems (such as ASKALON, MOTEUR, gUSE/WS-PGRADE, etc.) on job and indirectly on workflow level. To enable DCI compatibility among the different workflow management systems we have developed the DCI Bridge software solution. In this paper we will describe its internal architecture, provide usage scenarios to show how the developed service resolve the DCI interoperability issues between various middleware types. The generic DCI Bridge service enables the execution of jobs onto the existing major DCI platforms (such as Service Grids (Globus Toolkit 2 and 4, gLite, ARC, UNICORE), Desktop Grids, Web services, or even cloud based DCIs).
Źródło:
Computer Science; 2012, 13 (3); 61-78
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a workflow model based on generalized communicating P systems
Autorzy:
Balasko, A.
Powiązania:
https://bibliotekanauki.pl/articles/305481.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
workflow languages
workflow patterns
control patterns
membrane computing
Generalized Communicating P Systems
Opis:
This paper introduces a new formal mathematical model for investigating work- flows from dynamical and behavioural point of view. The model is designed on the basis of a special variant of the biology-inspired formal computational model called membrane systems, where the jobs or services are represented by membrane objects whose behaviour is defined by communication and generalization rules. The model supports running computations in a massive parallel manner, which makes it ideal to model high throughput workflow interpreters. Among the variants introduced in the literature, we have selected the Generalized Communicating P Systems, as it focuses on the communication among the membranes. Most of the workflow languages, based on different formal models like Petri nets or Communicating Sequential Processes, support several predefined structures – namely workflow patterns – to control the workflow interpretation such as conditions, loops etc. In this paper we show how these patterns are adapted into the membrane environment which, taking into account that membrane systems can be used to study complex dynamic systems’ runtime behaviour, makes this model a relevant alternative for the current models.
Źródło:
Computer Science; 2016, 17 (1); 45-68
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry
Autorzy:
Zhang, Y.
Lv, Q.
Xiao, M.
Xie, G.
Breitkopf, P.
Powiązania:
https://bibliotekanauki.pl/articles/305677.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
complex symmetric linear systems
parallel computing
improved conjugate gradient-type iterative algorithm (ICSYM)
Opis:
Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.
Źródło:
Computer Science; 2018, 19 (4); 385-401
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient approach for view selection for data warehouse using tree mining and evolutionary computation
Autorzy:
Thakare, A.
Deshpande, P.
Powiązania:
https://bibliotekanauki.pl/articles/305413.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
database management systems
data warehousing and data mining
query optimization
graph mining
algorithms for parallel computing
evolutionary computations
genetic algorithms
Opis:
The selection of a proper set of views to materialize plays an important role in database performance. There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. In this paper, we present a new efficient scalable method for view selection under the given storage constraints using a tree mining approach and evolutionary optimization. The tree mining algorithm is designed to determine the exact frequency of (sub)queries in the historical SQL dataset. The Query Cost model achieves the objective of maximizing the performance benefits from the final view set that is derived from the frequent view set given by the tree mining algorithm. The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. The experimental results show that the proposed method is successful in recommending a solution that is fairly close to an optimal solution.
Źródło:
Computer Science; 2018, 19 (4); 431-455
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-8 z 8

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies