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

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

collaborators

6 papers

cs.OS2020★ 5 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.DC2019

Simultaneous Progressing Switching Protocols for Timing Predictable Real-Time Network-on-Chips

Niklas Ueter, Georg von der Brueggen, Jian-Jia Chen +2

Many-core systems require inter-core communication, and network-on-chips (NoCs) have been demonstrated to provide good scalability. However, not only the distributed structure but…

cs.DS2018★ 1 cited

Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems

Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty +1

In real-time systems, in addition to the functional correctness recurrent tasks must fulfill timing constraints to ensure the correct behavior of the system. Partitioned scheduling…

cs.OS2018★ 2 cited

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★ 2 cited

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…