This paper presents a new algorithm for clock cy-cle minimizing and protocol preserving scheduling of input and output operations. The algorithm relies on the possibility to overlap protocols at dierent ports in time without changing the behavior. It merges the operations required for complete protocols and allows thus for a compact schedule of a set of correlated proto-cols. Both, input and scheduled output for subsequent High-Level- and RT-Synthesis use VHDL for descrip-tion
High level synthesis (HLS) using C/C++ has increasingly become a critical step in the realization of...
Dynamic loop scheduling, an algorithm that can efficiently schedule large, control-flow dominated de...
In this thesis we propose techniques to simplify the integration of subsystems while minimizing the ...
In this paper, we present for the first time a mathemati-cal framework for solving a special instanc...
A new algorithm to solve operation scheduling problems is presented and compared with the best ones ...
Abstract—In ultra-deep submicron very large-scale integration (VLSI) designs, clock network layout p...
This thesis presents a framework for the specification and compilation of modules in a system that u...
This paper analyzes the effect of resource sharing and assignment on the clock period of the synthes...
this paper we describe the operation of a tool that performs clock gating on RTlevel VHDL by transfo...
A methodology that crriciently translates Estelle formal specifications into a VHDL description, sui...
Scheduling algorithms concentrating on control-flow rather than data-flow optimisations have not bee...
Early scheduling algorithms usually adjusted the clock cycle duration to the execution time of the s...
International audienceAbstract--Logical time has proved very useful to model heterogeneous and concu...
A low-complexity method using synchronous wrappers is proposed to simplify communication between mod...
This paper addresses the hardware implementation of a dynamic scheduler for non-manifest data depend...
High level synthesis (HLS) using C/C++ has increasingly become a critical step in the realization of...
Dynamic loop scheduling, an algorithm that can efficiently schedule large, control-flow dominated de...
In this thesis we propose techniques to simplify the integration of subsystems while minimizing the ...
In this paper, we present for the first time a mathemati-cal framework for solving a special instanc...
A new algorithm to solve operation scheduling problems is presented and compared with the best ones ...
Abstract—In ultra-deep submicron very large-scale integration (VLSI) designs, clock network layout p...
This thesis presents a framework for the specification and compilation of modules in a system that u...
This paper analyzes the effect of resource sharing and assignment on the clock period of the synthes...
this paper we describe the operation of a tool that performs clock gating on RTlevel VHDL by transfo...
A methodology that crriciently translates Estelle formal specifications into a VHDL description, sui...
Scheduling algorithms concentrating on control-flow rather than data-flow optimisations have not bee...
Early scheduling algorithms usually adjusted the clock cycle duration to the execution time of the s...
International audienceAbstract--Logical time has proved very useful to model heterogeneous and concu...
A low-complexity method using synchronous wrappers is proposed to simplify communication between mod...
This paper addresses the hardware implementation of a dynamic scheduler for non-manifest data depend...
High level synthesis (HLS) using C/C++ has increasingly become a critical step in the realization of...
Dynamic loop scheduling, an algorithm that can efficiently schedule large, control-flow dominated de...
In this thesis we propose techniques to simplify the integration of subsystems while minimizing the ...