Moe Charm (CI)
d5e6ed535c
P-Tier + Tiny Route Policy: Aggressive Superslab Management + Safe Routing
## Phase 1: Utilization-Aware Superslab Tiering (案B実装済)
- Add ss_tier_box.h: Classify SuperSlabs into HOT/DRAINING/FREE based on utilization
- HOT (>25%): Accept new allocations
- DRAINING (≤25%): Drain only, no new allocs
- FREE (0%): Ready for eager munmap
- Enhanced shared_pool_release_slab():
- Check tier transition after each slab release
- If tier→FREE: Force remaining slots to EMPTY and call superslab_free() immediately
- Bypasses LRU cache to prevent registry bloat from accumulating DRAINING SuperSlabs
- Test results (bench_random_mixed_hakmem):
- 1M iterations: ✅ ~1.03M ops/s (previously passed)
- 10M iterations: ✅ ~1.15M ops/s (previously: registry full error)
- 50M iterations: ✅ ~1.08M ops/s (stress test)
## Phase 2: Tiny Front Routing Policy (新規Box)
- Add tiny_route_box.h/c: Single 8-byte table for class→routing decisions
- ROUTE_TINY_ONLY: Tiny front exclusive (no fallback)
- ROUTE_TINY_FIRST: Try Tiny, fallback to Pool if fails
- ROUTE_POOL_ONLY: Skip Tiny entirely
- Profiles via HAKMEM_TINY_PROFILE ENV:
- "hot": C0-C3=TINY_ONLY, C4-C6=TINY_FIRST, C7=POOL_ONLY
- "conservative" (default): All TINY_FIRST
- "off": All POOL_ONLY (disable Tiny)
- "full": All TINY_ONLY (microbench mode)
- A/B test results (ws=256, 100k ops random_mixed):
- Default (conservative): ~2.90M ops/s
- hot: ~2.65M ops/s (more conservative)
- off: ~2.86M ops/s
- full: ~2.98M ops/s (slightly best)
## Design Rationale
### Registry Pressure Fix (案B)
- Problem: DRAINING tier SS occupied registry indefinitely
- Solution: When total_active_blocks→0, immediately free to clear registry slot
- Result: No more "registry full" errors under stress
### Routing Policy Box (新)
- Problem: Tiny front optimization scattered across ENV/branches
- Solution: Centralize routing in single table, select profiles via ENV
- Benefit: Safe A/B testing without touching hot path code
- Future: Integrate with RSS budget/learning layers for dynamic profile switching
## Next Steps (性能最適化)
- Profile Tiny front internals (TLS SLL, FastCache, Superslab backend latency)
- Identify bottleneck between current ~2.9M ops/s and mimalloc ~100M ops/s
- Consider:
- Reduce shared pool lock contention
- Optimize unified cache hit rate
- Streamline Superslab carving logic
🤖 Generated with [Claude Code](https://claude.com/claude-code)
Co-Authored-By: Claude <noreply@anthropic.com>
2025-12-04 18:01:25 +09:00
..
2025-11-09 18:55:50 +09:00
2025-11-09 18:55:50 +09:00
2025-11-07 01:27:04 +09:00
2025-12-03 12:11:27 +09:00
2025-11-30 05:12:32 +09:00
2025-11-20 07:32:30 +09:00
2025-12-03 10:34:39 +09:00
2025-11-13 01:45:30 +09:00
2025-11-29 07:57:49 +09:00
2025-12-04 16:21:54 +09:00
2025-11-13 01:45:30 +09:00
2025-12-04 16:21:54 +09:00
2025-12-01 16:05:55 +09:00
2025-12-01 13:47:23 +09:00
2025-11-30 15:27:53 +09:00
2025-12-01 16:37:59 +09:00
2025-11-07 01:27:04 +09:00
2025-12-03 10:34:39 +09:00
2025-11-07 01:27:04 +09:00
2025-11-21 23:00:24 +09:00
2025-11-26 12:33:49 +09:00
2025-12-01 16:37:59 +09:00
2025-12-04 04:58:22 +09:00
2025-12-04 16:21:54 +09:00
2025-12-04 04:58:22 +09:00
2025-12-03 12:11:27 +09:00
2025-12-04 14:22:48 +09:00
2025-11-17 02:47:58 +09:00
2025-11-15 22:08:51 +09:00
2025-12-04 16:21:54 +09:00
2025-12-04 16:21:54 +09:00
2025-11-26 17:12:41 +09:00
2025-12-04 14:22:48 +09:00
2025-12-03 20:42:28 +09:00
2025-11-07 01:27:04 +09:00
2025-12-04 16:21:54 +09:00
2025-11-07 01:27:04 +09:00
2025-12-04 14:22:48 +09:00
2025-12-04 12:06:14 +09:00
2025-11-20 07:32:30 +09:00
2025-12-03 10:34:39 +09:00
2025-11-12 02:45:00 +09:00
2025-12-04 16:21:54 +09:00
2025-11-28 16:08:44 +09:00
2025-12-03 10:34:39 +09:00
2025-11-07 01:27:04 +09:00
2025-11-29 14:39:07 +09:00
2025-12-04 16:21:54 +09:00
2025-12-04 16:21:54 +09:00
2025-11-17 02:47:58 +09:00
2025-12-01 22:06:10 +09:00
2025-12-01 22:06:10 +09:00
2025-11-06 21:54:12 +09:00
2025-11-06 21:54:12 +09:00
2025-11-06 21:54:12 +09:00
2025-11-07 01:27:04 +09:00
2025-11-07 01:27:04 +09:00
2025-11-07 01:27:04 +09:00
2025-11-07 01:27:04 +09:00
2025-11-07 01:27:04 +09:00
2025-11-06 21:54:12 +09:00
2025-11-20 07:32:30 +09:00
2025-12-03 10:34:39 +09:00
2025-11-13 01:45:30 +09:00
2025-12-03 17:18:31 +09:00
2025-12-04 16:21:54 +09:00
2025-12-01 16:37:59 +09:00
2025-11-22 03:30:47 +09:00
2025-11-30 07:16:50 +09:00
2025-12-04 06:22:09 +09:00
2025-11-30 10:48:50 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-11-30 07:16:50 +09:00
2025-11-30 07:16:50 +09:00
2025-12-04 18:01:25 +09:00
2025-12-04 14:22:48 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-12-02 19:43:23 +09:00
2025-11-28 14:11:37 +09:00
2025-11-17 05:29:08 +09:00
2025-12-03 10:34:39 +09:00
2025-11-16 05:48:59 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-12-04 06:22:09 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-11-22 02:46:57 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-12-04 18:01:25 +09:00
2025-12-03 20:42:28 +09:00
2025-12-03 20:42:28 +09:00
2025-11-28 13:42:39 +09:00
2025-11-26 12:33:49 +09:00
2025-11-12 02:45:00 +09:00
2025-11-29 08:44:29 +09:00
2025-11-30 11:06:44 +09:00
2025-12-04 18:01:25 +09:00
2025-12-02 16:16:51 +09:00
2025-12-02 16:16:51 +09:00
2025-12-04 12:36:32 +09:00
2025-12-04 12:20:21 +09:00
2025-12-03 12:43:02 +09:00
2025-12-03 17:18:31 +09:00
2025-11-30 10:48:50 +09:00
2025-11-30 10:48:50 +09:00
2025-12-03 11:38:11 +09:00
2025-12-03 12:11:27 +09:00
2025-12-04 16:21:54 +09:00
2025-11-20 07:32:30 +09:00
2025-11-28 13:42:39 +09:00
2025-12-04 05:54:54 +09:00
2025-12-04 18:01:25 +09:00
2025-12-04 18:01:25 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-11-20 07:32:30 +09:00
2025-11-28 13:42:39 +09:00
2025-12-04 16:21:54 +09:00
2025-12-02 23:29:07 +09:00
2025-12-03 18:06:24 +09:00
2025-12-04 16:21:54 +09:00
2025-12-04 12:55:53 +09:00
2025-12-02 19:13:28 +09:00
2025-12-02 19:13:28 +09:00