Performance optimization
Performance optimization is the systematic modification of software or its operating conditions to improve measured execution speed, responsiveness, throughput, or resource efficiency while preserving required behavior.
Modern C
- How it is used
- Frames both compiler transformations that preserve observable behavior and careful decisions about changing C code for speed.
- How deep it goes
- Works through legal and type-dependent transformations, then develops repeated timing and inspection; does not promise that a particular rewrite will be faster.
- Examples
- Uses constant arithmetic, separated additions, timed loops, a timing histogram, and compiler-generated assembly.
- What you can do after
- Practice/perform it by checking observable behavior and safety, then repeating timings and inspecting whether the intended work survives compilation.
Starting Data Analytics with Generative AI and Python
Code optimization is the systematic modification of algorithms, code, or data-processing pipelines to improve execution speed, performance, or resource utilization.
- How it is used
- Improves analytics pipelines when growing data or computational demands threaten timely results.
- How deep it goes
- Works through a NumPy bootstrap refactor and timing comparison, while warning that generated changes need validation.
- Examples
- Uses bootstrap confidence intervals, patient monitoring, financial-market monitoring, and a misleading string-search rewrite.
- What you can do after
- Apply it via NumPy vectorization, then measure execution time and check the proposed function’s behavior.
Read how Starting Data Analytics with Generative AI and Python explains performance optimization →
Fast Python: High performance techniques for large datasets
- How it is used
- Improves data-processing pipelines under growing workloads and resource constraints by targeting measured bottlenecks instead of adding machines by default.
- How deep it goes
- Develops a profile-first workflow and identifies data-structure, memory, and distributed-execution costs, without prescribing universal fixes for every environment.
- Examples
- Uses a climate-data ingestion deadline and a visualized Dask sort to make bottleneck investigation concrete.
- What you can do after
- Diagnose/debug with profiling and task-graph visualization, then select optimizations according to measured costs and execution architecture.
Modern C, Third Edition
Optimization is the transformation of a program's implementation to improve execution or compilation while preserving its required observable behavior.
- How it is used
- Explains when a C compiler may change execution while preserving observable states.
- How deep it goes
- Works through eliminated calculations, reordered additions, overflow limits, and a long-jump hazard without detailing generated machine instructions.
- Examples
- Uses a printf calculation, two additions separated by unrelated work, and a parser diagnostic after longjmp.
- What you can do after
- Evaluate/understand whether proposed C transformations preserve observable behavior, including type-dependent overflow and long-jump cases.
Read how Modern C, Third Edition explains performance optimization →
100 Go Mistakes and How to Avoid Them
A compiler optimization is a transformation that improves generated program code while preserving its required behavior.
- How it is used
- Guides decisions about when and how to improve Go code paths without sacrificing clarity unnecessarily.
- How deep it goes
- Works through benchmark elimination, conversion avoidance, and inlining decisions, while directing bottleneck identification rather than prescribing universal rewrites.
- Examples
- Uses a population-count benchmark, a []byte-to-string map lookup, and a Mutex fast-path refactor.
- What you can do after
- Diagnose/debug with Go benchmarks and compiler inlining reports, then choose targeted code changes.
Read how 100 Go Mistakes and How to Avoid Them explains performance optimization →
React in Depth
Performance optimization is the improvement of software execution efficiency, such as by reducing unnecessary computation or rendering.
- How it is used
- Improves React responsiveness by reducing unnecessary state-driven renders and repeated calculations.
- How deep it goes
- Explains memoization mechanics, component behavior, profiling impact, and Provider selectability, but not a complete optimization taxonomy.
- Examples
- Demonstrates memoized and unmemoized to-do lists, repeated addition, and selective Provider data flow.
- What you can do after
- Apply it via React memo() and function memoization, then inspect render costs with browser performance tools.
AI for Everyday IT
Performance optimization is the practice of improving a system's execution speed, resource efficiency, or throughput.
- How it is used
- Improves software and database execution by identifying costly stored procedures and guiding scalable implementation choices.
- How deep it goes
- Measures average elapsed time, CPU time, and logical reads, while noting that highly variable runtimes may require different analysis.
- Examples
- Uses a SQL Server top-ten query and an array-to-Map lookup comparison.
- What you can do after
- Diagnose bottlenecks with SQL Server procedure statistics and evaluate AI-generated code against performance and scalability requirements.
Read how AI for Everyday IT explains performance optimization →
Related concepts
- volatile qualificationcontrasts with · Volatile qualification is a type qualifier that tells the compiler accesses to an object may have observable effects and must not be freely eliminated or optimized as ordinary accesses.
- inliningincludes · Inlining is a compiler or runtime transformation that replaces a function or method call with its implementation at the call site.
- as-if ruleuses · The as-if rule permits an implementation to transform or omit operations provided the program's observable behavior remains equivalent to that required by the language specification.
- hardwareconfigured by · Hardware is the physical equipment of a computing system and the organization and execution characteristics of its processors and other components.
- scalabilitycontrasts with · Scalability is the ability of a system or process to accommodate increasing workload, size, or demand while maintaining acceptable operation.
- zero-cost abstractionused by · A zero-cost abstraction is a high-level programming construct whose compiled implementation adds no runtime overhead compared with an equivalent lower-level implementation.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.