Sciweavers

283 search results - page 32 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
SOSP
2005
ACM
14 years 4 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
FPL
1999
Springer
147views Hardware» more  FPL 1999»
13 years 12 months ago
Synthia: Synthesis of Interacting Automata Targeting LUT-based FPGAs
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
EAAI
2006
75views more  EAAI 2006»
13 years 7 months ago
Multi-agent framework based on smart sensors/actuators for machine tools control and monitoring
Throughout the history, the evolutions of the requirements for manufacturing equipments have depended on the changes in the customers' demands. Among the present trends in th...
Xavier Desforges, Bernard Archimède
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
13 years 11 months ago
Unconstrained Speculative Execution with Predicated State Buffering
Speculative execution is execution of instructions before it is known whether these instructions should be executed. Compiler-based speculative execution has the potential to achi...
Hideki Ando, Chikako Nakanishi, Tetsuya Hara, Masa...
EMSOFT
2006
Springer
13 years 11 months ago
Mixing signals and modes in synchronous data-flow systems
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...
Jean-Louis Colaço, Grégoire Hamon, M...