Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: speed independent circuits

Sortuj według:

Ogranicz wyniki do:

Signal-oriented processing in a speed independent environment

Katkow A.

Journal of Theoretical and Applied Computer Science

2013

Vol. 7, nr 2

59--71

This article is devoted to the research of a simulation system that uses signal-oriented integrators. The simulation environment is based on SIC (Speed Independent Circuits). The article first examines the implementation of arithmetical operations, which have been inspired by the natural world, in environments lacking global synchronization of computational processes. The article then describes the process used to calculate the Riemann integral using the signal oriented integrator and develops integration algorithms (rectangles and trapezoids) for use in such environments. It includes pseudo-code that implements these algorithms. A method is then discussed for fixing the duration of transients in combinational logic circuits and for a signal-oriented implementation of the integration process. It also considers the mapping of the signal oriented integration process as a fuzzy integration process. Finally, the article presents the results of a computer simulation of a system with signal-oriented integrators for solving differential equations of partial derivatives.

Flat Arbiters

Mokhov A., Khomenko V., Yakovlev A.

Fundamenta Informaticae

2011

Vol. 108, nr 1/2

63-90

A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel. This ‘flat’ arbitration is prone to new threats such as formation of cycles (leading to deadlocks), but at the same time opens up new opportunities for designing arbitration structures with different decision policies due to the availability of the global order relation between requests. To facilitate resolution of such cycles and further developments in the context of flat arbitration, the paper presents new theoretical results, including a proof of correctness of a generic structure for the N-way arbiter decision logic. In particular, in some situations a request that lost some pairwise arbitrations has to be granted to avoid a deadlock.