We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
System-level power exploration requires tools for estimation of the overall power consumed by a system, as well as a detailed breakdown of the consumption of its main functional b...
Luca Benini, Marco Ferrero, Alberto Macii, Enrico ...
One of the major difficulties with teaching the first programming course is input/output. It is desirable to show students how to input data and output results early in the course...