Python Performance Optimization

作者 wshobson46891e7e60da無授權條款收錄於 2026年10月8日更新於 2026年10月8日

Profile and optimize Python code using cProfile, memory profilers, and performance best practices. Use when debugging slow Python code, optimizing bottlenecks, or improving application performance.

AI 產生的概覽

說明如何使用 cProfile、記憶體分析器與效能最佳實務來剖析並最佳化 Python 程式碼。

功能
提供剖析、分析與最佳化 Python 程式碼的指導說明。內容涵蓋 CPU、記憶體、逐行與呼叫圖剖析,執行時間與記憶體用量等效能指標,以及演算法、平行化、快取與原生擴充等最佳化策略。也列出最佳實務與常見陷阱,並在參考文件中提供更多範例模式。
適用情境
適用於 Python 程式碼執行緩慢、需要找出瓶頸時,也適用於降低延遲、記憶體用量或記憶體洩漏,以及最佳化 CPU 密集、I/O 密集或資料處理流程。對正式環境的效能剖析同樣適用。
執行需求
不附帶腳本或工具,僅為說明文件加兩份參考文件。所述流程假定使用 Python 以及 cProfile、timeit、記憶體分析器和 py-spy 等效能分析工具,但技能本身不安裝也不要求這些工具。

Python Performance Optimization

Comprehensive guide to profiling, analyzing, and optimizing Python code for better performance, including CPU profiling, memory optimization, and implementation best practices.

When to Use This Skill

  • Identifying performance bottlenecks in Python applications
  • Reducing application latency and response times
  • Optimizing CPU-intensive operations
  • Reducing memory consumption and memory leaks
  • Improving database query performance
  • Optimizing I/O operations
  • Speeding up data processing pipelines
  • Implementing high-performance algorithms
  • Profiling production applications

Core Concepts

1. Profiling Types

  • CPU Profiling: Identify time-consuming functions
  • Memory Profiling: Track memory allocation and leaks
  • Line Profiling: Profile at line-by-line granularity
  • Call Graph: Visualize function call relationships

2. Performance Metrics

  • Execution Time: How long operations take
  • Memory Usage: Peak and average memory consumption
  • CPU Utilization: Processor usage patterns
  • I/O Wait: Time spent on I/O operations

3. Optimization Strategies

  • Algorithmic: Better algorithms and data structures
  • Implementation: More efficient code patterns
  • Parallelization: Multi-threading/processing
  • Caching: Avoid redundant computation
  • Native Extensions: C/Rust for critical paths

Quick Start

Basic Timing

python
import time
def measure_time():    """Simple timing measurement."""    start = time.time()
    # Your code here    result = sum(range(1000000))
    elapsed = time.time() - start    print(f"Execution time: {elapsed:.4f} seconds")    return result
# Better: use timeit for accurate measurementsimport timeit
execution_time = timeit.timeit(    "sum(range(1000000))",    number=100)print(f"Average time: {execution_time/100:.6f} seconds")

Detailed patterns and worked examples

Detailed pattern documentation lives in references/details.md. Read that file when the navigation tier above is insufficient.

Best Practices

  1. Profile before optimizing - Measure to find real bottlenecks
  2. Focus on hot paths - Optimize code that runs most frequently
  3. Use appropriate data structures - Dict for lookups, set for membership
  4. Avoid premature optimization - Clarity first, then optimize
  5. Use built-in functions - They're implemented in C
  6. Cache expensive computations - Use lru_cache
  7. Batch I/O operations - Reduce system calls
  8. Use generators for large datasets
  9. Consider NumPy for numerical operations
  10. Profile production code - Use py-spy for live systems

Common Pitfalls

  • Optimizing without profiling
  • Using global variables unnecessarily
  • Not using appropriate data structures
  • Creating unnecessary copies of data
  • Not using connection pooling for databases
  • Ignoring algorithmic complexity
  • Over-optimizing rare code paths
  • Not considering memory usage

來源與署名

來源:wshobson/agents位於plugins/python-development/skills/python-performance-optimization提交46891e7

授權條款: 無授權條款

內容歸原作者所有。SourceWeft 從公開儲存庫中收錄這些內容。

檢舉或申請下架