izvorni znanstveni rad
It is well known that the size of the final ROBDD representing some fault tree depends on the chosen variable order. But the total memory required to build this ROBDD can be even larger than the size of the final ROBDD, because in the build process many intermediate generated nodes need to be stored in memory. We will show that it is possible to reduce memory requirements significantly simply by reordering the calculations in the build phase. By using this technique with appropriate variable order we were able to reduce memory overhead and even speeds up the build phase. This approach can be applied to the ROBDD construction in the Fault tree analysis as well as in other fields where the ROBDD approach is applicable.
fault tree; ROBDD
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…
