Some of the offered MSEI/MSCE research internships may be offered as tasks that also can be carried out in the context of the Project Lab Integrated Systems. If this applies it is explicitly mentioned in the associated topic description.
Interested in an internship or a thesis?
Often, new topics are in preparation for being advertised, which are not yet listed here. Sometimes there is also the possibility to define a topic matching your specific interests. Therefore, do not hesitate to contact our scientific staff, if you are interested in contributing to our work. If you have further questions concerning a thesis at the institute please contact Dr. Thomas Wild.
Efficient Packet Arrival-Location Resolution for Distributed Packet Processing
Description
Background
Modern networked systems increasingly rely on virtualization, indirection, and pooled accelerator resources to improve scalability and resource utilization. In emerging DPU- or SmartNICbased pooling architectures, processing a packet may require access to, or updates of, flow-, connection-, or protocol-related context maintained by other DPUs. For example, a packet may arrive at one DPU or SmartNIC, while the relevant state context for the corresponding flow or connection may reside on another DPU.
This breaks the traditional assumption that packet arrival and packet processing naturally happen at the same location. In a distributed processing environment, the arrival location of each packet is not automatically known to all relevant processing entities. Therefore, the system needs an efficient mechanism to inform the responsible DPUs where packets have arrived.
In the context of distributed packet processing, this issue becomes especially important for single-flow processing, where packets belonging to the same flow may require ordered processing, shared state access, or state synchronization across multiple DPUs.
Objective
The objective of this FP is to design and evaluate an efficient packet arrival-location resolution mechanism for distributed DPU/SmartNIC-based packet processing.
A straightforward solution is to broadcast or multicast the arrival information of every packet to all relevant DPUs. However, this approach can consume a large amount of interconnect bandwidth, especially under high packet rates or larger DPU pools. Therefore, this project aims to develop a more scalable mechanism with lower communication overhead.
The student is expected to analyze the limitations of baseline approaches, identify the key design trade-offs, and propose an improved arrival-location resolution scheme. The proposed scheme should be evaluated with respect to notification latency, bandwidth consumption, metadata or storage overhead, and scalability.
Evaluation
The proposed solution will be evaluated in comparison with the baseline models.
If a suitable gem5-based simulation model is available in time, the mechanisms may be implemented and evaluated in C++ within the gem5 simulation environment. Otherwise, the student will build an event-driven timing-level simulation model in Python.
The main evaluation metrics include:
- Arrival-location notification latency: the time between the physical arrival of a packet at one DPU and the moment when the relevant target DPU or target DPU group becomes aware of the packet’s arrival location.
- Inter-DPU bandwidth consumption: the amount of communication traffic introduced by the discovery or advertising mechanism.
- Metadata or storage overhead: the number of bits required per packet, flow, table entry, or local arrival-location table, depending on the mechanism.
- Scalability: the behavior of the mechanism as the number of DPUs in the target DPU group increases, for example from 2 to 8 DPUs.
Although the student may seek inspiration from general distributed systems, where problem occur as: when work arrives at one node but may need the context on another node, the system must efficiently advertise or discover the arrival location while avoiding excessive communication overhead, the arrival-location resolution mechanism should be evaluated with a simplified pipelinebased packet-processing model, rather than in a stand-alone general distributed processing scenario. In addition, the evaluation should discuss how arrival-location resolution affects packet-processing progress.
Baseline Models
The project should compare the proposed mechanism against the following baseline or reference models.
- Broadcast or Multicast upon Every Packet Arrival: In this baseline, whenever a packet arrives at a DPU, the arrival information is broadcast or multicast to all relevant DPUs. This approach is simple and ensures that all DPUs can learn the packet arrival location, but it may introduce significant bandwidth overhead.
- Timely Advertising: In this model, several advertising strategies are combined with a local arrival-location table. The table records where packets have arrived and allows responsible DPUs to advertise packet arrival in a timely manner. Further details of this model will be provided by the supervisor during the project. The student is expected to implement, compare, and discuss these models with respect to their notification latency, bandwidth consumption, metadata/storage overhead, and scalability.
Prerequisites
The student should have the following background:
- Basic knowledge of computer networks, including the OSI 7-layer model
- Basic knowledge of computer architecture, especially SoC design and on-chip/off-chip interconnects
- Basic knowledge of RDMA and RoCE
- Good programming skills in Python
- Good programming skills in C++
- Interest in distributed systems, network acceleration, and DPU/SmartNIC-based architectures
Knowledge of DPUs, SmartNICs, or gem5 is helpful but not strictly required.
Contact
shichen.huang@tum.de
Supervisor:
Entwicklung und Integration eines 1G-Ethernet-Streaming-Moduls für FPGA-basierte Performance-Analyse
Description
Im Rahmen dieser Forschungspraxis soll ein Ethernet-basiertes Kommunikationsmodul zur effizienten Übertragung von Laufzeit- und Performance-Daten aus einem FPGA-System entwickelt und integriert werden. Ziel ist es, einen bestehenden Hardware-Prototyp um eine leistungsfähige, nicht-intrusive Streaming-Schnittstelle zu erweitern, die eine kontinuierliche Analyse des Systemverhaltens während der Ausführung ermöglicht.
Kern der Arbeit ist die Integration eines 1G-Ethernet IP-Cores in das FPGA-Board Xilinx VCU118. Aufbauend darauf soll eine stabile Punkt-zu-Punkt-Verbindung zwischen dem FPGA und einem Host-PC realisiert werden. Die Datenübertragung erfolgt paketbasiert über Ethernet und dient der Ausleitung von Metriken, die innerhalb des Systems generiert werden.
Die zu übertragenden Daten bestehen aus einer Menge konfigurierbarer Performance-Metriken mit unterschiedlicher Bitbreite. Diese werden über eine FIFO-Schnittstelle an das Ethernet-Modul übergeben. Als Datenquellen dienen dabei sowohl eine AXI-basierte Traffic-Analyseeinheit als auch Performance Counter der bestehenden Preload-Unit.
Neben der Hardwareentwicklung umfasst die Arbeit auch die Anpassung und Erweiterung einer bestehenden Python-basierten GUI auf dem Host-PC. Diese dient zur Visualisierung und Analyse der empfangenen Daten in Echtzeit. Die Schnittstelle zwischen Hardware und Software soll dabei so gestaltet werden, dass eine einfache Integration neuer Metriken möglich ist.
Prerequisites
- Good Knowledge about MPSoCs
- Good C programming skills
- Very good VHDL programming skills
- High motivation
- Self-responsible workstyle
Contact
Oliver Lenke
o.lenke@tum.de
Supervisor:
Student
Hardware Prefetcher Implementation for HPDcache System
Description
Hardware prefetching is a technique used in modern processors to reduce memory access latency by predicting future data accesses and fetching data into the cache before it is explicitly requested by the processor. By exploiting regular access patterns, such as strided memory accesses, prefetchers can improve cache hit rate and overall system performance.
This research internship focuses on the implementation of hardware prefetchers in modern processor cache systems. The intern will study the design and interfaces of HPDcache, which is already integrated into the CVA6 SoC. Based on this understanding, the intern will design and implement an IP-stride prefetcher and connect it to the HPDcache. The work also includes evaluating the implemented prefetcher using existing benchmarks on the FPGA board.
Through this internship, the student will gain hands-on experience in computer architecture, cache subsystem design, hardware integration, and experimental evaluation of prefetching techniques.
Prerequisites
- Familiar with HDL
- Have basic computer architecture knowledge
Contact
yuanji.ye@tum.de
Supervisor:
Student
FPGA-based Implementation of ARP and ICMP Protocols for High-Speed Ethernet Interfaces
Description
-
Contact
hakan.erkal@work-microwave.com