Add to ORKGEmerging design problems are prompting the use of code motion and speculation in high–level synthesis to shorten schedules and meet tight time–constraints. Unfortunately, they may increase the number of states to an extent not always affordable for embedded systems. We propose a new technique that not only leads to less states, but also speeds up scheduling. Equivalent states are predicted and merged while building the finite state machine. Experiments indicate that flexible code motions can be used, since our technique restrains state expansion. 1. Introduction and Relate
There has been much recent interest in synthesis algorithms that generate finite state machines from...
In flexible manufacturing systems a large number of operations need to be coordinated and supervised...
inite-state machine (FSM) is a fundamental computation model used by many applications. However, FSM...
We introduce a code transformation technique "conditional speculation" that speculates operations by...
The automated synthesis of a design from its behavioral description, known as high level synthesis, ...
The quality of synthesis results for most, high-level synthesis approaches is strongly affected by t...
The quality of high-level synthesis results for designs with complex and nested conditionals and l...
Emerging design problems are prompting the use of code motion and speculative execution in high-leve...
We present two novel strategies to increase the scope for application of speculative code motions: (...
The authors describe a state assignment algorithm for FSMs which produces an assignment of non-neces...
Program synthesis from hierarchical state diagrams has for long been discussed in various communitie...
Abstract — Software components for embedded reactive real-time applications must satisfy tight code ...
This paper presents Metamorphosis 1 -- a novel technique for optimal state assignment targeting mu...
In the high-level synthesis of ASICs or in the code generation for ASIPs, the presence of conditiona...
A simple but efficient method of code assignment in state machines has been presented in this paper....
There has been much recent interest in synthesis algorithms that generate finite state machines from...
In flexible manufacturing systems a large number of operations need to be coordinated and supervised...
inite-state machine (FSM) is a fundamental computation model used by many applications. However, FSM...
We introduce a code transformation technique "conditional speculation" that speculates operations by...
The automated synthesis of a design from its behavioral description, known as high level synthesis, ...
The quality of synthesis results for most, high-level synthesis approaches is strongly affected by t...
The quality of high-level synthesis results for designs with complex and nested conditionals and l...
Emerging design problems are prompting the use of code motion and speculative execution in high-leve...
We present two novel strategies to increase the scope for application of speculative code motions: (...
The authors describe a state assignment algorithm for FSMs which produces an assignment of non-neces...
Program synthesis from hierarchical state diagrams has for long been discussed in various communitie...
Abstract — Software components for embedded reactive real-time applications must satisfy tight code ...
This paper presents Metamorphosis 1 -- a novel technique for optimal state assignment targeting mu...
In the high-level synthesis of ASICs or in the code generation for ASIPs, the presence of conditiona...
A simple but efficient method of code assignment in state machines has been presented in this paper....
There has been much recent interest in synthesis algorithms that generate finite state machines from...
In flexible manufacturing systems a large number of operations need to be coordinated and supervised...
inite-state machine (FSM) is a fundamental computation model used by many applications. However, FSM...