liveBook · Manning

Execution model

As explained in Fast Python: High performance techniques for large datasets

An execution model is an abstract set of rules governing how a computational system runs, schedules, coordinates, orders, and triggers computations.

An execution model defines how a computation runs without changing what the computation means. With Dask, a pandas-like analysis can be understood independently of whether execution is serial, parallel, or distributed. section 10.1

This separation makes execution strategy a system-level choice. Dask provides interfaces resembling NumPy and pandas, supports larger-than-memory arrays and data frames, and offers scheduling alternatives for scaling up on one machine or scaling out across several machines. section 10.0 section 10.1

Comparing pandas-like execution

Analyze US Census tax data to calculate each state's property-tax share. The table is deliberately small: the experiment focuses on understanding Dask's execution model rather than solving a data-volume problem. section 10.1

How Fast Python: High performance techniques for large datasets covers it

How deep it goes
Explains execution independently from computation and previews scheduling alternatives, but defers detailed distributed implementation.
Examples
Uses a pandas-like property-tax analysis over US Census data from the 50 states.
What it assumes
Assumes familiarity with pandas-like analysis and introduces Dask's execution model before deeper parallelism.
What you can do after
Apply Dask interfaces while choosing among serial, parallel, and distributed execution approaches.
How it connects
Connects execution models with Dask, parallel computing, scheduling, pandas, NumPy, and distributed architectures.

Also explained in

Compare how 2 books explain execution model →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Fast Python: High performance techniques for large datasets. The section links point to the parts of the book it draws on.