activity
20132021
most citedSoftWear: Software-Only In-Memory Wear-Leveling for Non-Volatile Main Memory

5 citations · 12 across the 10 of their papers we have counts for

collaborators
Showing cs.OSShow all

6 papers · 1 filter

cs.OS20201 cited

Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems

Jian-Jia Chen, Junjie Shi, Georg von der Brüggen +1

The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints. Whil…

cs.OS20205 cited

SoftWear: Software-Only In-Memory Wear-Leveling for Non-Volatile Main Memory

Christian Hakert, Kuan-Hsun Chen, Paul R. Genssler +5

Several emerging technologies for byte-addressable non-volatile memory (NVM) have been considered to replace DRAM as the main memory in computer systems during the last years. The…

cs.OS20201 cited

On Schedulability Analysis of EDF Scheduling by Considering Suspension as Blocking

Mario Günzel, Jian-Jia Chen

During the execution of a job, it may suspend itself, i.e., its computation ceases to process until certain activities are complete to be resumed. This paper provides a counterexam…

cs.OS2018

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Jian-Jia Chen, Georg von der Brüggen, Junjie Shi +1

Over the years, many multiprocessor locking protocols have been designed and analyzed. However, the performance of these protocols highly depends on how the tasks are partitioned a…

cs.OS2018

Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

Jian-Jia Chen, Georg von der Brüggen, Niklas Ueter

The sporadic task model is often used to analyze recurrent execution of identical tasks in real-time systems. A sporadic task defines an infinite sequence of task instances, also c…

cs.OS2017

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

Niklas Ueter, Georg von der Brüggen, Jian-Jia Chen +2

This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to…