Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zheng-Wei Wu

dblp:256/5550 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 50% Embedded and real-time systems · 25% Storage systems · 25%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
memory management
0.712023
APP: Enabling Soft Real-Time Execution on Densely-Populated Hybrid Memory System · DAC 2023
Memory systems › virtual memory management
memory swapping
0.712023
APP: Enabling Soft Real-Time Execution on Densely-Populated Hybrid Memory System · DAC 2023
Embedded and real-time systems
real-time scheduling
0.712023
APP: Enabling Soft Real-Time Execution on Densely-Populated Hybrid Memory System · DAC 2023
Storage systems › storage performance
ultra-low-latency storage
0.712023
APP: Enabling Soft Real-Time Execution on Densely-Populated Hybrid Memory System · DAC 2023
YearPublicationVenuePosition
2023 APP: Enabling Soft Real-Time Execution on Densely-Populated Hybrid Memory System
abstract
Memory swapping was considered slow and evil, but swapping to Ultra Low-Latency storage like Optane has become a promising solution to save power and cost, helping densely-populated edge server to overcome its DRAM capacity bottleneck. However, the lack of integration between CPU scheduling and memory paging causes soft real-time tasks running on edge servers to miss deadlines under heavy memory multiplexing. We propose APP (Adaptive Page Pinning), lightweight protection of working set memory to ensure meeting soft real-time task deadlines without starving other non-real-time tasks. Experiments show that APP alleviates thrashing in memory-intensive tasks and upholds soft real-time task deadlines.
Zheng-Wei Wu, Yun-Chih Chen, Yuan-Hao Chang 0001, Tei-Wei Kuo
DAC1