Seo Jin Park
where else to find them
no profile links on file
what they talk about
all 8 in the filters
where they keep going back
- NSDI2 editions2019–2023
all 5 in the filters
on a stage with
all 15 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Quicksand: Harnessing Stranded Datacenter Resources with Granular Computing | NSDI '25 | 2025-04-28 |
Quicksand decomposes applications into small resource proclets—separate compute and memory units—and automatically splits, merges, and migrates them to fill… | ||
| LDB: An Efficient Latency Profiling Tool for Multithreaded Applications | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
LDB is a software-only profiler that samples call stacks using a background thread and records request and synchronization tags to attribute tail latency to… | ||
| Protego: Overload Control for Applications with Unpredictable Lock Contention | NSDI 2023 | 2023-04-17 |
Protego implements an Active Synchronization Queue Management (ASQM) that aborts requests whose remaining lock-wait budget cannot meet SLOs, plus a… | ||
| Nu: Achieving Microsecond-Scale Resource Fungibility with Logical Processes | NSDI 2023 | 2023-04-17 |
A system called Nu implements logical processes that split a Unix process into many small stateful proclets and a centralized controller, and it migrates those… | ||
| DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks | 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI '22) | 2022-04-04 |
Uses erasure coding and a new verifiable information dispersal to separate data availability from block delivery so nodes agree on block hashes without… | ||
| MilliSort and MilliQuery: Large-Scale Data-Intensive Computing in Milliseconds | NSDI ’21 | 2021-04-12 |
Benchmarking shows flash-burst analytics are feasible: MilliSort sorts 0.84M records in 1 ms using 120 servers by using recursive hierarchical partitioning to… | ||
| EPaxos Revisited | NSDI ’21 | 2021-04-12 |
Re-evaluation reproduces EPaxos’s low median commit latency but shows 99th-percentile latency often worse than Multi‑Paxos — sometimes more than 4× worse — and… | ||
| Exploiting Commutativity For Practical Fast Replication | NSDI 2019 | 2019-02-26 |
Proposes consistent unordered replication (CURP): clients replicate requests to small temporary witnesses without waiting for global ordering, allowing 1 RTT… | ||
| nothing matches | ||