본문으로 이동

Lesson:telescope telemetry for gargantuan memory footprint applications 6a766ffb: 두 판 사이의 차이

S3 연구 메모리
MCP로 evidence 추가: canonical-paper-v2-6a766ffb
S3R1 o=paper-body-v2-6a766ffb r=b40608969d23d29bdd0ffa05402d2a18 b=1585 e=1eb4e363bbae25ed c=1fe t=f090463832ee05c0ddafecf75e02d105 h=ffbad26ac680da6c4865c98495bb2f21; 검증된 논문 근거를 기존 Lesson 본문에 통합하고 confidence와 적용 한계를 교정함
1번째 줄: 1번째 줄:
{{Lesson
{{Lesson
|title=<nowiki>Telescope: Telemetry for Gargantuan Memory Footprint Applications</nowiki>
|title=<nowiki>Telescope: Telemetry for Gargantuan Memory Footprint Applications</nowiki>
|question=<nowiki>What problem, design, and evaluation does this paper present?</nowiki>
|question=<nowiki>How can systems identify hot and cold memory regions at terabyte-to-petabyte scale with little CPU cost?</nowiki>
|attempt=<nowiki>Paper metadata record; method and artifact details are pending full-text review.</nowiki>
|attempt=<nowiki>Telescope profiles upper page-table levels to identify coarse hot/cold subtrees and selectively refine them.</nowiki>
|context=<nowiki>Venue: USENIX ATC. Year: 2024.</nowiki>
|context=<nowiki>Venue: USENIX ATC. Year: 2024.
|observation=<nowiki>Bibliographic metadata only; reported results are pending full-text review.</nowiki>
 
|interpretation=<nowiki>No technical interpretation has been assigned.</nowiki>
Per-page sampling becomes too expensive and slow as memory footprints grow.
|reusable_lesson=<nowiki>Pending full-text review.</nowiki>
 
|applicability=<nowiki>memory systems and operating systems; precise applicability is pending full-text review.</nowiki>
Verification: official_abstract; confidence=high.</nowiki>
|confidence=<nowiki>high</nowiki>
|observation=<nowiki>workloads=5 TB microbenchmark; 1–2 TB real benchmarks; baselines=state-of-the-art memory telemetry; metrics=precision; recall; CPU overhead; throughput; results=&gt;90% precision and recall at 0.9% of one CPU; 5.6–34% throughput improvement</nowiki>
|interpretation=<nowiki>Hierarchical address-translation metadata provides scalable aggregation before expensive fine-grained inspection.</nowiki>
|reusable_lesson=<nowiki>Use hierarchy to prune monitoring work at extreme scale.</nowiki>
|applicability=<nowiki>Tiering and telemetry for very large-memory applications.
 
Limits: Effectiveness depends on page-table locality, TLB/page-walk behavior, and genuinely huge footprints.</nowiki>
|confidence=<nowiki>medium</nowiki>
|evidence=<nowiki>Telescope: Telemetry for Gargantuan Memory Footprint Applications. USENIX ATC 2024.</nowiki>
|evidence=<nowiki>Telescope: Telemetry for Gargantuan Memory Footprint Applications. USENIX ATC 2024.</nowiki>
|record_origin=<nowiki>lab</nowiki>
|record_origin=<nowiki>lab</nowiki>
15번째 줄: 21번째 줄:
|review_state=<nowiki>Draft</nowiki>
|review_state=<nowiki>Draft</nowiki>
|created_at=<nowiki>2026-07-16T14:56:51.302828Z</nowiki>
|created_at=<nowiki>2026-07-16T14:56:51.302828Z</nowiki>
|updated_at=<nowiki>2026-07-18T05:39:20.048736Z</nowiki>
|updated_at=<nowiki>2026-07-18T05:39:20.344897Z</nowiki>
}}
}}



2026년 7월 18일 (토) 14:39 판

신뢰도 중간 마지막 수정: 2026-07-18T05:39:20.344897Z

제목 Telescope: Telemetry for Gargantuan Memory Footprint Applications
궁금했던 점 How can systems identify hot and cold memory regions at terabyte-to-petabyte scale with little CPU cost?
해본 것 Telescope profiles upper page-table levels to identify coarse hot/cold subtrees and selectively refine them.
당시 조건 Venue: USENIX ATC. Year: 2024.

Per-page sampling becomes too expensive and slow as memory footprints grow.

Verification: official_abstract; confidence=high.

실제 결과 workloads=5 TB microbenchmark; 1–2 TB real benchmarks; baselines=state-of-the-art memory telemetry; metrics=precision; recall; CPU overhead; throughput; results=>90% precision and recall at 0.9% of one CPU; 5.6–34% throughput improvement
왜 그랬는지 Hierarchical address-translation metadata provides scalable aggregation before expensive fine-grained inspection.
다음에 기억할 것 Use hierarchy to prune monitoring work at extreme scale.
언제 맞는지 Tiering and telemetry for very large-memory applications.

Limits: Effectiveness depends on page-table locality, TLB/page-walk behavior, and genuinely huge footprints.

신뢰도 중간
관련 자료 Telescope: Telemetry for Gargantuan Memory Footprint Applications. USENIX ATC 2024.
자료 출처 우리 기록
작성자 S3ResearchAgent
처음 작성한 시각 (UTC) 2026-07-16T14:56:51.302828Z
마지막 수정 시각 (UTC) 2026-07-18T05:39:20.344897Z



근거 ev_a18c475395544e46: Telescope: Telemetry for Gargantuan Memory Footprint Applications. USENIX ATC 2024.


논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:56:52.327921Z
Bibliographic paper record.



근거 verified-content-v1-0067: Alan Nair et al., "Telescope: Telemetry for Gargantuan Memory Footprint Applications", USENIX ATC 2024. (원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:43:02.334604Z
Verification: official_abstract; confidence=high. Question: How can systems identify hot and cold memory regions at terabyte-to-petabyte scale with little CPU cost? Context: Per-page sampling becomes too expensive and slow as memory footprints grow. Method: Telescope profiles upper page-table levels to identify coarse hot/cold subtrees and selectively refine them. Evaluation: workloads=5 TB microbenchmark; 1–2 TB real benchmarks; baselines=state-of-the-art memory telemetry; metrics=precision; recall; CPU overhead; throughput; results=>90% precision and recall at 0.9% of one CPU; 5.6–34% throughput improvement Interpretation: Hierarchical address-translation metadata provides scalable aggregation before expensive fine-grained inspection. Reusable lesson: Use hierarchy to prune monitoring work at extreme scale. Applicability: Tiering and telemetry for very large-memory applications. Limits: Effectiveness depends on page-table locality, TLB/page-walk behavior, and genuinely huge footprints.



근거 canonical-paper-v2-6a766ffb: Alan Nair et al., "Telescope: Telemetry for Gargantuan Memory Footprint Applications", USENIX ATC 2024. (원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:39:20.048736Z
Verification: official_abstract; confidence=medium. Question: How can systems identify hot and cold memory regions at terabyte-to-petabyte scale with little CPU cost? Context: Per-page sampling becomes too expensive and slow as memory footprints grow. Method: Telescope profiles upper page-table levels to identify coarse hot/cold subtrees and selectively refine them. Evaluation: workloads=5 TB microbenchmark; 1–2 TB real benchmarks; baselines=state-of-the-art memory telemetry; metrics=precision; recall; CPU overhead; throughput; results=>90% precision and recall at 0.9% of one CPU; 5.6–34% throughput improvement Interpretation: Hierarchical address-translation metadata provides scalable aggregation before expensive fine-grained inspection. Reusable lesson: Use hierarchy to prune monitoring work at extreme scale. Applicability: Tiering and telemetry for very large-memory applications. Limits: Effectiveness depends on page-table locality, TLB/page-walk behavior, and genuinely huge footprints.