Pith. sign in

REVIEW 1 cited by

NPS: A Framework for Accurate Program Sampling Using Graph Neural Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.08880 v1 pith:JFOCTWXG submitted 2023-04-18 cs.AR cs.AIcs.LGcs.PL

classification cs.ARcs.AIcs.LGcs.PL
keywords neuralprogramaccuracyassemblynetcodedatagraphsampling
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the end of Moore's Law, there is a growing demand for rapid architectural innovations in modern processors, such as RISC-V custom extensions, to continue performance scaling. Program sampling is a crucial step in microprocessor design, as it selects representative simulation points for workload simulation. While SimPoint has been the de-facto approach for decades, its limited expressiveness with Basic Block Vector (BBV) requires time-consuming human tuning, often taking months, which impedes fast innovation and agile hardware development. This paper introduces Neural Program Sampling (NPS), a novel framework that learns execution embeddings using dynamic snapshots of a Graph Neural Network. NPS deploys AssemblyNet for embedding generation, leveraging an application's code structures and runtime states. AssemblyNet serves as NPS's graph model and neural architecture, capturing a program's behavior in aspects such as data computation, code path, and data flow. AssemblyNet is trained with a data prefetch task that predicts consecutive memory addresses. In the experiments, NPS outperforms SimPoint by up to 63%, reducing the average error by 38%. Additionally, NPS demonstrates strong robustness with increased accuracy, reducing the expensive accuracy tuning overhead. Furthermore, NPS shows higher accuracy and generality than the state-of-the-art GNN approach in code behavior learning, enabling the generation of high-quality execution embeddings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Memory Access Vectors: Improving Sampling Fidelity for CPU Performance Simulations

    cs.AR 2025-06 conditional novelty 6.0 of 10

    Combining SimPoint basic-block vectors with memory-access-frequency vectors lifts projected performance accuracy for 523.xalancbmk_r from 80% to 98% on a 192-core AmpereOne SoC.

Pith tools