In this paper, we address deadlock management in nested transactions. In our strategy, deadlocks are detected through the occurrence of cycles in a waits-for graph (WFG). However, the process of looking for cycles in the WFG considering all its nodes and edges can be very time-consuming. To accelerate this process, we propose the detection arcs. In essence, a detection arc represents a higher l...

Tasking deadlock is one of the most serious and complex problems concerning the reliability of concurrent systems with Ada. In this paper, tasking deadlocks which may occur in Ada 95 programs are investigated, a representation, named the Task-Wait-For Graph, for task synchronization waiting state of an Ada 95 program is proposed, and a runtime detection method for the tasking deadlocks based on...

In stereovision, the use of frequency domain methods raises the problems of the choice of a family of filters and a strategy to use it. This paper compares three families : Gabor filters, finite prolate spheroidal sequences and Weng's Windowed Fourier of Gaussian (WFG). Then a comparison between two strategies is done : an image-based choice of filters and the use of a "complete" subset of filt...