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

Wei Siew Liew

dblp:406/9927 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0007-0218-1115ORCID · corroborated

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

Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021Systems, 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 · 44% Interconnection networks and networks-on-chip · 44% Storage systems · 13%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › high-speed interconnect
PCIe interconnect
1.012026
Efficient Remote Memory Ordering for Non-Coherent Systems · ASPLOS (2) 2026
Storage systems
key-value storage
0.312026
Efficient Remote Memory Ordering for Non-Coherent Systems · ASPLOS (2) 2026

Methods — techniques the papers use, named apart from their topics

hardware-software co-design · 1.0destination-based ordering · 1.0
YearPublicationVenuePosition
2026 Efficient Remote Memory Ordering for Non-Coherent Systems
abstract
Software using non-coherent interconnects like PCI Express requires fine-grained memory ordering, but current hardware mandates the use of costly source-side serialization. We show that this architectural mismatch severely limits the performance of two critical applications: (1) the transmission of network packets from a CPU to a NIC (requiring write-to-write ordering) and (2) key-value store lookups by an RDMA-enabled NIC (requiring read-to-read ordering). We address this by proposing a new destination-based ordering model and the hardware-software co-design comprising PCIe extensions and ISA extensions that allow software to express ordering intent efficiently. Novel microarchitecture at the Root Complex enforces these expressed semantics, eliminating source-side stalls. Our approach significantly improves the throughput of these application kernels and enables new, simpler protocols that outperform the state-of-the-art.
Wei Siew Liew, Md Ashfaqur Rahaman, Adarsh Patil 0002, Ryan Stutsman, Vijay Nagarajan
ASPLOS (2)1
2025 Stop Taking the Scenic Route: the Shortest Distance Between the CPU and the NIC is MMIO
abstract
What is the fastest way to transfer data from the CPU to a network interface card (NIC)? Conventional wisdom suggests that the answer is direct memory access (DMA), and recent works have advocated for leveraging cache-coherent I/O interconnects. However, in this paper we examine the arguments against memory-mapped I/O (MMIO) and show that high write throughput can be achieved with MMIO by relaxing ordering constraints. We also propose efficient hardware for recovering ordering at the NIC to ensure correctness while taking advantage of the performance benefits of unordered MMIO writes.
Wei Siew Liew, Md Ashfaqur Rahaman, James Patrick Mcmahon, Ryan Stutsman, Vijay Nagarajan
HotOS1