National Repository of Grey Literature 49 records found  beginprevious21 - 30nextend  jump to record: Search took 0.00 seconds. 
Acceleration of Particles Tracking on CBM Experiment
Roth, Michael ; Kolář, Martin (referee) ; Musil, Petr (advisor)
The focus of this work is to research various methods of particle track reconstruction in the CBM experiment, and the problem of hardware acceleration of these methods. The advantages and disadvantages of the extended methods were discussed and a reconstruction method based on cellular automata and Extended Kalman filters was selected for further study. In particular, the thesis details the development of a simulation model suitable for generating test data to facilitate the implementation of the selected tracking algorithm, which was subsequently sped up using distributed computing methods. Two different particle simulation models and a reconstruction algorithm were implemented, with the reconstruction algorithm offering up to 800 per cent speed up factor in respect to the sequential algorithm and up to four orders of magnitude lower memory complexity.
The library for working with sensors allowing distributed processing in FORTH language
Kudela, Kryštof ; Valach, Soběslav (referee) ; Jirgl, Miroslav (advisor)
This semestral work is about programming language Forth, variation of operating systems, analysis of microcontroller unit, definition of intelligent sensors and distributed systems and distributed computing. The purpose of this work is introduce the reader to entire Forth development platform, where first chapter is learning how to program in Forth, then there are informations about the FlashForth and AmForth operating systems. The MCU chapter describes the microcontroller unit, where they are used and its division. Next chapters are about definition of smart sensors and theoretical introduction to distributed systems and distributed computing, which contain also a multitasking solution in Forth. A network is created in Forth that allows remote control using a wireless module.
Distributed Tasks in an Enterprise Computing Environment
Tichavský, Milan ; Rychlý, Marek (referee) ; Burget, Radek (advisor)
V architektuře orientované na mikroslužby jsou zprávy běžně používaným prostředkem pro komunikaci mezi jednotlivými službami. Obecně je zde potřeba naslouchat zprávám odeslaným na sběrnici a reagovat na ně spouštěním úloh. Tato práce prezentuje všechny podstatné úvahy k vyřešení tohoto problému. Přichází s rámcem pro spouštění úloh, který vykonává úlohy v libovolných kontejnerech na OpenShiftu. Řešení se skládá z API napsaného ve Flasku, které obsahuje spouštěcí logiku, a klienta, který přes STOMP příjmá zprávy ze sběrnice a poslílá je na API. Součástí jsou i testovací scénáře, které předvádějí funkčnost celého systému. Řešení je vyhodnocováno porovnáváním s existující aplikací postavené na nástroji Jenkins. Rovněž je diskutovaný alternativní návrh využívající Tekton. Druhým problémem, kterým se tato práce zabývá, je provádění pravidelně naplánovaných úloh. Namísto implementace vlastního řešení navrhuje použití Kubernetes objektů CronJob.
Grid and Cloud Computing
Began, Jakub ; Dobrovský, Ladislav (referee) ; Šeda, Miloš (advisor)
The bachelor thesis deals with cloud and grid technologies. The first part discusses cloud computing technology, its components, infrastructure, models, advantages, disadvantages, and security risks. The following section describes computing and data grids, their function, use and security. The last part of the thesis shows an overview of the commercial market of cloud and grid services.
Platform-independent Middleware for Distributed Parallel Tasks
Bořkovec, Kryštof ; Hnětynka, Petr (advisor) ; Bureš, Tomáš (referee)
The thesis presents a middleware faciliating parallel execution of tasks expressed in the Java programming language on many computers. When started at a number of machines, this software creates a so called cloud that enables splitting the task into smaller subtasks and subsequent independent execution of these subtasks at difeferent nodes. The presented software distributes subtasks throughout the cloud automatically and it performs the following collection of results. The text begins with a brief introduction to the topic of distributed computations and a discussion of possible approaches to the subject. The main part of the work describes software architecture and topology of the system, demonstrates its usage at two sample tasks and gives a brief comparison with two other projects.
Raspberry Pi 4 Cluster Management in Nix
Živčák, Adam ; Burget, Radek (referee) ; Rychlý, Marek (advisor)
The scope of this thesis is to design and implement a system for deploying, managing and monitoring a Raspberry Pi cluster using Nix technologies. The thesis describes the benefits of the functional approach of Nix and the subsystems that are based on it. The thesis also results in a supporting web application, providing an intuitive environment for working with cluster configuration deployments and clearly displaying information about the utilization of individual nodes using dashboards. The final part of the thesis is devoted to testing cluster performance using sample distributed computing jobs.
Optimization of Task Distribution in Fitcrack System
Ženčák, Tomáš ; Ryšavý, Ondřej (referee) ; Hranický, Radek (advisor)
The goal of this thesis is the optimization of task distribution in the Fitcrack system. The improvement is reached by way of increasing the accuracy of the estimation of the computational power of worker nodes, and the prevention of the creation of extremely small tasks, as well as increasing the efficiency of the transfer of the tasks to the worker nodes. In this thesis, the current state of the Fitcrack system is described, tested, and evaluated. This thesis then describes the weak points of the current implementation, proposes ways of remediating them and describes, tests and evaluates the implementation of those proposals.
Portability of Distributed Computing in Cloud Infrastructures
Duong, Cuong Tuan ; Ondrák, Viktor (referee) ; Kříž, Jiří (advisor)
The master’s thesis focuses on analysis of solution to distributed computing of metage-nomics data in cloud infrastructures. It describes specific META-pipe platform based onclient-server architecture in infrastructure of public academic cloud EGI Federated Cloud,sponsored by european project ELIXIR-EXCELERATE. Thesis is focusing especially onopen-source software like Terraform and Ansible.
Analysis and Improvement of Distributed Systems
Kenyeres, Martin ; Sýkora, Jiří (referee) ; Klučik,, Stanislav (referee) ; Škorpil, Vladislav (advisor)
A significant progress in the evolution of the computer systems and their interconnection over the past 70 years has allowed replacing the frequently used centralized architectures with the highly distributed ones, formed by independent entities fulfilling specific functionalities as one user-intransparent unit. This has resulted in an intense scientic interest in distributed algorithms and their frequent implementation into real systems. Especially, distributed algorithms for multi-sensor data fusion, ensuring an enhanced QoS of executed applications, find a wide usage. This doctoral thesis addresses an optimization and an analysis of the distributed systems, namely the distributed consensus-based algorithms for an aggregate function estimation (primarily, my attention is focused on a mean estimation). The first section is concerned with a theoretical background of the distributed systems, their evolution, their architectures, and a comparison with the centralized systems (i.e. their advantages/disadvantages). The second chapter deals with multi-sensor data fusion, its application, the classification of the distributed estimation techniques, their mathematical modeling, and frequently quoted algorithms for distributed averaging (e.g. protocol Push-Sum, Metropolis-Hastings weights, Best Constant weights etc.). The practical part is focused on mechanisms for an optimization of the distributed systems, the proposal of novel algorithms and complements for the distributed systems, their analysis, and comparative studies in terms of such as the convergence rate, the estimation precision, the robustness, the applicability to real systems etc.
Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Strongly Connected Topologies
Kenyeres, Martin ; Novotný, Bohumil
This paper deals with the stochastic distributed algorithm – the push-sum protocol. We examine the effect of experiments repetitions on the mean of the convergence rates quantities. The main goal of the executed experiments is to show how many repetitions of the push-sum protocol are necessary to achieve a statistically credible representative of the obtained set of data. Within this paper, we have focused on strongly connected structures.

National Repository of Grey Literature : 49 records found   beginprevious21 - 30nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.