performance-engineering
/performance-engineering
Model a workload's cost, profile it, and prove claimed speedups. Use when something is too slow or allocation-heavy, when a workload's cost must be modeled, or when a claimed speedup needs proof.
Assessment and security
- Files in this package
- 1
- Scripts
- 0
- HTML comments
- 0
- URLs in SKILL.md
- 3
No signals detected. Repository changed on 09.11.2026, without references to retired models or APIs.
MIT, open: use and modify while retaining author attribution.
What it does and when to use it
Model a workload's cost, profile it, and prove claimed speedups. Use when something is too slow or allocation-heavy, when a workload's cost must be modeled, or when a claimed speedup needs proof.
Original author description
Model a workload's cost, profile it, and prove claimed speedups. Use when something is too slow or allocation-heavy, when a workload's cost must be modeled, or when a claimed speedup needs proof.
How it works
- Heap allocations
SKILL.md preview
--- name: performance-engineering disable-model-invocation: true description: "Model a workload's cost, profile it, and prove claimed speedups. Use when something is too slow or allocation-heavy, when a workload's cost must be modeled, or when a claimed speedup needs proof." --- # Performance Engineering Pin down the workload, input scale, hardware, budget (latency, throughput, memory), and invariants first. Measure before guessing; separate back-of-the-envelope estimates from measurements, and average cost from tail cost. Optimize mechanisms (memory layout, locality, allocations, thread coordination) and count full-system cost when work shifts across paths; bound any claimed gain by [Amdahl's law](https://doi.org/10.1145/1465482.1465560): optimizing a fraction p of the workload caps end-to-end speedup at 1/(1-p). Preserve ownership, lifetimes, and reentrancy when introducing zero-copy views or pools. Benchmark baseline and candidate under identical conditions. Call a change a strict win only when it improves a target metric and regresses none; trade-offs on the [Pareto](https://en.wikipedia.org/wiki/Pareto_efficiency) frontier belong to the user, and behavior changes are reported separately. Use automated benchmark loops over large tuning spaces. When the workload data the model needs is missing or conflicting, name the gap and sync with the user instead of guessing. ## Heap allocations Catalog explicit and hidden allocations across happy, startup, and error paths separately: boxing, closure captures, generator/iterator state machines, variadic arrays, formatting, and library calls (via static allocation analysis, including [escape analysis](https://en.wikipedia.org/wiki/Escape_analysis)). Verify the analysis pass completed cleanly under real compiler flags, chase unanalyzed calls into emitted code or profiler traces on hot paths, and report trigger, lifetime, owner, and runtime frequency separately from static call sites.
Versions
| Repository | Score | Licence |
|---|---|---|
| This page · hebtcd/skills | 85 | MIT |
| hmfareed/Frontier-Engineer | 100 | MIT |
| Twistor-Labs/twistor-engineer | 100 | MIT |
| jacob-balslev/skill-graph | 100 | Apache-2.0 |
| travisjneuman/.claude | 95 | MIT |
Database snapshot: 13.11.2026 · package version f9c822317b0d (SHA-256 digest of the entire package)
Downloads in the last 30 days: 0 · ranking
Report a problem with this skill: harmful content, incorrect descriptions or an author’s removal request.
Similar skills
- 90performance-profiling
Find where the time actually goes before changing anything — define the metric and workload, build a repeatable baseline with its spread, profile on the right axis, confirm the suspected hotspot by removing its work, then re-measure under identical conditions. Use when something… - 100happier-profile-and-optimize
The method for profiling and optimizing anything whose success is a measured cost — frame the phase and metric, choose an instrument that can actually see the cost, label the waste, falsify the hypothesis with a cheap control before building a fix, and prove the result without… - 95performance-optimization
This skill should be used when the user asks to "optimize", "make faster", "speed up", "reduce memory", "improve performance", "reduce latency", "improve throughput", "profile", "benchmark", or mentions "slow code", "too slow", "performance bottleneck", "high memory usage",… - 100performance-analysis
Measure before optimizing. Profile startup time, latency, throughput, memory, or bundle size, find the dominant cost with evidence, and propose the smallest change that moves the number. Use for "slow", "takes N seconds", "high CPU or memory", and performance regressions. - 100performance-profiler
Systematically finds and fixes performance bottlenecks by measuring first, profiling hot paths, reducing algorithmic and I/O cost, and verifying gains with before/after benchmarks. Use this skill when code, an endpoint, a page, a query, or a job is "slow", "laggy", "timing out",… - 100matlab-optimize-performance
Use when MATLAB code is too slow or the user wants it faster, or asks to profile it, find its hot line or where the time goes, count how many times a function runs, or benchmark or compare timings. Profiles before changing code (Sampling Profiler on R2026b+), checks the output…