|
|
Hamiltonovské kružnice v hyperkrychlích s odstraněnými vrcholy
Pěgřímek, David ; Gregor, Petr (advisor) ; Dvořák, Tomáš (referee)
In 2001 Stephen Locke conjectured that for every balanced set F of 2k faulty vertices in the n-di- mensional hypercube Qn where n ≥ k + 2 and k ≥ 1 the graph Qn − F is hamiltonian. So far the conjecture remains open although partial results are known; some of them with additional conditions on the set F. We explore hamiltonicity of Qn − F if the set of faulty vertices F forms certain isometric subgraph in Qn. For an odd (even) isometric path P in Qn the graph Qn − V (P) is Hamiltonian laceable for every n ≥ 4 (resp. n ≥ 5). Although a stronger result is known, the method we use in proving the theorem allows us to obtain following results. Let C be an isometric cycle in Qn of length divisible by four for n ≥ 6. Then the graph Qn −V (C) is Hamiltonian laceable. Let T be an isometric tree in Qn with odd number of edges and let S be an isometric tree in Qm with even number of edges. For every n ≥ 4, m ≥ 5 the graphs Qn −T and Qm −S are Hamiltonian laceable. A part of the proof is verified by a computer. 1
|
|
|
On The Efficiency Of Precise Fault Localization And Identification In No
Valachovič, Marek
The paper joins the Bonfire NoC model, desrcibed in VHDL, together with a method of the precise localization and identification of faults in NoC and sums up a few findings about the efficiency of fault-tolerant NoC employing the method. A special focus is given to the area overhead and the mean time between failures in the presence of no or one permanent fault and some transient faults.
|
|
|
Dependability Assessment of Fault Tolerant Systems
Suchánek, Martin ; Šimek, Václav (referee) ; Strnadel, Josef (advisor)
Reliability is an important part of various systems. The aim of the work is to create reliability models of some reconfigurable and nonreconfigurable fault tolerant systems and subsequent evaluation of their reliability indicators. The Uppaal tool is used to create models, along with the SMC extension, which is used for verification. The result of the work is the verification of models and evaluation of reliability indicators using the tool Uppaal SMC.
|
|
|
Hamiltonovské kružnice v hyperkrychlích s odstraněnými vrcholy
Pěgřímek, David ; Gregor, Petr (advisor) ; Dvořák, Tomáš (referee)
In 2001 Stephen Locke conjectured that for every balanced set F of 2k faulty vertices in the n-di- mensional hypercube Qn where n ≥ k + 2 and k ≥ 1 the graph Qn − F is hamiltonian. So far the conjecture remains open although partial results are known; some of them with additional conditions on the set F. We explore hamiltonicity of Qn − F if the set of faulty vertices F forms certain isometric subgraph in Qn. For an odd (even) isometric path P in Qn the graph Qn − V (P) is Hamiltonian laceable for every n ≥ 4 (resp. n ≥ 5). Although a stronger result is known, the method we use in proving the theorem allows us to obtain following results. Let C be an isometric cycle in Qn of length divisible by four for n ≥ 6. Then the graph Qn −V (C) is Hamiltonian laceable. Let T be an isometric tree in Qn with odd number of edges and let S be an isometric tree in Qm with even number of edges. For every n ≥ 4, m ≥ 5 the graphs Qn −T and Qm −S are Hamiltonian laceable. A part of the proof is verified by a computer. 1
|
|
|
Optimization of Distributed Network Flow Collector
Wrona, Jan ; Grégr, Matěj (referee) ; Žádník, Martin (advisor)
This thesis is focused on the optimization of distributed IP flow information collector. Nowadays, the centralized collector is a frequently used solution but is already reaching its performance limits in large scale and high-speed networks. The implementation of the distributed collector is in its early phase and it is necessary to look for solutions that will use it to its full potential. Therefore this thesis proposes a shared nothing architecture without a single point of failure. Using the above proposed architecture, the distributed collector is tolerant to the failure of at least one node. A distributed flow data analysis software, whose performance scales linearly with the number of nodes, is also part of this thesis.
|
|
|
Distributed System for School Register of Basic and Secondary Schools
Martiš, Viktor ; Ryšavý, Ondřej (referee) ; Ráb, Jaroslav (advisor)
One of the software success condition on the software market is permanent development to keep in condition with actual technical tools. That is the reason why SAS software is searching for a way how to fulfil customer's requirements better. The change to the distributed system architecture brings new opportunities and sets up competitive advantage for SAS concurrently. The subject of this thesis is to create the design of movement to the distributed system. The main reason is to make analysis, design and partial implementation meeting functional requirements of the new architecture.
|
|
|
Usage of Modern Methods for Increasing Reliability of Control System Implementations
Szurman, Karel ; Mičulka, Lukáš (referee) ; Kaštil, Jan (advisor)
At avionics control and critical systems is necessary guarantee a minimal level of fault tolerance and their high reliability. On the electronic components in these devices has an undesirable influence environment conditions and mainly cosmic ray. In this paper are described the most common failure types of semiconductor components and devices together with modern methods which can be increased the system fault tolerance and its overall reliability. There are introduced aspects of the avionic systems design due to finally certification and ways to evaluate its safety. This thesis describes design and implementation of the CAN bus control system for the FPGA platform which uses the CANAerospace application protocol. Created system design is improved by the TMR architecture. Fault tolerance of both system version is tested by the SEU framework which allows using the dynamic partial reconfiguration generate an SEU failures into running FPGA design.
|
|
|
VHDL Design of Robot Controller for Autonomous Robot Movement in Maze
Podivínský, Jakub ; Strnadel, Josef (referee) ; Zachariášová, Marcela (advisor)
This master thesis describes design and implementation of a robot controller for autonomous movement in a maze. Robot represents an exemplary system, which is designed for testing and validation of fault-tolerance methodologies. A part of this work contains introduction to reliability of digital systems, especially those which are based on Field Programmable Gate Array (FPGA). Moreover, this introduces techniques that ensure robustness against faults in digital systems; attention is devoted to the usage of FPGA technology in this area and a technique called partial dynamic reconfiguration.
|
|
|
Functional Verification of Robotic System Using UVM
Krajčír, Stanislav ; Čekan, Ondřej (referee) ; Zachariášová, Marcela (advisor)
One of the currently most used approaches for verification of hardware systems is functional verification. This master thesis describes design and implementation of a verification environment using UVM (Universal Verification Methodology) methodology for verifying the correctness of the robot controller in order to eliminate functional errors and faults of its implementation. The theoretical part of the thesis describes the basic information about functional verification, methodologies for creating verification environments, the SystemVerilog language and fault tolerance methodologies. The next part of thesis focuses on the design of the verification environment, its implementation and the creation of tests used to verify the correctness of the robot controller. Results of verification are discussed and evaluated in the conclusion of this work.
|
guest ::
