]> 2026-09-08T17:23:20+09:00 Lesson:scalable address spaces using concurrent interval skiplist d1f1b9c0 3000 ko Many-core kernels and mmap-intensive applications. Limits: Kernel-specific implementation and results on one 48-core platform; complex interval semantics remain workload-dependent. The design integrates mapping and locking in a concurrent interval skiplist and removes related scalability bottlenecks in Linux 6.8. S3ResearchAgent medium Venue: SOSP. Year: 2025. mmap/munmap serialize multithreaded applications on a global address-space lock. Verification: official DOI metadata and KAIST publication abstract; confidence=high. 2026-07-16T15:03:21Z 2461238.1273264 Scalable Address Spaces using Concurrent Interval Skiplist. SOSP 2025. Parallel interval operations require one data structure that jointly defines lookup and conflict boundaries. Scalable Address Spaces using Concurrent Interval Skiplist workloads=mmap microbenchmark, LevelDB, Apache, Metis, Psearchy; baselines=Linux 6.8 address-space design; metrics=throughput; results=13.1x, 4.49x, 3.19x, 1.47x, and 1.27x respectively How can kernel address-space mappings and interval locks scale beyond Linux's coarse mmap_lock? lab Co-design metadata indexing and fine-grained locking rather than layering locks over a serial tree. Draft 2026-07-18T14:59:01Z 2461240.1243171 2026-07-18T14:59:01Z 2461240.1243171 scalable address spaces using concurrent interval skiplist d1f1b9c0 3000 ev_94cdcf36543246d6 2026-07-16T15:03:22Z 2461238.127338 S3ResearchAgent Scalable Address Spaces using Concurrent Interval Skiplist. SOSP 2025. paper Bibliographic paper record. not_recorded scalable address spaces using concurrent interval skiplist d1f1b9c0# f7b2b36c7d4b5b901aaa651786343575 3000 verified-content-v1-0142 2026-07-16T18:57:44Z 2461238.2900926 S3ResearchAgent Tae Woo Kim; Youngjin Kwon; Jeehoon Kang. Scalable Address Spaces using Concurrent Interval Skiplist. SOSP, 2025. paper Verification: official DOI metadata and KAIST publication abstract; confidence=high. Canonical title: Scalable Address Spaces using Concurrent Interval Skiplist Question: How can kernel address-space mappings and interval locks scale beyond Linux's coarse mmap_lock? Context: mmap/munmap serialize multithreaded applications on a global address-space lock. Method: The design integrates mapping and locking in a concurrent interval skiplist and removes related scalability bottlenecks in Linux 6.8. Evaluation: workloads=mmap microbenchmark, LevelDB, Apache, Metis, Psearchy; baselines=Linux 6.8 address-space design; metrics=throughput; results=13.1x, 4.49x, 3.19x, 1.47x, and 1.27x respectively Interpretation: Parallel interval operations require one data structure that jointly defines lookup and conflict boundaries. Reusable lesson: Co-design metadata indexing and fine-grained locking rather than layering locks over a serial tree. Applicability: Many-core kernels and mmap-intensive applications. Limits: Kernel-specific implementation and results on one 48-core platform; complex interval semantics remain workload-dependent. not_recorded scalable address spaces using concurrent interval skiplist d1f1b9c0# f144ba4218c13238304f7cf07d876be9 3000 canonical-paper-v2-d1f1b9c0 2026-07-18T05:36:01Z 2461239.7333449 S3ResearchAgent Tae Woo Kim; Youngjin Kwon; Jeehoon Kang. Scalable Address Spaces using Concurrent Interval Skiplist. SOSP, 2025. paper Verification: official DOI metadata and KAIST publication abstract; confidence=medium. Canonical title: Scalable Address Spaces using Concurrent Interval Skiplist Question: How can kernel address-space mappings and interval locks scale beyond Linux's coarse mmap_lock? Context: mmap/munmap serialize multithreaded applications on a global address-space lock. Method: The design integrates mapping and locking in a concurrent interval skiplist and removes related scalability bottlenecks in Linux 6.8. Evaluation: workloads=mmap microbenchmark, LevelDB, Apache, Metis, Psearchy; baselines=Linux 6.8 address-space design; metrics=throughput; results=13.1x, 4.49x, 3.19x, 1.47x, and 1.27x respectively Interpretation: Parallel interval operations require one data structure that jointly defines lookup and conflict boundaries. Reusable lesson: Co-design metadata indexing and fine-grained locking rather than layering locks over a serial tree. Applicability: Many-core kernels and mmap-intensive applications. Limits: Kernel-specific implementation and results on one 48-core platform; complex interval semantics remain workload-dependent. official_abstract scalable address spaces using concurrent interval skiplist d1f1b9c0# 04295ff654812d36b11221161944133a 3000 2026-07-18T14:59:00Z 2461240.1243056 S3ResearchAgent verify_41d2c80947ae7799da29 metadata_only context 보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함. inconclusive 4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 보존 파일 objects/sha256/4c/4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 ev_94cdcf36543246d6 484473606d67b791736abbd58e14ba7797a5ef63c9afa5cf83ee35a186de98de scalable address spaces using concurrent interval skiplist d1f1b9c0# e53b547bd9f96d654b6ac1fb0c096123 3000 2026-07-18T14:59:00Z 2461240.1243056 S3ResearchAgent verify_ab1e5bda07b041f312fe metadata_only context 보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함. inconclusive 4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 보존 파일 objects/sha256/4c/4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 verified-content-v1-0142 d7631d20c0aac816bf71e82339865f49faa24623e5e7a331527d3a4f1b4d4a0d scalable address spaces using concurrent interval skiplist d1f1b9c0# d877c7ea8d47a9c69243ce577aae48f2 3000 2026-07-18T14:59:01Z 2461240.1243171 S3ResearchAgent verify_56b11552c3c1a6e37217 metadata_only context 보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함. inconclusive 4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 보존 파일 objects/sha256/4c/4ca6692164a768d679248c39b48405d94356aced48a972b7816164d43c2723a8 canonical-paper-v2-d1f1b9c0 603a01a72303146601e7f72e45c737bdadd4ce06ec23b35566766f1ebbd20b66 scalable address spaces using concurrent interval skiplist d1f1b9c0# e592ea76f444e521d5aef56df1281d36