Lesson:unicom a universally high performant i o completion mechanism for modern computer systems 9172fe3e
| 제목 | UnICom: A Universally High-Performant I/O Completion Mechanism for Modern Computer Systems |
|---|---|
| 궁금했던 점 | What problem, design, and evaluation does this paper present? |
| 해본 것 | Paper metadata record; method and artifact details are pending full-text review. |
| 당시 조건 | Venue: FAST. Year: 2026. |
| 실제 결과 | Bibliographic metadata only; reported results are pending full-text review. |
| 왜 그랬는지 | No technical interpretation has been assigned. |
| 다음에 기억할 것 | Pending full-text review. |
| 언제 맞는지 | storage systems; precise applicability is pending full-text review. |
| 신뢰도 | 높음 |
| 관련 자료 | UnICom: A Universally High-Performant I/O Completion Mechanism for Modern Computer Systems. FAST 2026. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T15:06:02.388184Z |
| 마지막 수정 시각 (UTC) | 2026-07-16T18:58:34.601338Z |
근거 ev_9389fb701aa74111: UnICom: A Universally High-Performant I/O Completion Mechanism for Modern Computer Systems. FAST 2026.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T15:06:03.833796Z
Bibliographic paper record.
근거 verified-content-v1-0150: Riwei Pan; Yu Liang; Sam H. Noh; Lei Li; Nan Guan; Tei-Wei Kuo; Chun Jason Xue. UnICom: A Universally High-Performant I/O Completion Mechanism for Modern Computer Systems. FAST, 2026.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:58:34.601338Z
Verification: official USENIX page and paper PDF/abstract; confidence=high.
Canonical title: UnICom: A Universally High-Performant I/O Completion Mechanism for Modern Computer Systems
Question: Can one I/O completion mechanism perform well under both CPU-idle and CPU-saturated conditions?
Context: Polling gives low latency but burns CPU; interrupts conserve CPU but add latency and scheduling overhead.
Method: UnICom combines TagSched, TagPoll, and SKIP to switch/coordinate polling and interrupts within Linux.
Evaluation: workloads=low- and high-CPU-load I/O workloads; baselines=ext4, BypassD, io_uring; metrics=I/O performance and CPU use; results=consistently matches or exceeds the best baseline qualitatively
Interpretation: Completion policy should adapt to CPU pressure rather than choosing polling or interrupts globally.
Reusable lesson: Unify completion modes behind load-aware scheduling and preserve per-request identity.
Applicability: Modern Linux storage across variable CPU utilization.
Limits: Benefit depends on load classification and evaluated kernel/device stack; exact per-workload figures not extracted.