This paper presents an improved measure for the dynamic functionality of a logic circuit, called delay fault probability (DFP). The new measure reflects both the nominal delay of the paths and the fact that only few paths are critical for path delay fault testing. An efficient distributed algorithm for computing DFP is presented. The experimental results show that, in contrast to DFP, the conve...

Although strong and damaging earthquakes have hit Zagreb in the past, 22 March 2020 earthquake (Mw 5.4) is first one that was recorded by a modern digital local seismic network, which could be analysed not only macroseismic methods, but also microseismic ones. Herewith we used 3003 carefully located events from year of aftershock sequence to learn more about rate decay, their magnitude distribu...

The Pact (parallel actions) parallel programming environment provides an easy-to-use parallel execution and synchronization model based on task parallelization. To give the programmer an abstraction for global data (even on distributed memory machines) the Pact runtime system uses virtual shared memory. Execution’s efficiency is improved with data-dependent dynamic load balancing and latency-ma...

Reinforcement learning is a powerful tool for training an agent in a sequential decision based environment and has been successful in many simulated [6] as well as practical [5] domains. In this paper we investigate methods of strengthening the rate of convergence of a single agent RL learner by sharing observations with other independent agents. In contrast to multi-agent reinforcement methods...

Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a versio...

International Symposium on Shared Memory Multiprocessing, 1991 20 Fault-Tolerant Design for Multistage Routing Networks Andr e DeHon, Thomas Knight Jr., and Henry Minsky As the size of digital systems increases, the average length of time between single component failures diminishes. To avoid component related failures, large computers must be fault-tolerant; that is, the computer must perform ...