Skip to content

Author

Georgios Bouloukakis

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Open access Jul 2026

Profiling Neural Network Partitioning Strategies for Inference across the Computing Continuum

As deep learning permeates latency-sensitive domains such as autonomous driving and smart surveillance, deploying neural networks (NNs) across the computing continuum (CC), from IoT devices to edge servers and cloud platforms, has become increasingly important. In such heterogeneous IoT-Edge-Cloud environments, distributed inference promises reduced latency, improved privacy, and better resource utilization. Yet, determining how to deploy NNs over heterogeneous IoT-Edge-Cloud nodes remains a difficult and largely manual process. This paper presents a principled and extensible framework for evaluating distributed inference of NNs in heterogeneous CC infrastructures. We introduce a formal model that unifies functional, pipelined, and data-parallel partitioning strategies within a single abstraction over heterogeneous CC topologies, enabling structured cross-strategy comparison. Building on this foundation, we implement a distributed inference orchestrator that supports flexible deployment of partitioned CNNs, and introduce PartiBench, a benchmarking tool that profiles segments and guides their placement. Our evaluation demonstrates how the framework exposes key performance trade-offs, offering actionable insights into latency, memory use, and communication overhead across IoT-Edge-Cloud nodes. These contributions enable empirical, cross-strategy comparison of distributed inference deployments and provide a basis for future automated placement methods in heterogeneous IoT-Edge-Cloud systems.

Nikolaos Papadakis, Alexandros Angourakis, K. Magoutis et al. · 0 citations
Open access Jul 2026

Performance Prediction of Data-Rebalancing Actions in Sharded NoSQL Clusters

Scalable storage systems typically provide mechanisms for re-distributing data over time to ensure a balanced storage allocation. Such mechanisms have traditionally been considered as background activities meant to run at low priority, to avoid penalizing applications accessing storage. In this work, we focus on an alternative design point where data re-distribution is run as a high-priority activity, meant to re-balance data at the full speed allowed by the newly added resources. Such rapid redistribution has become viable in recent years due to the rise of low-overhead technologies in the networking and disk storage space. A challenge in such a scenario is to schedule data transfer flows to newly added nodes in a way that fully and efficiently utilizes network, CPU, and disk resources in the new nodes, while avoiding overload. To understand the impact of different parameters of the rebalance process, such as the number of simultaneous senders, we develop a queueing network (QN) model of the process used in MongoDB, and describe a preliminary evaluation of performance prediction by the QN model via simulations.

G. Paterakis, E. Ntallaris, K. Magoutis et al. · 0 citations