Aitor Arjona

dblp:267/5356 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0001-5451-4865ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 3 first-author · 4 since 2021Computer networks · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Burst Computing: Quick, Sudden, Massively Parallel Processing on Serverless Resources
Daniel Barcelona Pons, Aitor Arjona, Pedro García López, Enrique Molina-Giménez, Stepan Klymonchuk
USENIX ATC2
2024 Dataplug: Unlocking extreme data analytics with on-the-fly dynamic partitioning of unstructured data
abstract
The elasticity of the Cloud is very appealing for processing large scientific data. However, enormous volumes of unstructured research data, totaling petabytes, remain untapped in data repositories due to the lack of efficient parallel data access. Even-sized partitioning of these data to enable its parallel processing requires a complete re-write to storage, becoming prohibitively expensive for high volumes. In this article we present Dataplug, an extensible framework that enables fine-grained parallel data access to unstructured scientific data in object storage. Dataplug employs read-only, format-aware indexing, allowing to define dynamically-sized partitions using various partitioning strategies. This approach avoids writing the partitioned dataset back to storage, enabling distributed workers to fetch data partitions on-the-fly directly from large data blobs, efficiently leveraging the high bandwidth capability of object storage. Validations on genomic (FASTQGZip) and geospatial (LiDAR) data formats demonstrate that Dataplug considerably lowers pre-processing compute costs (between 65.5% — 71.31% less) without imposing significant overheads.
Aitor Arjona, Pedro García López, Daniel Barcelona Pons
CCGrid1
2024 Exploring Secure and Efficient Temporary Data Sharing Between Co-Located Kubernetes Containers
abstract
Data-intensive workloads like distributed deep learning generate significant temporary data between pipeline stages, requiring efficient temporary data storage solutions. Platforms like Kubernetes abstract infrastructure complexities by using loosely-coupled containers that leverage disaggregated storage for sharing data and storing state. This design facilitates workload deployment and scaling in the Cloud-Continuum, but also becomes a bottleneck, particularly in resource-constrained edge environments. A tiered storage system for temporary data can alleviate this issue by exploiting data locality: leveraging local storage attached to the physical hosts to share data between colocated containers without the need of accessing remote storage. This article serves as a preliminary work to explore how to efficiently and securely share data between co-located containers on the same physical host for workloads deployed on Kubernetes. Our experiments demonstrate that using CSI shared local volume mounts can be used not only to share files in an efficient and secure way but also to create shared memory regions and pass file descriptors, providing different viable approaches to data sharing for layered storage systems in Kubernetes.
Aitor Arjona, Bernard Metzler, Pascal Spörri
ICNP1
2023 Transparent serverless execution of Python multiprocessing applications
abstract
Access transparency means that both local and remote resources are accessed using identical operations. With transparency, unmodified single-machine applications could run over disaggregated compute, storage, and memory resources. Hiding the complexity of distributed systems through transparency would have great benefits, like scaling-out local-parallel scientific applications over flexible disaggregated resources in the Cloud. This paper presents a performance evaluation where we assess the feasibility of access transparency over state-of-the-art Cloud disaggregated resources for Python multiprocessing applications. We have interfaced the multiprocessing module with an implementation that transparently runs processes on serverless functions and uses an in-memory data store for shared state. To evaluate transparency, we run in the Cloud four unmodified applications: Uber Research’s Evolution Strategies, Baselines-AI’s Proximal Policy Optimization, Pandaral.lel’s dataframe, and Scikit Learn’s Hyperparameter tuning. We compare execution time and scalability of the same application running over disaggregated resources using our library, with the single-machine Python multiprocessing libraries in a large VM. For equal resources, applications efficiently using message-passing abstractions achieve comparable results despite the significant overheads of remote communication. Other shared-memory intensive applications do not perform due to high remote memory latency. The results show that Python’s multiprocessing library design is an enabler towards transparency: legacy applications using efficient disaggregated abstractions can transparently scale beyond VM limited resources for increased parallelism without changing the underlying code or architecture.
Aitor Arjona, Gerard Finol, Pedro García López
Future Gener. Comput. Syst.1
2021 Triggerflow: Trigger-based orchestration of serverless workflows
abstract
As more applications are being moved to the Cloud thanks to serverless computing, it is increasingly necessary to support the native life cycle execution of those applications in the data center. But existing cloud orchestration systems either focus on short-running workflows (like IBM Composer or Amazon Step Functions Express Workflows) or impose considerable overheads for synchronizing massively parallel jobs (Azure Durable Functions, Amazon Step Functions). None of them are open systems enabling extensible interception and optimization of custom workflows. We present Triggerflow: an extensible Trigger-based Orchestration architecture for serverless workflows. We demonstrate that Triggerflow is a novel serverless building block capable of constructing different reactive orchestrators (State Machines, Directed Acyclic Graphs, Workflow as code, Federated Learning orchestrator). We also validate that it can support high-volume event processing workloads, auto-scale on demand with scale down to zero when not used, and transparently guarantee fault tolerance and efficient resource usage when orchestrating long running scientific workflows.
Aitor Arjona, Pedro García López, Josep Sampé, Aleksander Slominski, Lionel Villard
Future Gener. Comput. Syst.1