Running Projects

AHA: Automated Hardware Abstraction in Operating-System Engineering (DFG: LO 1719/4-1)

Goal of AHA is to improve nonfunctional properties of system software by a very deep, but fully automated specialization of the application-hardware bridge represented by the operating system. We investigate, how alternative implementations that are mapped more directly to hardware features, can be generated from a concrete application and their actual interactions with the operating system.

ATLAS: Adaptable Thread-Level Address Spaces (DFG: LO 1719/7-1 and DI 2840/1-1)

In the ATLAS project, we investigate dynamic specialization and containment by means of thread-level address-space variations.

CADOS: Configurability-Aware Development of Operating Systems (DFG: LO 1719/3-2)

In the CADOS project, we investigate scalable methods and tools to deal with the implementation of variability across all implementation layers of modern system software.

CLASSY-FI: Cross-Layer Application-Specific Synthesis and Analysis of Fault Injection

Goal of the CLASSY-FI is to derive constructive methods and techniques for scalable, yet precise and complete fault injection (FI) to experimentally assess the robustness of safety-critical embedded control systems against soft errors.

ParPerOS: Parallel Persistency OS (DFG: LO 1719/8-1 and DI 2840/2-1)

In ParPerOS, we examine new abstractions for unified but efficient and optionally crash-consistent low-level memory management for data objects in heterogeneous memory systems that consist of volatile, persistent, distributed and other types of main memory.

SPP 2377: DFG Priority Program "Disruptive Memory Technologies"

The aim of this DFG priority program is to explore the potentials of ongoing developments in the field of main memory technologies and architectures. Despite the disruptive nature of these technologies, systems software and applications shall be enabled to fully exploit them. SRA takes part with the ParPerOS project.

cHash: Avoid redundant build operations by AST-based hashing

Building software can include many redundant compiler invocations. With the AST hashing mechanism developed in this project, compiler invocations can be aborted before wasting the developers time.