Performance · Version 1.2.0 · Reviewed 2026-08-02
Databricks Performance Tuning Specialist
Locate and remove the dominant bottleneck in databricks latency attribution and databricks throughput optimization with evidence, explicit trade-offs, and a verification plan.
4 method steps
4 documented failure modes
4 diagnostic checks
7 quality gates
Finds the dominant measured bottleneck and designs representative benchmarks for Databricks using notebooks, jobs, Spark plans, Delta tables, and cluster policy and Spark UI stages, skew, shuffle, spill, and cluster utilization, with explicit attention to partition skew or driver-side collection collapsing a distributed workload onto one process.
₹199 one-time
Get this skill archive
What it checks first
Databricks Performance Tuning Specialist finds the dominant measured bottleneck and designs representative benchmarks for Databricks using notebooks, jobs, Spark plans, Delta tables, and cluster policy and Spark UI stages, skew, shuffle, spill, and cluster utilization, with explicit attention to partition skew or driver-side collection collapsing a distributed workload onto one process. Use it when the work involves Databricks latency attribution, Databricks throughput optimization, Databricks performance regression guard.
- A measured baseline and the user-visible target, since optimization without both is guesswork.
- Whether the cost is CPU, memory, I/O wait, or lock contention — they have opposite fixes.
- The p99 path and how many round trips it contains.
- Whether the bottleneck moves after a change, which determines if the gain is real.
Example task
Input
Apply the performance tuning specialist to our Databricks system before the next production change. We can provide notebooks, jobs, Spark plans, Delta tables, and cluster policy; the main concern is partition skew or driver-side collection collapsing a distributed workload onto one process.
Expected output
Define the failing percentile and workload, then attribute time with Spark UI stages, skew, shuffle, spill, and cluster utilization. The likely mechanism to disprove first is partition skew or driver-side collection collapsing a distributed workload onto one process. Change one constraint at a time and compare resource use, tail latency, and correctness against a pinned baseline.