Vasilios Kelefouras

Vasilios Kelefouras

Auto-generated profile, based on publicly available information

Vasilios Kelefouras

School of Engineering, Computing and Mathematics, University of Plymouth, Plymouth, United Kingdom

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
7 May 2024
Verified
Conference Paper
Open access
MKMilad Kokhazadeh
Milad Kokhazadeh
Georgios KeramidasGeorgios Keramidas
Georgios Keramidas
VKVasilios Kelefouras
Vasilios Kelefouras
ISIakovos Stamoulis
Iakovos Stamoulis
Low-Rank Factorization (LRF) is a popular compression technique used in Deep Neural Networks (DNNs). LRF can reduce both the memory size and the arithmetic operations in a DNN layer by approximating a weight tensor/matrix by two or more smaller tensors/matrices. Employing LRF to DNN is a challenging task for several reasons. First, the exploration space is massive and different solutions provide different trade-offs among memory, FLOPs, inference time, and validation accuracy; second, multiple DNN layers and multiple LRF algorithms must be considered; third, every extracted solution must undergo through a calibration phase and this makes the LRF process time-consuming. In this paper, a methodology, called Denseflex, is presented that formulates the LRF problem as an inference time vs. FLOPs vs. memory vs. validation accuracy Design Space Exploration (DSE) problem. Moreover, to the best of our knowledge, this is the first work that proposes a methodology to efficiently combine two different LRF methods (Singular Value Decomposition -SVD- and Tensor Train Decomposition -TTD-) in the same framework. Denseflex is formulated as a design tool in which the user can provide specific memory, FLOPs, and/or execution time constraints and the tool will output a set of solutions that meet the given constraints avoiding the time-consuming re-training phases. Our results indicate that our approach is able to prune the design space by 62% (on average) over related works for nine DNN models (up to 88% in AlexNet), while the extracted LRF solutions exhibit both lower memory footprints and lower execution times compared to the initial model.

1 April 2015 in Computer Languages, Systems & Structures
Verified
Journal Article
Closed access
VKVasilios Kelefouras
Vasilios Kelefouras
AKAngeliki Kritikakou
Angeliki Kritikakou
CGCostas Goutis
Costas Goutis

7 May 2024
Verified
Conference Paper
Open access
TATheologos Anthimopoulos
Theologos Anthimopoulos
Georgios KeramidasGeorgios Keramidas
Georgios Keramidas
VKVasilios Kelefouras
Vasilios Kelefouras
ISIakovos Stamoulis
Iakovos Stamoulis
For the past several decades, optimizing compilers have been a primary area of focus in both industry and academia. This continued research interest is a testament to the complexity of this task, primarily stemming from the vast number of parameters that must be explored to attain near-optimal results. One of the key compiler optimizations is "Register Blocking (RB)" also known as "Register-level Tiling" or "unroll-and-jam". RB can strongly reduce the number of executed Load/Store (L/S) instructions, and as a consequence the number of data accesses in memory hierarchy, but due to its inherent complexities, fine-tuning is essential for its effective implementation. To address this problem, in this work a new methodology is proposed for RB. The RB factors, the loops to apply RB, the number of allocated variables/registers per array reference, and the loops' ordering are generated by an analytical model, leveraging the target hardware (HW) architecture details and loop kernel characteristics. The proposed methodology has been evaluated on both embedded and general-purpose CPUs across seven well-known loop kernels, achieving high speedups and L/S instruction gains over GCC compiler, handwritten optimized codes, and the popular Pluto tool.