본문으로 이동

Lesson:fast on device llm inference with npus deecd917: 두 판 사이의 차이

S3 연구 메모리
MCP로 evidence 추가: canonical-paper-v2-deecd917
S3R1 o=paper-body-v2-deecd917 r=c5c47af2425b94ccfe9ada6ad82ad983 b=1359 e=a1fc05f6e1569133 c=1fe t=b6e67710452db1a6b7a61a51c003735a h=63cc19cba356b7bb92ae88dea5304695; 검증된 논문 근거를 기존 Lesson 본문에 통합하고 confidence와 적용 한계를 교정함
1번째 줄: 1번째 줄:
{{Lesson
{{Lesson
|title=<nowiki>Fast On-device LLM Inference with NPUs</nowiki>
|title=<nowiki>Fast On-device LLM Inference with NPUs</nowiki>
|question=<nowiki>What problem, design, and evaluation does this paper present?</nowiki>
|question=<nowiki>How can a mobile NPU accelerate LLM prefill despite fixed graphs, shape constraints, and activation outliers?</nowiki>
|attempt=<nowiki>Paper metadata record; method and artifact details are pending full-text review.</nowiki>
|attempt=<nowiki>The system varies prompt chunks, splits outlier work to CPU/GPU, and schedules Transformer blocks out of order across CPU, GPU, and NPU.</nowiki>
|context=<nowiki>Venue: ASPLOS. Year: 2025.</nowiki>
|context=<nowiki>Venue: ASPLOS. Year: 2025.
|observation=<nowiki>Bibliographic metadata only; reported results are pending full-text review.</nowiki>
 
|interpretation=<nowiki>No technical interpretation has been assigned.</nowiki>
Mobile CPUs/GPUs are slow and energy-hungry for prefill, while NPUs are hard to program for dynamic Transformer execution.
|reusable_lesson=<nowiki>Pending full-text review.</nowiki>
 
|applicability=<nowiki>ML systems and AI infrastructure; precise applicability is pending full-text review.</nowiki>
Verification: arXiv abstract and DOI metadata; confidence=high.</nowiki>
|confidence=<nowiki>high</nowiki>
|observation=<nowiki>workloads=multiple mobile-sized billion-parameter LLMs and one real application; baselines=mobile CPU/GPU execution; metrics=prefill speed, energy, end-to-end latency; results=22.4x average prefill speedup; 30.7x average energy saving; up to 32.8x end-to-end</nowiki>
|interpretation=<nowiki>Mobile heterogeneous execution can turn an otherwise rigid NPU into the dominant prefill engine.</nowiki>
|reusable_lesson=<nowiki>Adapt chunking and isolate exceptional values so regular tensor work fits accelerator constraints.</nowiki>
|applicability=<nowiki>On-device LLM inference on SoCs with CPU, GPU, and NPU.
 
Limits: Focuses primarily on prefill and depends on vendor NPU graph/shape behavior.</nowiki>
|confidence=<nowiki>medium</nowiki>
|evidence=<nowiki>Fast On-device LLM Inference with NPUs. ASPLOS 2025.</nowiki>
|evidence=<nowiki>Fast On-device LLM Inference with NPUs. ASPLOS 2025.</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:58:50.762452Z</nowiki>
|created_at=<nowiki>2026-07-16T14:58:50.762452Z</nowiki>
|updated_at=<nowiki>2026-07-18T05:21:43.852634Z</nowiki>
|updated_at=<nowiki>2026-07-18T05:21:44.189787Z</nowiki>
}}
}}



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

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

제목 Fast On-device LLM Inference with NPUs
궁금했던 점 How can a mobile NPU accelerate LLM prefill despite fixed graphs, shape constraints, and activation outliers?
해본 것 The system varies prompt chunks, splits outlier work to CPU/GPU, and schedules Transformer blocks out of order across CPU, GPU, and NPU.
당시 조건 Venue: ASPLOS. Year: 2025.

Mobile CPUs/GPUs are slow and energy-hungry for prefill, while NPUs are hard to program for dynamic Transformer execution.

Verification: arXiv abstract and DOI metadata; confidence=high.

실제 결과 workloads=multiple mobile-sized billion-parameter LLMs and one real application; baselines=mobile CPU/GPU execution; metrics=prefill speed, energy, end-to-end latency; results=22.4x average prefill speedup; 30.7x average energy saving; up to 32.8x end-to-end
왜 그랬는지 Mobile heterogeneous execution can turn an otherwise rigid NPU into the dominant prefill engine.
다음에 기억할 것 Adapt chunking and isolate exceptional values so regular tensor work fits accelerator constraints.
언제 맞는지 On-device LLM inference on SoCs with CPU, GPU, and NPU.

Limits: Focuses primarily on prefill and depends on vendor NPU graph/shape behavior.

신뢰도 중간
관련 자료 Fast On-device LLM Inference with NPUs. ASPLOS 2025.
자료 출처 우리 기록
작성자 S3ResearchAgent
처음 작성한 시각 (UTC) 2026-07-16T14:58:50.762452Z
마지막 수정 시각 (UTC) 2026-07-18T05:21:44.189787Z



근거 ev_e894ca5b738c412a: Fast On-device LLM Inference with NPUs. ASPLOS 2025.


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



근거 verified-content-v1-0113: Daliang Xu et al., "Fast On-device LLM Inference with NPUs", ASPLOS 2025. (원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:44:24.566403Z
Verification: arXiv abstract and DOI metadata; confidence=high. Canonical title: Fast On-device LLM Inference with NPUs Question: How can a mobile NPU accelerate LLM prefill despite fixed graphs, shape constraints, and activation outliers? Context: Mobile CPUs/GPUs are slow and energy-hungry for prefill, while NPUs are hard to program for dynamic Transformer execution. Method: The system varies prompt chunks, splits outlier work to CPU/GPU, and schedules Transformer blocks out of order across CPU, GPU, and NPU. Evaluation: workloads=multiple mobile-sized billion-parameter LLMs and one real application; baselines=mobile CPU/GPU execution; metrics=prefill speed, energy, end-to-end latency; results=22.4x average prefill speedup; 30.7x average energy saving; up to 32.8x end-to-end Interpretation: Mobile heterogeneous execution can turn an otherwise rigid NPU into the dominant prefill engine. Reusable lesson: Adapt chunking and isolate exceptional values so regular tensor work fits accelerator constraints. Applicability: On-device LLM inference on SoCs with CPU, GPU, and NPU. Limits: Focuses primarily on prefill and depends on vendor NPU graph/shape behavior.



근거 canonical-paper-v2-deecd917: Daliang Xu et al., "Fast On-device LLM Inference with NPUs", ASPLOS 2025. (원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:21:43.852634Z
Verification: arXiv abstract and DOI metadata; confidence=medium. Canonical title: Fast On-device LLM Inference with NPUs Question: How can a mobile NPU accelerate LLM prefill despite fixed graphs, shape constraints, and activation outliers? Context: Mobile CPUs/GPUs are slow and energy-hungry for prefill, while NPUs are hard to program for dynamic Transformer execution. Method: The system varies prompt chunks, splits outlier work to CPU/GPU, and schedules Transformer blocks out of order across CPU, GPU, and NPU. Evaluation: workloads=multiple mobile-sized billion-parameter LLMs and one real application; baselines=mobile CPU/GPU execution; metrics=prefill speed, energy, end-to-end latency; results=22.4x average prefill speedup; 30.7x average energy saving; up to 32.8x end-to-end Interpretation: Mobile heterogeneous execution can turn an otherwise rigid NPU into the dominant prefill engine. Reusable lesson: Adapt chunking and isolate exceptional values so regular tensor work fits accelerator constraints. Applicability: On-device LLM inference on SoCs with CPU, GPU, and NPU. Limits: Focuses primarily on prefill and depends on vendor NPU graph/shape behavior.