Projects

TornadoInsight is an open source IntelliJ plugin that aims to enhance the experience of developers when working with TornadoVM. It provides a built-in on-the-fly static checker, empowering developers to identify unsupported Java features in TornadoVM and understand the reasons behind these limitations. Additionally, it introduces a dynamic testing framework that enables developers to easily test individual TornadoVM tasks. It automatically wraps TornadoVM tasks, invoking the native TornadoVM runtime on the developers' machines for seamless debugging and testing.

TornadoVM is a plug-in to OpenJDK and GraalVM that allows programmers to automatically run Java programs on heterogeneous hardware. TornadoVM currently targets OpenCL-compatible devices and it runs on multi-core CPUs, dedicated GPUs (NVIDIA, AMD), integrated GPUs (Intel HD Graphics and ARM Mali), and FPGAs (Intel and Xilinx).

The constant growth of data is pushing the storage systems towards ever-increasing I/O bandwidth and lower latency requirements. In recent years, the Non-Volatile Memory Express (NVMe) standard has enabled SSD drives to deliver high I/O rates by allowing the storage to be connected directly via the fastest available interconnect (i.e. PCIe) to the processing chip. Although SSDs have become ubiquitous in data centres, reducing the latency gap with the main memory is still a first-order challenge. Additionally, the adoption of FPGAs in data centres is creating opportunities to accelerate various applications and/or OS operations. While FPGAs in data centres have been connected via PCIe to mostly x86 servers, there are now also available heterogeneous System on Chips (SoCs) with multi-cores, and FPGAs integrated on the same die and connected by an on-chip interconnect.

Iterated Functions are a broad class of mathematical equations with interesting properties when applied iteratively at some initial data. The Mandelbrot set (and Julia set) is based on iterated functions. However, there are large classes of iterated functions which remain largely unexplored, and due to their computational complexity they are very suitable for hardware acceleration. In this work we have developed a real-time fractal flame rendering algorithm. The algorithm was designed and fully implemented on an ALTERA DE2-115 FPGA board with HDMI output. The implemented system produces 200,000,000 points per second, vs. 1,280,000 in highly optimized software in C, yielding a speedup of ~156x. This is the first FPGA-based flame rendering implementation to our knowledge, and the results are very promising for further study.

Graph mining is an important research area within the domain of data mining. One of the most challenging tasks of graph mining is frequent subgraph mining. This work presents the first FPGA-based implementation, to the best of our knowledge, of the most efficient and well-known algorithm for the Frequent Subgraph Mining (FSM) problem, (i.e. gSpan). The proposed system, named High Performance Computing-gSpan (HPC-gSpan), achieves manyfold speedup vs. the official software solution of the gboost library when executed on a high-end CPU for various real-world datasets.