izvorni znanstveni rad
During the development of the BDD package our implementations have been tested thoroughly to ensure both correctness and efficiency. Many of the proposed data structures and algorithms were discarded as they turned out to be either inefficient or insufficient. In this paper we will discuss the efficiency of some of the implementations in the BDD package. Firstly we briefly describe the problems we have used in the test with the BDD package. In the next section we present the results of the tests we have performed, and in the last section we analyse the results. We will use fault trees, which come from the nuclear industry to examine the efficiency of the BDD package we have implemented. We will study the running time for calculation of the probability of top event from the BDD representing the fault tree we test, and after that the running time to do calculations of different configurations.
fault tree; probability; nuclear industry
Razvojem virtualizacijskih tehnologija raste kompleksnost IT sustava, dok korisnici istovremeno zahtijevaju brži pristup resursima, napredne integracije i jednostavnost korištenja. Jedno od ključnih rješenja za ove izazove primjena je…
Ovaj rad istražuje i uspoređuje mogućnosti prosljeđivanja grafičkih kartica na Hyper-V i KVM hipervizorima prema virtualnim strojevima, detaljno opisujući metode, postupke i razlike u arhitekturi koje utječu na…
The ever-growing usage and adaptation of HTTP/3 in web traffic leverages Quick UDP Internet Connections (QUIC) as a transport protocol. QUIC is widely recognized for reduced latency, enhanced…
