Pepitedata
  • Home
  • Services
  • Audits
  • Expert Call
  • About
  • Blog
  • Contact

benchmarking

Two bars: high throughput at 7 vCPU per item and collapsed throughput at 241 vCPU
data

Performance and Cost Engineering for Data Platforms

A field guide to performance and cost engineering: claim-checking with the scaling and queueing laws, measurement discipline, where GPU and CPU budgets leak, and how to turn a benchmark into a hardware decision.

By Julien Laurenceau, 6 days2026-09-30 ago
An open duct in a stone chamber holding a single file of evenly spaced glowing cubes, one entering and one leaving
data

Benchmark Best Practices, Part 2: Little’s Law Ties Throughput, Latency and Concurrency Together

Second in my benchmark best practices series. Little’s law checks that throughput, latency and concurrency describe the same system, exposes the load generator’s ceiling, and turns a latency budget into a sizing requirement.

By Julien Laurenceau, 2 weeks2026-09-22 ago
DeepSWE leaderboard: DeepSWE score against average cost per task for 113 tasks, with the cost-performance frontier highlighted and GPT-6-Astra XHIGH at .52 per task
AI

Efficiency Is Not Raw Power: Meet GPT-6-Astra and the DeepSWE Reality

GPT-6-Astra XHIGH sits alone on the DeepSWE cost-performance frontier, and an older model beats a flagship tier. Follow-up: DeepSeek V4.1 Flash hits 98% of Astra’s score at 1.4% of the cost.

By Julien Laurenceau, 1 month2026-09-06 ago
A balance scale holding a small solid block on one pan and an oversized hollow sphere on the other
data

Benchmark Best Practices, Part 1: Amdahl’s Law Caps Your Scaling Claim

Part 1 of my benchmark best practices series: how I turn a scaling claim into an implied serial fraction with Amdahl’s law, and what the Universal Scalability Law adds. Includes a measured pipeline where assigning more vCPUs per image cut global throughput.

By Julien Laurenceau, 1 month2026-08-25 ago
  • Privacy Policy
  • Mentions légales
  • CGV
  • Cookies
Hestia | Developed by ThemeIsle