Ana-Lucia Varbanescu

Ana-Lucia Varbanescu

Auto-generated profile, based on publicly available information

Ana-Lucia Varbanescu

University of Twente

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
15 April 2023
Verified
Conference Paper
Open access
SSStephen Nicholas Swatman
Stephen Nicholas Swatman
AVAna-Lucia Varbanescu
Ana-Lucia Varbanescu
Andy D. PimentelAndy D. Pimentel
Andy D. Pimentel
ASAndreas Salzburger
Andreas Salzburger
AKAttila Krasznahorkay
Attila Krasznahorkay
We present a novel benchmark suite for implementations of vector fields in high-performance computing environments to aid developers in quantifying and ranking their performance. We decompose the design space of such benchmarks into access patterns and storage backends, the latter of which can be further decomposed into components with different functional and non-functional properties. Through compile-time meta-programming, we generate a large number of benchmarks with minimal effort and ensure the extensibility of our suite. Our empirical analysis, based on real-world applications in high-energy physics, demonstrates the feasibility of our approach on CPU and GPU platforms, and highlights that our suite is able to evaluate performance-critical design choices. Finally, we propose that our work towards composing vector fields from elementary components is not only useful for the purposes of benchmarking, but that it naturally gives rise to a novel library for implementing such fields in domain applications.


8 April 2024
Verified
Conference Paper
Open access
JCJolly Chen
Jolly Chen
MDMonica Dessole
Monica Dessole
AVAna-Lucia Varbanescu
Ana-Lucia Varbanescu
The world’s largest particle accelerator, located at CERN, produces petabytes of data that need to be analysed efficiently, to study the fundamental structures of our universe. ROOT RDataFrame is an open-source C++ data analysis interface, developed for this purpose. With the increasing heterogeneity in computing facilities, it becomes crucial to efficiently support GPGPUs. In this work, we describe our prototyped CUDA implementation and its migration to SYCL, focusing on a core high-energy physics (HEP) operation in RDataFrame – histogramming. In addition, we provide a comparative performance analysis of two SYCL compilers (AdaptiveCpp and DPC++) against the reference CUDA implementation.

6 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
FBFelix Brakel
Felix Brakel
UOUraz Odyurt
Uraz Odyurt
AVAna-Lucia Varbanescu
Ana-Lucia Varbanescu
Neural networks have become a cornerstone of machine learning. As the trend for these to get more and more complex continues, so does the underlying hardware and software infrastructure for training and deployment. In this survey we answer three research questions: "What types of model parallelism exist?", "What are the challenges of model parallelism?", and "What is a modern use-case of model parallelism?" We answer the first question by looking at how neural networks can be parallelised and expressing these as operator graphs while exploring the available dimensions. The dimensions along which neural networks can be parallelised are intra-operator and inter-operator. We answer the second question by collecting and listing both implementation challenges for the types of parallelism, as well as the problem of optimally partitioning the operator graph. We answer the last question by collecting and listing how parallelism is applied in modern multi-billion parameter transformer networks, to the extend that this is possible with the limited information shared about these networks.

10 October 2022
Verified
Conference Paper
Open access
APAte Penders
Ate Penders
AVAna Lucia Varbanescu
Ana Lucia Varbanescu
GPGregor Pavlin
Gregor Pavlin
HSHenk Sips
Henk Sips
Presence monitoring or intrusion detection in a location/area are examples of decision-support applications. Decision-support applications are applications where monitoring is used to collect (heterogeneous) data and create situational awareness, which further requires decisions and/or actions. As such, decision-support software consists of different interconnected components with very diverse roles, whose communication and synchronization are essential for the application functionality and performance. Despite this complexity, software design for decision-support is often driven by short-term functional requirements and only supported by designers’ previous experience. In the current non-systematic approach, mistakes can be easily made, and can be very difficult to repair. In this work, we describe our systematic method for efficient and effective decision-support software design, based on application design-space exploration (DSE). To this end, we describe how to build a design space and present structured methods to traverse the design space towards software solutions that meet user requirements for both functionality and performance.

7 May 2024
Verified
Conference Paper
Open access
SSStephen Nicholas Swatman
Stephen Nicholas Swatman
AVAna-Lucia Varbanescu
Ana-Lucia Varbanescu
Andy D. PimentelAndy D. Pimentel
Andy D. Pimentel
ASAndreas Salzburger
Andreas Salzburger
AKAttila Krasznahorkay
Attila Krasznahorkay
The layout of multi-dimensional data can have a significant impact on the efficacy of hardware caches and, by extension, the performance of applications. Common multi-dimensional layouts include the canonical row-major and column-major layouts as well as the Morton curve layout. In this paper, we describe how the Morton layout can be generalized to a very large family of multi-dimensional data layouts with widely varying performance characteristics. We posit that this design space can be efficiently explored using a combinatorial evolutionary methodology based on genetic algorithms. To this end, we propose a chromosomal representation for such layouts as well as a methodology for estimating the fitness of array layouts using cache simulation. We show that our fitness function correlates to kernel running time in real hardware, and that our evolutionary strategy allows us to find candidates with favorable simulated cache properties in four out of the eight real-world applications under consideration in a small number of generations. Finally, we demonstrate that the array layouts found using our evolutionary method perform well not only in simulated environments but that they can effect significant performance gains---up to a factor ten in extreme cases---in real hardware.