Lesson:fast core scheduling with userspace process abstraction d1ea9f62
| 제목 | Fast Core Scheduling with Userspace Process Abstraction |
|---|---|
| 궁금했던 점 | Can applications reassign cores at sub-microsecond scale without giving userspace unrestricted kernel privilege? |
| 해본 것 | uProcess combines userspace interrupts and Memory Protection Keys to create a restricted privileged mode; Vessel uses it to reschedule cores and colocate latency-critical and best-effort work. |
| 당시 조건 | Venue: SOSP. Year: 2024.
Kernel scheduling transitions are too slow for fine-grained colocation, while raw userspace scheduling weakens isolation. Verification: official_abstract; confidence=medium. |
| 실제 결과 | workloads=latency-critical and best-effort colocated workloads; baselines=kernel-based core scheduling; metrics=rescheduling latency; overall performance; tail latency; results=sub-microsecond rescheduling; no numeric speedup in accessible primary abstract |
| 왜 그랬는지 | A hardware-protected userspace control plane can shorten scheduling paths without fully trusting applications. |
| 다음에 기억할 것 | Move frequent control decisions to a restricted userspace domain backed by hardware isolation. |
| 언제 맞는지 | Low-latency core scheduling and colocated services on UINTR/MPK-capable CPUs.
Limits: Requires userspace interrupts, MPK, shared-process abstractions, and constrained syscall behavior; numeric evaluation not verified. |
| 신뢰도 | 중간 |
| 관련 자료 | Fast Core Scheduling with Userspace Process Abstraction. SOSP 2024. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:57:43.252425Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T05:21:30.154035Z |
근거 ev_26eb9cde5dcd493e: Fast Core Scheduling with Userspace Process Abstraction. SOSP 2024.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:57:44.194646Z
Bibliographic paper record.
근거 verified-content-v1-0088: Jiazhen Lin et al., "Fast Core Scheduling with Userspace Process Abstraction", SOSP 2024.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:48:04.850031Z
Verification: official_abstract; confidence=medium.
Canonical title: Fast Core Scheduling with Userspace Process Abstraction
Question: Can applications reassign cores at sub-microsecond scale without giving userspace unrestricted kernel privilege?
Context: Kernel scheduling transitions are too slow for fine-grained colocation, while raw userspace scheduling weakens isolation.
Method: uProcess combines userspace interrupts and Memory Protection Keys to create a restricted privileged mode; Vessel uses it to reschedule cores and colocate latency-critical and best-effort work.
Evaluation: workloads=latency-critical and best-effort colocated workloads; baselines=kernel-based core scheduling; metrics=rescheduling latency; overall performance; tail latency; results=sub-microsecond rescheduling; no numeric speedup in accessible primary abstract
Interpretation: A hardware-protected userspace control plane can shorten scheduling paths without fully trusting applications.
Reusable lesson: Move frequent control decisions to a restricted userspace domain backed by hardware isolation.
Applicability: Low-latency core scheduling and colocated services on UINTR/MPK-capable CPUs.
Limits: Requires userspace interrupts, MPK, shared-process abstractions, and constrained syscall behavior; numeric evaluation not verified.
근거 canonical-paper-v2-d1ea9f62: Jiazhen Lin et al., "Fast Core Scheduling with Userspace Process Abstraction", SOSP 2024.
(원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:21:29.864293Z
Verification: official_abstract; confidence=medium.
Canonical title: Fast Core Scheduling with Userspace Process Abstraction
Question: Can applications reassign cores at sub-microsecond scale without giving userspace unrestricted kernel privilege?
Context: Kernel scheduling transitions are too slow for fine-grained colocation, while raw userspace scheduling weakens isolation.
Method: uProcess combines userspace interrupts and Memory Protection Keys to create a restricted privileged mode; Vessel uses it to reschedule cores and colocate latency-critical and best-effort work.
Evaluation: workloads=latency-critical and best-effort colocated workloads; baselines=kernel-based core scheduling; metrics=rescheduling latency; overall performance; tail latency; results=sub-microsecond rescheduling; no numeric speedup in accessible primary abstract
Interpretation: A hardware-protected userspace control plane can shorten scheduling paths without fully trusting applications.
Reusable lesson: Move frequent control decisions to a restricted userspace domain backed by hardware isolation.
Applicability: Low-latency core scheduling and colocated services on UINTR/MPK-capable CPUs.
Limits: Requires userspace interrupts, MPK, shared-process abstractions, and constrained syscall behavior; numeric evaluation not verified.