Vlad-Mihai Sima

Vlad-Mihai Sima

Auto-generated profile, based on publicly available information

Vlad-Mihai Sima

Delft University of Technology

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 December 2015 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
RNRazvan Nane
Razvan Nane
VSVlad-Mihai Sima
Vlad-Mihai Sima
Christian PilatoChristian Pilato
Christian Pilato
JCJongsok Choi
Jongsok Choi
BFBlair Fort
Blair Fort
KBKoen Bertels
Koen Bertels
High-level synthesis (HLS) is increasingly popular for the design of high-performance and energy-efficient heterogeneous systems, shortening time-to-market and addressing today's system complexity. HLS allows designers to work at a higher-level of abstraction by using a software program to specify the hardware functionality. Additionally, HLS is particularly interesting for designing field-programmable gate array circuits, where hardware implementations can be easily refined and replaced in the target device. Recent years have seen much activity in the HLS research community, with a plethora of HLS tool offerings, from both industry and academia. All these tools may have different input languages, perform different internal optimizations, and produce results of different quality, even for the very same input description. Hence, it is challenging to compare their performance and understand which is the best for the hardware to be implemented. We present a comprehensive analysis of recent HLS tools, as well as overview the areas of active interest in the HLS research community. We also present a first-published methodology to evaluate different HLS tools. We use our methodology to compare one commercial and three academic tools on a common set of C benchmarks, aiming at performing an in-depth evaluation in terms of performance and the use of resources.

1 August 2012
Verified
Conference Paper
Closed access
RNRazvan Nane
Razvan Nane
VSVlad-Mihai Sima
Vlad-Mihai Sima
BOBryan Olivier
Bryan Olivier
RMRoel Meeuws
Roel Meeuws
YYYana Yankova
Yana Yankova
KBKoen Bertels
Koen Bertels
In the last decade, a considerable amount of effort was spent on raising the implementation level of hardware systems by automatically extracting the parallelism from input applications and using tools to generate Hardware/Software co-design solutions. However, the tools developed thus far either focus on particular application domains or they impose severe restrictions on the input language. In this paper, we present the DWARV 2.0 compiler that accepts general C-code as input and generates synthesizable VHDL for unrestricted application domains. Dissimilar to previous hardware compilers, this implementation is based on CoSy compiler framework. This allowed us to build a highly modular compiler in which standard or custom optimizations can be easily integrated. Validation experiments showed speed-ups of up to 4.41× when comparing against another state of the art hardware compiler.

1 November 2015
Verified
Conference Paper
Closed access
NANauman Ahmed
Nauman Ahmed
VSVlad-Mihai Sima
Vlad-Mihai Sima
EHErnst Houtgast
Ernst Houtgast
KBKoen Bertels
Koen Bertels
ZAZaid Al-Ars
Zaid Al-Ars
The fast decrease in cost of DNA sequencing has resulted in an enormous growth in available genome data, and hence led to an increasing demand for fast DNA analysis algorithms used for diagnostics of genetic disorders, such as cancer. One of the most computationally intensive steps in the analysis is represented by the DNA read alignment. In this paper, we present an accelerated version of BWA-MEM, one of the most popular read alignment algorithms, by implementing a heterogeneous hardware/software optimized version on the Convey HC2ex platform. A challenging factor of the BWA-MEM algorithm is the fact that it consists of not one, but three computationally intensive kernels: SMEM generation, suffix array lookup and local Smith-Waterman. Obtaining substantial speedup is hence contingent on accelerating all of these three kernels at once. The paper shows an architecture containing two hardware-accelerated kernels and one kernel optimized in software. The two hardware kernels of suffix array lookup and local Smith-Waterman are able to reach speedups of 2.8x and 5.7x, respectively. The software optimization of the SMEM generation kernel is able to achieve a speedup of 1.7x. This enables a total application acceleration of 2.6x compared to the original software version.

1 July 2015
Verified
Conference Paper
Closed access
EHErnst Joachim Houtgast
Ernst Joachim Houtgast
VSVlad-Mihai Sima
Vlad-Mihai Sima
KBKoen Bertels
Koen Bertels
ZAZaid Al-Ars
Zaid Al-Ars
We present the first accelerated implementation of BWA-MEM, a popular genome sequence alignment algorithm widely used in next generation sequencing genomics pipelines. The Smith-Waterman-like sequence alignment kernel requires a significant portion of overall execution time. We propose and evaluate a number of FPGA-based systolic array architectures, presenting optimizations generally applicable to variable length Smith-Waterman execution. Our kernel implementation is up to 3× faster, compared to software-only execution. This translates into an overall application speedup of up to 45%, which is 96% of the theoretically maximum achievable speedup when accelerating only this kernel.

1 March 2012
Verified
Conference Paper
Closed access
GMGiovanni Mariani
Giovanni Mariani
VSVlad-Mihai Sima
Vlad-Mihai Sima
GPGianluca Palermo
Gianluca Palermo
VZVittorio Zaccaria
Vittorio Zaccaria
CSCristina Silvano
Cristina Silvano
KBKoen Bertels
Koen Bertels
Resource run-time managers have been shown particularly effective for coordinating the usage of the hardware resources by multiple applications, eliminating the necessity of a full-blown operating system. For this reason, we expect that this technology will be increasingly adopted in emerging multi-application reconfigurable systems. This paper introduces a fully automated design flow that exploits multi-objective design space exploration to enable runtime resource management for the Molen reconflgurable architecture. The entry point of the design flow is the application source code; our flow is able to heuristically determine a set of candidate hardware/software configurations of the application (i.e., operating points) that trade off the occupation of the reconflgurable fabric (in this case, an FPGA), the load of the master processor and the performance of the application itself. This information enables a run-time manager to exploit more efficiently the available system resources in the context of multiple applications. We present the results of an experimental campaign where we applied the proposed design flow to two reference audio applications mapped on the Molen architecture. The analysis proved that the overhead of the design space exploration and operating points extraction with respect to the original Molen flow is within reasonable bounds since the final synthesis time still represents the major contribution. Besides, we have found that there is a high variance in terms of execution time speedup associated with the operating points of the application (characterized by a different usage of the FPGA) which can be exploited by the run-time manager to increase/decrease the quality of service of the application depending on the available resources1.

18 November 2010 in IEEE Micro
Verified
Journal Article
Closed access
KBKoen Bertels
Koen Bertels
VSVlad-Mihai Sima
Vlad-Mihai Sima
YYYana Yankova
Yana Yankova
GKGeorgi Kuzmanov
Georgi Kuzmanov
WLWayne Luk
Wayne Luk
AMAndrea Michelotti
Andrea Michelotti
Developing heterogeneous multicore platforms requires choosing the best hardware configuration for mapping the application, and modifying that application so that different parts execute on the most appropriate hardware component. The hArtes toolchain provides the option of automatic or semi-automatic support for this mapping. During test and validation on several computation-intensive applications, hArtes achieved substantial speedups and drastically reduced development times.