Philipp Raith

Philipp Raith

Auto-generated profile, based on publicly available information

Philipp Raith

TU Wien

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
10 May 2023 in IEEE Internet Computing
Verified
Journal Article
Closed access
PRPhilipp Raith
Philipp Raith
Stefan NasticStefan Nastic
Stefan Nastic
Schahram DustdarSchahram Dustdar
Schahram Dustdar
The edge–cloud continuum combines heterogeneous resources, which are complex to manage. Serverless edge computing is a suitable candidate to manage the continuum by abstracting away the underlying infrastructure, improving developers’ experiences, and optimizing overall resource utilization. However, understanding and overcoming programming support, reliability, and performance engineering challenges are essential for the success of serverless edge computing. In this article, we review and evaluate the maturity of serverless approaches for the edge–cloud continuum. Our review includes commercial, community-driven offerings and approaches from academia. We identify several maturity levels of serverless edge computing and use them as criteria to evaluate the maturity of current state-of-the-art serverless approaches with a special focus on the programming, reliability, and performance challenges. Finally, we lay a road map toward the next generation of serverless edge computing systems.

26 March 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Open access
AFAlireza Furutanpey
Alireza Furutanpey
PRPhilipp Raith
Philipp Raith
Schahram DustdarSchahram Dustdar
Schahram Dustdar
The rise of mobile AI accelerators allows latency-sensitive applications to execute lightweight Deep Neural Networks (DNNs) on the client side. However, critical applications require powerful models that edge devices cannot host and must therefore offload requests, where the high-dimensional data will compete for limited bandwidth. Split Computing (SC) alleviates resource inefficiency by partitioning DNN layers across devices, but current methods are overly specific and only marginally reduce bandwidth consumption. This work proposes shifting away from focusing on executing shallow layers of partitioned DNNs. Instead, it advocates concentrating the local resources on variational compression optimized for machine interpretability. We introduce a novel framework for resource-conscious compression models and extensively evaluate our method in an environment reflecting the asymmetric resource distribution between edge devices and servers. Our method achieves 60% lower bitrate than a state-of-the-art SC method without decreasing accuracy and is up to 16x faster than offloading with existing codec standards.

18 October 2023 in Software: Practice and Experience
Verified
Journal Article
Open access
PRPhilipp Raith
Philipp Raith
TRThomas Rausch
Thomas Rausch
AFAlireza Furutanpey
Alireza Furutanpey
SDSchahram Dustdar
Schahram Dustdar
This paper presentsfaas‐sim, a simulation framework tailored to serverless edge computing platforms. In serverless computing, platform operators are tasked with efficiently managing distributed computing infrastructure completely abstracted from application developers. To that end, platform operators and researchers need tools to design, build, and evaluate resource management techniques that efficiently use of infrastructure while optimizing application performance. This challenge is exacerbated in edge computing scenarios, where, compared to cloud computing, there is a lack of reference architectures, design tools, or standardized benchmarks.faas‐simbridges this gap by providing (a) a generalized model of serverless systems that builds on the function‐as‐a‐service abstraction, (b) a simulator that uses trace data from real‐world edge computing testbeds and representative workloads, and (c) a network topology generator to model and simulate distributed and heterogeneous edge‐cloud systems. We present the conceptual design, implementation, and a thorough evaluation offaas‐sim. By running experiments on both real‐world test beds and replicating them usingfaas‐sim, we show that the simulator provides accurate results and reasonable simulation performance. We have profiled a wide range of edge computing infrastructure and workloads, focusing on typical edge computing scenarios such as edge AI inference or data processing. Moreover, we present several instances where we have successfully usedfaas‐simto either design, optimize, or evaluate serverless edge computing systems.

21 February 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Open access
AFAlireza Furutanpey
Alireza Furutanpey
QZQiyang Zhang
Qiyang Zhang
PRPhilipp Raith
Philipp Raith
TPTobias Pfandzelter
Tobias Pfandzelter
SWShangguang Wang
Shangguang Wang
Schahram DustdarSchahram Dustdar
Schahram Dustdar
Nanosatellite constellations equipped with sensors capturing large geographic regions provide unprecedented opportunities for Earth observation. As constellation sizes increase, network contention poses a downlink bottleneck. Orbital Edge Computing (OEC) leverages limited onboard compute resources to reduce transfer costs by processing the raw captures at the source. However, current solutions have limited practicability due to reliance on crude filtering methods or over-prioritizing particular downstream tasks. This work presents an OEC-native and task-agnostic feature compression method that preserves prediction performance and partitions high-resolution satellite imagery to maximize throughput. Further, it embeds context and leverages inter-tile dependencies to lower transfer costs with negligible overhead. While the encoding prioritizes features for downstream tasks, we can reliably recover images with competitive scores on quality measures at lower bitrates. We extensively evaluate transfer cost reduction by including the peculiarity of intermittently available network connections in low earth orbit. Finally, we test the feasibility of our system for standardized nanosatellite form factors. We demonstrate that the proposed approach permits downlinking over 100× the data volume without relying on prior information on the downstream tasks.

12 November 2023
Verified
Conference Paper
Open access
ADAditya Dhakal
Aditya Dhakal
PRPhilipp Raith
Philipp Raith
LWLogan Ward
Logan Ward
RERolando P. Hong Enriquez
Rolando P. Hong Enriquez
GRGourav Rattihalli
Gourav Rattihalli
DMDejan Milojicic
Dejan Milojicic
Function-as-a-service (FaaS) is a promising execution environment for high-performance computing (HPC) and machine learning (ML) applications as it offers developers a simple way to write and deploy programs. Nowadays, GPUs and other accelerators are indispensable for HPC and ML workloads. These accelerators are expensive to acquire and operate; consequently, multiplexing them can increase their financial profitability. However, we have observed that state-of-the-art FaaS frameworks usually treat accelerator as a single device to run single workload and have little support for multiplexing accelerators. In this work, we have presented techniques to multiplex GPUs with Parsl, a popular FaaS framework. We demonstrate why GPU multiplexing is beneficial for certain applications and how we have implemented GPU multiplexing in Parsl. With our enhancements, we show up to 60% lower task completion time and 250% improvement in the inference throughput of a large language model when multiplexing a GPU compared to running a single instance without multiplexing. We plan to extend the support for GPU multiplexing in FaaS platforms by tackling the challenges of changing compute resources in the partition and approximating how to right-size a GPU partition for a function.

1 September 2026 in IEEE Transactions on Services Computing
Verified
Journal Article
Open access
BSBoris Sedlak
Boris Sedlak
PRPhilipp Raith
Philipp Raith
AMAndrea Morichetta
Andrea Morichetta
VCVictor Casamayor-Pujol
Victor Casamayor-Pujol
Schahram DustdarSchahram Dustdar
Schahram Dustdar