Lesson:shiftlock mitigate one sided rdma lock contention via handover a5d67e63
| 제목 | ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover |
|---|---|
| 궁금했던 점 | Can one-sided RDMA locks avoid retry storms and server-NIC IOPS collapse under contention? |
| 해본 것 | ShiftLock uses nonblocking direct client-to-client handover inspired by MCS queues, with reader-writer semantics, starvation freedom, CPU efficiency, and fault handling. |
| 당시 조건 | Venue: FAST. Year: 2025.
Clients repeatedly fail atomic acquisition of a held lock, inflating tail latency and consuming lock-server inbound IOPS. Verification: official_abstract; confidence=high. |
| 실제 결과 | workloads=RDMA lock microbenchmarks; transaction workloads; baselines=existing one-sided RDMA locks; metrics=goodput; tail latency; transaction goodput; results=up to 3.62x microbenchmark goodput; up to 76.6% lower tail latency; up to 2.85x transaction goodput |
| 왜 그랬는지 | Explicit ownership transfer replaces remote contention with local waiting and bounded coordination. |
| 다음에 기억할 것 | Under high contention, hand work directly to a known successor instead of reopening global competition. |
| 언제 맞는지 | RDMA-based distributed storage and transaction systems.
Limits: Requires client coordination and recovery for failures; gains depend on contention, network, and lock workload. |
| 신뢰도 | 중간 |
| 관련 자료 | ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover. FAST 2025. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:58:03.697149Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T14:59:05.217529Z |
근거 ev_339907610cde434d: ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover. FAST 2025.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:58:04.801094Z
Bibliographic paper record.
근거 verified-content-v1-0098: Jian Gao et al., "ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover", FAST 2025.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:55:12.174539Z
Verification: official_abstract; confidence=high.
Canonical title: ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover
Question: Can one-sided RDMA locks avoid retry storms and server-NIC IOPS collapse under contention?
Context: Clients repeatedly fail atomic acquisition of a held lock, inflating tail latency and consuming lock-server inbound IOPS.
Method: ShiftLock uses nonblocking direct client-to-client handover inspired by MCS queues, with reader-writer semantics, starvation freedom, CPU efficiency, and fault handling.
Evaluation: workloads=RDMA lock microbenchmarks; transaction workloads; baselines=existing one-sided RDMA locks; metrics=goodput; tail latency; transaction goodput; results=up to 3.62x microbenchmark goodput; up to 76.6% lower tail latency; up to 2.85x transaction goodput
Interpretation: Explicit ownership transfer replaces remote contention with local waiting and bounded coordination.
Reusable lesson: Under high contention, hand work directly to a known successor instead of reopening global competition.
Applicability: RDMA-based distributed storage and transaction systems.
Limits: Requires client coordination and recovery for failures; gains depend on contention, network, and lock workload.
근거 canonical-paper-v2-a5d67e63: Jian Gao et al., "ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover", FAST 2025.
(원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:37:26.826884Z
Verification: official_abstract; confidence=medium.
Canonical title: ShiftLock: Mitigate One-sided RDMA Lock Contention via Handover
Question: Can one-sided RDMA locks avoid retry storms and server-NIC IOPS collapse under contention?
Context: Clients repeatedly fail atomic acquisition of a held lock, inflating tail latency and consuming lock-server inbound IOPS.
Method: ShiftLock uses nonblocking direct client-to-client handover inspired by MCS queues, with reader-writer semantics, starvation freedom, CPU efficiency, and fault handling.
Evaluation: workloads=RDMA lock microbenchmarks; transaction workloads; baselines=existing one-sided RDMA locks; metrics=goodput; tail latency; transaction goodput; results=up to 3.62x microbenchmark goodput; up to 76.6% lower tail latency; up to 2.85x transaction goodput
Interpretation: Explicit ownership transfer replaces remote contention with local waiting and bounded coordination.
Reusable lesson: Under high contention, hand work directly to a known successor instead of reopening global competition.
Applicability: RDMA-based distributed storage and transaction systems.
Limits: Requires client coordination and recovery for failures; gains depend on contention, network, and lock workload.
자료 검증 verify_5dfff09e9b1fc1fe9224:
ev_339907610cde434d ·
판단 보류
확인 범위: 일부 자료 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:59:04.715840Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=2d1f69b136a36d6297a7345be75c5656bdc9ca5b43b2363c09108e9942960763 / 위치: 보존 파일 objects/sha256/2d/2d1f69b136a36d6297a7345be75c5656bdc9ca5b43b2363c09108e9942960763
보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.
자료 검증 verify_0da1ddf969fbd87123d0:
verified-content-v1-0098 ·
판단 보류
확인 범위: 일부 자료 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:59:05.217529Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=2d1f69b136a36d6297a7345be75c5656bdc9ca5b43b2363c09108e9942960763 / 위치: 보존 파일 objects/sha256/2d/2d1f69b136a36d6297a7345be75c5656bdc9ca5b43b2363c09108e9942960763
보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.