Generated banner for Dask
Generated logo for Dask

Dask

K-DenseCommunityCreated by K-Dense Inc.

  • Skill
  • Tool integration
  • Data and AI
  • MIT
  • Low risk

From the author

Scales pandas, NumPy, and custom Python research workflows beyond memory or across clusters with Dask. Covers DataFrames, Arrays, Bags, Futures, chunking, schedulers, and distributed diagnostics. Use for partitioned file processing, scientific array computation, or parallel tasks whose memory and dependency structure require Dask.
— the description by K-Dense Inc.

AutoGineer summary

Written by AutoGineer from the skill’s own files, not by the author

Dask is a Python library designed for parallel and distributed computing. It enables the processing of datasets that exceed available RAM, parallelizes computations across multiple cores, and supports distributed workloads across multiple machines. Dask provides five primary components—DataFrames, Arrays, Bags, Futures, and Schedulers—to handle structured, unstructured, and custom computational tasks. It integrates with existing Python ecosystems like pandas and NumPy, allowing users to scale their research workflows by building task graphs that execute lazily or via task-based parallelization.

What it does

  • Scales pandas operations to larger-than-memory tabular datasets
  • Extends NumPy capabilities to large-scale array computations
  • Processes unstructured data like text and JSON using functional programming
  • Provides fine-grained control over parallel task execution and dependencies
  • Offers multiple execution backends including threads, processes, and distributed clusters

When to use it

  • When datasets exceed available memory
  • When parallelizing NumPy or pandas operations
  • When processing multiple files such as CSVs, Parquet, or logs
  • When building custom parallel workflows with specific task dependencies

Advantages

  • Enables computation on datasets larger than RAM
  • Provides consistent APIs for parallelizing familiar Python libraries
  • Supports flexible execution across single machines or distributed clusters
  • Allows for lazy evaluation to optimize task graph execution

Usage examples

“How do I process multiple CSV files that are too large for memory?”
The agent will demonstrate using dask.dataframe.read_csv with glob patterns to create a lazy DataFrame, followed by standard pandas-like operations and a final .compute() call.
“How can I parallelize a custom Python function across many inputs?”
The agent will show how to use the dask.distributed Client to submit tasks using client.map or client.submit, allowing for parallel execution and result gathering.

Install

  1. Download the skill as a ZIP:

    https://mp-staging.autogineer.com/agent-skills/k-dense-ai/dask/download
  2. Unzip it into the cross-client skills folder of your project:

    mkdir -p .agents/skills && unzip dask.zip -d .agents/skills

Documentation by K-Dense Inc.

Dask

Overview

Dask is a Python library for parallel and distributed computing that enables three critical capabilities:

  • Larger-than-memory execution on single machines for data exceeding available RAM

  • Parallel processing for improved computational speed across multiple cores

  • Distributed computation supporting terabyte-scale datasets across multiple machines

Capacity depends on partition sizes, intermediate data, concurrency, storage, and available memory.

Reviewed release: dask/distributed 2026.8.0 (September 30, 2026 review). Docs: docs.dask.org. Since 2025.1.0, the expression-based DataFrame API with query planning is the only implementation — do not install dask-expr separately or set dataframe.query-planning: False.

Quick Start

Installation
uv pip install "dask[array,dataframe]==2026.8.0"

For a typical pandas/NumPy workflow with the distributed scheduler and dashboard:

uv pip install "dask[complete]==2026.8.0"

Remote object storage (requires provider credentials for private data):

uv pip install s3fs    # s3:// paths
uv pip install gcsfs   # gs:// paths

Requires Python 3.10+, pandas 2+, PyArrow 16+. Zarr, HDF5, SciPy, Xarray, Dask-ML, and cluster deployment packages are separate optional dependencies. See review and validation for tested versions, source links, and limits. File paths and undefined application functions below are illustrative. Put process scheduler/Client() execution in a main() guarded by if __name__ == "__main__": in scripts; close clients and clusters afterward.

When to Use This Skill

This skill should be used when:

  • Process datasets that exceed available RAM

  • Scale pandas or NumPy operations to larger datasets

  • Parallelize computations for performance improvements

  • Process multiple files efficiently (CSVs, Parquet, JSON, text logs)

  • Build custom parallel workflows with task dependencies

  • Distribute workloads across multiple cores or machines

Core Capabilities

Dask provides five main components, each suited to different use cases:

1. DataFrames - Parallel Pandas Operations

Purpose: Scale pandas operations to larger datasets through parallel processing.

When to Use:

  • Tabular data exceeds available RAM

  • Need to process multiple CSV/Parquet files together

  • Pandas operations are slow and need parallelization

  • Scaling from pandas prototype to production

Reference Documentation: For comprehensive guidance on Dask DataFrames, refer to references/dataframes.md which includes:

  • Reading data (single files, multiple files, glob patterns)

  • Common operations (filtering, groupby, joins, aggregations)

  • Custom operations with map_partitions

  • Performance optimization tips

  • Common patterns (ETL, time series, multi-file processing)

Quick Example:

import dask.dataframe as dd

# Read multiple files as single DataFrame
ddf = dd.read_csv('data/2024-*.csv')

# Operations are lazy until compute()
filtered = ddf[ddf['value'] > 100]
result = filtered.groupby('category')['value'].mean().compute()

Key Points:

  • Operations are lazy (build task graph) until .compute() called

  • Use map_partitions for efficient custom operations

  • Convert to DataFrame early when working with structured data from other sources

2. Arrays - Parallel NumPy Operations

Purpose: Extend NumPy capabilities to datasets larger than memory using blocked algorithms.

When to Use:

  • Arrays exceed available RAM

  • NumPy operations need parallelization

  • Working with scientific datasets (HDF5, Zarr, NetCDF)

  • Need parallel linear algebra or array operations

Reference Documentation: For comprehensive guidance on Dask Arrays, refer to references/arrays.md which includes:

  • Creating arrays (from NumPy, random, from disk)

  • Chunking strategies and optimization

  • Common operations (arithmetic, reductions, linear algebra)

  • Custom operations with map_blocks

  • Integration with HDF5, Zarr, and XArray

Quick Example:

import dask.array as da

# Small executable example; size chunks from uncompressed memory before scaling
x = da.random.default_rng(42).random((1000, 1000), chunks=(250, 250))

# Operations are lazy
y = x + 100
z = y.mean(axis=0)

# Compute result
result = z.compute()

Key Points:

  • Chunk size is critical (aim for ~100 MiB per chunk, adjusted to memory and operation)

  • Operations work on chunks in parallel

  • Rechunk data when needed for efficient operations

  • Use map_blocks for operations not available in Dask

3. Bags - Parallel Processing of Unstructured Data

Purpose: Process unstructured or semi-structured data (text, JSON, logs) with functional operations.

When to Use:

  • Processing text files, logs, or JSON records

  • Data cleaning and ETL before structured analysis

  • Working with Python objects that don't fit array/dataframe formats

  • Need memory-efficient streaming processing

Reference Documentation: For comprehensive guidance on Dask Bags, refer to references/bags.md which includes:

  • Reading text and JSON files

  • Functional operations (map, filter, fold, groupby)

  • Converting to DataFrames

  • Common patterns (log analysis, JSON processing, text processing)

  • Performance considerations

Quick Example:

import dask.bag as db
import json

# Read and parse JSON files
bag = db.read_text('logs/*.json').map(json.loads)

# Filter and transform
valid = bag.filter(lambda x: x['status'] == 'valid')
processed = valid.map(lambda x: {'id': x['id'], 'value': x['value']})

# Convert to DataFrame for analysis
ddf = processed.to_dataframe(meta={'id': 'int64', 'value': 'float64'})

Key Points:

  • Use for initial data cleaning, then convert to DataFrame/Array

  • Use foldby instead of groupby for better performance

  • Operations are streaming and memory-efficient

  • Convert to structured formats (DataFrame) for complex operations

4. Futures - Task-Based Parallelization

Purpose: Build custom parallel workflows with fine-grained control over task execution and dependencies.

When to Use:

  • Building dynamic, evolving workflows

  • Need immediate task execution (not lazy)

  • Computations depend on runtime conditions

  • Implementing custom parallel algorithms

  • Need stateful computations

Reference Documentation: For comprehensive guidance on Dask Futures, refer to references/futures.md which includes:

  • Setting up distributed client

  • Submitting tasks and working with futures

  • Task dependencies and data movement

  • Advanced coordination (queues, locks, events, actors)

  • Common patterns (parameter sweeps, dynamic tasks, iterative algorithms)

Quick Example:

from dask.distributed import Client

client = Client()  # Create local cluster

# Submit tasks (scheduled without compute())
def process(x):
    return x ** 2

futures = client.map(process, range(100))

# Gather results
results = client.gather(futures)

client.close()

Key Points:

  • Requires distributed client (even for single machine)

  • Submitted tasks run when dependencies and worker resources are ready

  • Pre-scatter large data to avoid repeated transfers

  • ~1ms overhead per task (not suitable for millions of tiny tasks)

  • Use actors for stateful workflows

5. Schedulers - Execution Backends

Purpose: Control how and where Dask tasks execute (threads, processes, distributed).

When to Choose Scheduler:

  • Threads (default): NumPy/Pandas operations, GIL-releasing libraries, shared memory benefit

  • Processes: Pure Python code, text processing, GIL-bound operations

  • Synchronous: Debugging with pdb, profiling, understanding errors

  • Distributed: Need dashboard, multi-machine clusters, advanced features

Reference Documentation: For comprehensive guidance on Dask Schedulers, refer to references/schedulers.md which includes:

  • Detailed scheduler descriptions and characteristics

  • Configuration methods (global, context manager, per-compute)

  • Performance considerations and overhead

  • Common patterns and troubleshooting

  • Thread configuration for optimal performance

Quick Example:

import dask
import dask.dataframe as dd

# Use threads for DataFrame (default, good for numeric)
ddf = dd.read_csv('data.csv')
result1 = ddf['value'].mean().compute()  # Threads unless a client/config overrides it

# Use processes for Python-heavy work
import dask.bag as db
bag = db.read_text('logs/*.txt')
result2 = bag.map(python_function).compute(scheduler='processes')

# Use synchronous for debugging
dask.config.set(scheduler='synchronous')
result3 = problematic_computation.compute()  # Can use pdb

# Use distributed for monitoring and scaling
from dask.distributed import Client
client = Client()
result4 = computation.compute()  # Uses distributed with dashboard

Key Points:

  • Threads: Low overhead (benchmark task granularity), best for numeric work

  • Processes: Avoids GIL; includes serialization costs, best for Python work

  • Distributed: Monitoring dashboard (~1 ms/task), scales to clusters

  • Can switch schedulers per computation or globally

Best Practices

For comprehensive performance optimization guidance, memory management strategies, and common pitfalls to avoid, refer to references/best-practices.md. Key principles include:

Start with Simpler Solutions

Before using Dask, explore:

  • Better algorithms

  • Efficient file formats (Parquet instead of CSV)

  • Compiled code (Numba, Cython)

  • Data sampling

Critical Performance Rules

1. Don't Load Data Locally Then Hand to Dask

# Wrong: Loads all data in memory first
import pandas as pd
df = pd.read_csv('large.csv')
ddf = dd.from_pandas(df, npartitions=10)

# Correct: Let Dask handle loading
import dask.dataframe as dd
ddf = dd.read_csv('large.csv')

2. Avoid Repeated compute() Calls

# Wrong: Each compute is separate
for item in items:
    result = dask_computation(item).compute()

# Correct: Single compute for all
computations = [dask_computation(item) for item in items]
results = dask.compute(*computations)

3. Don't Build Excessively Large Task Graphs

  • Increase chunk sizes if millions of tasks

  • Use map_partitions/map_blocks to fuse operations

  • Check task graph size: len(ddf.__dask_graph__())

4. Choose Appropriate Chunk Sizes

  • Target: chunks and concurrent input/output/temporary buffers must fit worker memory

  • Too large: Memory overflow

  • Too small: Scheduling overhead

5. Use the Dashboard

from dask.distributed import Client
client = Client()
print(client.dashboard_link)  # Monitor performance, identify bottlenecks

Common Workflow Patterns

ETL Pipeline
import dask.dataframe as dd

# Extract: Read data
ddf = dd.read_csv('raw_data/*.csv')

# Transform: Clean and process
ddf = ddf[ddf['status'] == 'valid']
ddf['amount'] = ddf['amount'].astype('float64')
ddf = ddf.dropna(subset=['important_col'])

# Load: Aggregate and save
summary = ddf.groupby('category').agg(amount_sum=('amount', 'sum'), amount_mean=('amount', 'mean'))
summary.to_parquet('output/summary.parquet')
Unstructured to Structured Pipeline
import dask.bag as db
import json

# Start with Bag for unstructured data
bag = db.read_text('logs/*.json').map(json.loads)
bag = bag.filter(lambda x: x['status'] == 'valid')

# Convert to DataFrame for structured analysis
ddf = bag.to_dataframe()
result = ddf.groupby('category')['value'].mean().compute()
Large-Scale Array Computation
import dask.array as da

# Load or create large array
x = da.from_zarr('large_dataset.zarr')

# Process in chunks
scale = x.std()
normalized = (x - x.mean()) / da.where(scale > 0, scale, 1)

# Create a new store; Zarr creation options are direct keyword arguments
da.to_zarr(normalized, 'normalized.zarr', mode='w-')
Custom Parallel Workflow
from dask.distributed import Client

client = Client()

# Scatter large dataset once
[data] = client.scatter([large_dataset])  # Preserve a list/dict as one object

# Process in parallel with dependencies
futures = []
for param in parameters:
    future = client.submit(process, data, param)
    futures.append(future)

# Gather results
results = client.gather(futures)

Selecting the Right Component

Use this decision guide to choose the appropriate Dask component:

Data Type:

  • Tabular data → DataFrames

  • Numeric arrays → Arrays

  • Text/JSON/logs → Bags (then convert to DataFrame)

  • Custom Python objects → Bags or Futures

Operation Type:

  • Standard pandas operations → DataFrames

  • Standard NumPy operations → Arrays

  • Custom parallel tasks → Futures

  • Text processing/ETL → Bags

Integration Considerations

File Formats
  • Efficient: Parquet for tables; Zarr/HDF5 for chunked arrays (HDF5 handle restrictions apply)

  • Compatible but slower: CSV (use for initial ingestion only)

  • For Arrays: HDF5, Zarr, NetCDF

Conversion Between Collections
# Bag → DataFrame
ddf = bag.to_dataframe()

# DataFrame → Array (for numeric data)
arr = ddf.to_dask_array(lengths=True)

# Array → DataFrame
ddf = dd.from_dask_array(arr, columns=['col1', 'col2'])
With Other Libraries
  • XArray: Wraps Dask arrays with labeled dimensions (geospatial, imaging)

  • Dask-ML: Machine learning with scikit-learn compatible APIs

  • Distributed: Advanced cluster management and monitoring

Debugging and Development

Iterative Development Workflow
  1. Test on small data with synchronous scheduler:

dask.config.set(scheduler='synchronous')
result = computation.compute()  # Can use pdb, easy debugging
  1. Validate with threads on sample:

sample = ddf.head(1000)  # First partition only by default; may return fewer rows
# Test logic, then scale to full dataset
  1. Scale with distributed for monitoring:

from dask.distributed import Client
client = Client()
print(client.dashboard_link)  # Monitor performance
result = computation.compute()
Common Issues

Memory Errors:

  • Check where the result lands: collection .compute() and client.gather() materialize results in client memory; reduce first or write partitioned output when the full result cannot fit.

  • Distributed persist() retains partitions on workers; it does not make a later oversized gather safe. Budget worker memory and release persisted collections when done.

  • Tune chunk sizes for concurrent tasks and temporary arrays, and inspect custom functions for memory growth.

Slow Start:

  • Task graph too large (increase chunk sizes)

  • Use map_partitions or map_blocks to reduce tasks

Poor Parallelization:

  • Chunks too large (increase number of partitions)

  • Using threads with Python code (switch to processes)

  • Data dependencies preventing parallelism

Reference Files

All reference documentation files can be read as needed for detailed information:

  • references/dataframes.md - Complete Dask DataFrame guide

  • references/arrays.md - Complete Dask Array guide

  • references/bags.md - Complete Dask Bag guide

  • references/futures.md - Complete Dask Futures and distributed computing guide

  • references/schedulers.md - Complete scheduler selection and configuration guide

  • references/best-practices.md - Performance optimization and troubleshooting

  • references/review.md - Current upstream sources and executed validation

Load these files when users need detailed information about specific Dask components, operations, or patterns beyond the quick guidance provided here.

Citing Scientific Agent Skills

This skill is part of Scientific Agent Skills by K-Dense. If it materially contributed to a manuscript, report, presentation, or code release, add the paper to the references or software section and tell the user you did so:

Kassis, T., Agarwal, V., He, Y., Patel, D., & Brueckner, A. M. (2026). Scientific Agent Skills: A Library of Procedural Knowledge for Research Agents. arXiv:2609.00065. https://doi.org/10.48550/arXiv.2609.00065

Always cite the current version. The DOI and https://arxiv.org/abs/2609.00065 resolve to the latest arXiv version, so never append a version suffix such as v1. When network access is available, fetch https://arxiv.org/abs/2609.00065 (or http://export.arxiv.org/api/query?id_list=2609.00065) before writing the reference and take the author list, year, and version from that record. If the record lists a journal reference or publisher DOI, cite the published version instead.

Files

references/arrays.md

Dask Arrays

Reviewed with Dask/distributed 2026.8.0. File paths, deployment settings, and undefined application functions are illustrative; executed local checks and current official sources are in review.md.

Overview

Dask Array implements NumPy's ndarray interface using blocked algorithms. It coordinates many NumPy arrays arranged into a grid to enable computation on datasets larger than available memory, utilizing parallelism across multiple cores.

Core Concept

A Dask Array is divided into chunks (blocks):

  • Each chunk is a regular NumPy array

  • Operations are applied to each chunk in parallel

  • Results are combined automatically

  • Enables out-of-core computation (data larger than RAM)

Key Capabilities

What Dask Arrays Support

Mathematical Operations:

  • Arithmetic operations (+, -, *, /)

  • Scalar functions (exponentials, logarithms, trigonometric)

  • Element-wise operations

Reductions:

  • sum(), mean(), std(), var()

  • Reductions along specified axes

  • min(), max(), argmin(), argmax()

Linear Algebra:

  • Tensor contractions

  • Dot products and matrix multiplication

  • Some decompositions (SVD, QR)

Data Manipulation:

  • Transposition

  • Slicing (standard and fancy indexing)

  • Reshaping

  • Concatenation and stacking

Array Protocols:

  • Universal functions (ufuncs)

  • NumPy protocols for interoperability

When to Use Dask Arrays

Use Dask Arrays When:

  • Arrays exceed available RAM

  • Computation can be parallelized across chunks

  • Working with NumPy-style numerical operations

  • Need to scale NumPy code to larger datasets

Stick with NumPy When:

  • Arrays fit comfortably in memory

  • Operations require global views of data

  • Using specialized functions not available in Dask

  • Performance is adequate with NumPy alone

Important Limitations

Dask Arrays intentionally don't implement certain NumPy features:

Not Implemented:

  • Most np.linalg functions (only basic operations available)

  • Operations difficult to parallelize (like full sorting)

  • Memory-inefficient operations (converting to lists, iterating via loops)

  • Many specialized functions (driven by community needs)

Workarounds: map_blocks is appropriate only when each block can be processed independently. A block FFT is not a global FFT; neighborhood filters need overlap; global reductions need a valid combine step.

Creating Dask Arrays

From NumPy Arrays
import dask.array as da
import numpy as np

# Create from NumPy array with specified chunks
x = np.arange(10000)
dx = da.from_array(x, chunks=1000)  # Creates 10 chunks of 1000 elements each
Random Arrays
# Create random array with specified chunks
x = da.random.random((10000, 10000), chunks=(1000, 1000))

# Other random functions
x = da.random.normal(10, 0.1, size=(10000, 10000), chunks=(1000, 1000))
Zeros, Ones, and Empty
# Create arrays filled with constants
zeros = da.zeros((10000, 10000), chunks=(1000, 1000))
ones = da.ones((10000, 10000), chunks=(1000, 1000))
empty = da.empty((10000, 10000), chunks=(1000, 1000))
From Functions
import dask
import dask.array as da
import numpy as np

def create_block(i, j):
    # Deterministic small synthetic block
    return np.full((4, 5), i * 10 + j, dtype='float64')

blocks = [[da.from_delayed(dask.delayed(create_block)(i, j),
                           shape=(4, 5), dtype='float64')
           for j in range(3)] for i in range(2)]
x = da.block(blocks)  # (8, 15); from_delayed accepts ONE delayed value
From Disk
# Load from HDF5
import h5py
with h5py.File('myfile.hdf5', mode='r') as f:
    x = da.from_array(f['/data'], chunks=(1000, 1000))
    mean = x.mean().compute(scheduler='threads')  # While handle is open
# h5py handles cannot be pickled for process/distributed workers.
# For those schedulers, open files inside worker tasks and return concrete chunks.

# Load from Zarr
import zarr
z = zarr.open('myfile.zarr', mode='r')
x = da.from_array(z, chunks=(1000, 1000))

Common Operations

Arithmetic Operations
import dask.array as da

x = da.random.random((10000, 10000), chunks=(1000, 1000))
y = da.random.random((10000, 10000), chunks=(1000, 1000))

# Element-wise operations (lazy)
z = x + y
z = x * y
z = da.exp(x)
z = da.log(y)

# Compute result
result = z.compute()
Reductions
# Reductions along axes
total = x.sum().compute()
mean = x.mean().compute()
std = x.std().compute()

# Reduction along specific axis
row_means = x.mean(axis=1).compute()
col_sums = x.sum(axis=0).compute()
Slicing and Indexing
# Standard slicing (returns Dask Array)
subset = x[1000:5000, 2000:8000]

# Fancy indexing
indices = [0, 5, 10, 15]
selected = x[indices, :]

# Boolean indexing
mask = x > 0.5
filtered = x[mask]
Matrix Operations
# Matrix multiplication
A = da.random.random((10000, 5000), chunks=(1000, 1000))
B = da.random.random((5000, 8000), chunks=(1000, 1000))
C = da.matmul(A, B)
result = C.compute()

# Dot product
dot_product = da.dot(A, B)

# Transpose
AT = A.T
Linear Algebra
# Exact SVD/QR need a single column of chunks here.
# Check that a full-width block and decomposition workspaces fit memory.
import dask
A = da.random.default_rng(42).random((40, 6), chunks=(10, 6))
U, s, Vt = da.linalg.svd(A)
U_computed, s_computed, Vt_computed = dask.compute(U, s, Vt)

# QR decomposition
Q, R = da.linalg.qr(A)
Q_computed, R_computed = dask.compute(Q, R)

# Note: Only some linalg operations are available
Reshaping and Manipulation
# Reshape
x = da.random.random((10000, 10000), chunks=(1000, 1000))
reshaped = x.reshape(5000, 20000)

# Transpose
transposed = x.T

# Concatenate
x1 = da.random.random((5000, 10000), chunks=(1000, 1000))
x2 = da.random.random((5000, 10000), chunks=(1000, 1000))
combined = da.concatenate([x1, x2], axis=0)

# Stack
stacked = da.stack([x1, x2], axis=0)

Chunking Strategy

Chunking is critical for Dask Array performance.

Chunk Size Guidelines

Good Chunk Sizes:

  • Measure uncompressed bytes (prod(chunk_shape) * dtype.itemsize)

  • Start around 100 MiB for substantial arrays, then measure task duration and peak memory

  • Budget concurrent input, output, and temporary buffers; align chunks with storage

Example Calculation:

# For float64 data (8 bytes per element)
# Target 100 MB chunks: 100 MB / 8 bytes = 12.5M elements

# For 2D array (10000, 10000):
x = da.random.random((10000, 10000), chunks=(1000, 1000))  # ~8 MB per chunk
Viewing Chunk Structure
# Check chunks
print(x.chunks)  # ((1000, 1000, ...), (1000, 1000, ...))

# Number of chunks
print(x.npartitions)

# Chunk sizes in bytes
print(x.nbytes / x.npartitions)
Rechunking
# Change chunk sizes
x = da.random.random((10000, 10000), chunks=(500, 500))
x_rechunked = x.rechunk((2000, 2000))

# Rechunk specific dimension
x_rechunked = x.rechunk({0: 2000, 1: 'auto'})

Custom Operations with map_blocks

For operations not available in Dask, use map_blocks:

import dask.array as da
import numpy as np

def custom_function(block):
    # Apply custom NumPy operation
    return np.log1p(block)

x = da.random.random((10000, 10000), chunks=(1000, 1000))
result = da.map_blocks(custom_function, x, dtype='float64',
                       meta=np.empty((0, 0), dtype='float64'))

# Compute
output = result.compute()

For a global FFT use da.fft.fft2(x.rechunk({0: -1, 1: -1})) only if that full transform fits memory: each transform axis must have one chunk. Mapping np.fft.fft2 independently over chunks changes the scientific calculation.

map_blocks with Different Output Shape
def reduction_function(block):
    # Preserve rank: one 1x1 output for each two-dimensional input block
    return np.array([[block.mean()]], dtype='float64')

result = da.map_blocks(reduction_function, x, dtype='float64',
                       chunks=(1, 1), meta=np.empty((0, 0), dtype='float64'))
# result.shape == x.numblocks. Do not average these means unweighted when
# edge chunks have different sizes; x.mean() is the correct global reduction.
# drop_axis concatenates chunks along dropped axes before calling the function.

Lazy Evaluation and Computation

Lazy Operations
# All operations are lazy (instant, no computation)
x = da.random.random((10000, 10000), chunks=(1000, 1000))
y = x + 100
z = y.mean(axis=0)
result = z * 2

# Nothing computed yet, just task graph built
Triggering Computation
# Compute single result
final = result.compute()

# Compute multiple results efficiently
result1, result2 = dask.compute(operation1, operation2)
Persist in Memory
# Keep intermediate results in memory
x_cached = x.persist()

# Reuse cached results
y1 = (x_cached + 10).compute()
y2 = (x_cached * 2).compute()

Saving Results

To NumPy
# Convert to NumPy (loads all in memory)
numpy_array = dask_array.compute()
To Disk
# Save to Zarr; mode='w-' fails if output exists. mode='w' replaces it.
# **zarr_array_kwargs means direct keywords, e.g. zarr_format=3, not a nested dict.
da.to_zarr(x, 'output.zarr', mode='w-', zarr_format=3)

# Save to HDF5
import h5py
with h5py.File('output.hdf5', mode='w') as f:
    dset = f.create_dataset('/data', shape=x.shape, dtype=x.dtype)
    da.store(x, dset, scheduler='threads')  # Local open HDF5 handle

Performance Considerations

Efficient Operations
  • Element-wise operations: Very efficient

  • Reductions with parallelizable operations: Efficient

  • Slicing along chunk boundaries: Efficient

  • Matrix operations with good chunk alignment: Efficient

Expensive Operations
  • Slicing across many chunks: Requires data movement

  • Operations requiring global sorting: Not well supported

  • Extremely irregular access patterns: Poor performance

  • Operations with poor chunk alignment: Requires rechunking

Optimization Tips

1. Choose Good Chunk Sizes

# Aim for balanced chunks
# About 100 MB of float64 per chunk (2500 * 5000 * 8)
x = da.random.random((100000, 10000), chunks=(2500, 5000))

2. Align Chunks for Operations

# Make sure chunks align for operations
x = da.random.random((10000, 10000), chunks=(1000, 1000))
y = da.random.random((10000, 10000), chunks=(1000, 1000))  # Aligned
z = x + y  # Efficient

3. Use Appropriate Scheduler

# Arrays work well with threaded scheduler (default)
# Shared memory access is efficient
result = x.compute()  # Uses threads by default

4. Minimize Data Transfer

# Better: Compute on each chunk, then transfer results
means = x.mean(axis=1).compute()  # Transfers less data

# Worse: Transfer all data then compute
x_numpy = x.compute()
means = x_numpy.mean(axis=1)  # Transfers more data

Common Patterns

Image Processing
import dask.array as da

# Load large image stack
images = da.from_zarr('images.zarr')

# Assume axes (frame, y, x): filter spatial axes only, in floating point.
# sigma=2 and radius=8 must agree with the overlap depth.
from scipy.ndimage import gaussian_filter
images = images.astype('float64')

def apply_gaussian(block):
    return gaussian_filter(block, sigma=(0, 2, 2), radius=(0, 8, 8), mode='reflect')

filtered = da.map_overlap(apply_gaussian, images, depth=(0, 8, 8),
                          boundary='reflect', trim=True, dtype='float64')
# Compare to SciPy on a fixture spanning chunk boundaries and image edges.

# Compute statistics
mean_intensity = filtered.mean().compute()
Scientific Computing
# Large-scale numerical simulation
x = da.random.default_rng(42).random((1000, 1000), chunks=(250, 250))

# Apply iterative computation
for i in range(num_iterations):
    x = da.exp(-x) * da.sin(x)
    x = x.persist()  # Budget all retained chunks and temporary arrays

# Final result
result = x.compute()
Data Analysis
# Load large dataset
data = da.from_zarr('measurements.zarr')

# Compute statistics
mean = data.mean(axis=0)
std = data.std(axis=0)
normalized = (data - mean) / da.where(std > 0, std, 1)
# Define a separate policy for NaNs; constant columns become zero.

# Save normalized data
da.to_zarr(normalized, 'normalized.zarr', mode='w-')

Integration with Other Tools

XArray
import xarray as xr
import dask.array as da

# XArray wraps Dask arrays with labeled dimensions
data = da.random.random((1000, 2000, 3000), chunks=(100, 200, 300))
dataset = xr.DataArray(
    data,
    dims=['time', 'y', 'x'],
    coords={'time': range(1000), 'y': range(2000), 'x': range(3000)}
)
Scikit-learn (via Dask-ML)
# Some scikit-learn compatible operations
from dask_ml.preprocessing import StandardScaler

X = da.random.random((10000, 100), chunks=(1000, 100))
scaler = StandardScaler()
X_scaled = scaler.fit_transform(X)

Debugging Tips

Visualize Task Graph
# Visualize computation graph (for small arrays)
x = da.random.random((100, 100), chunks=(10, 10))
y = x + 1
y.visualize(filename='graph.png')  # Needs Python graphviz and system Graphviz
Check Array Properties
# Inspect before computing
print(f"Shape: {x.shape}")
print(f"Dtype: {x.dtype}")
print(f"Chunks: {x.chunks}")
print(f"Number of tasks: {len(x.__dask_graph__())}")
Test on Small Arrays First
# Test logic on small array
small_x = da.random.random((100, 100), chunks=(50, 50))
result_small = computation(small_x).compute()

# Validate, then scale
large_x = da.random.default_rng(42).random((1000, 1000), chunks=(250, 250))
result_large = computation(large_x).mean().compute()  # Or write partitioned output

Requirements and compatibility

Works with: Claude Code, Claude apps, OpenAI Codex, GitHub Copilot, Cursor, Gemini CLI, Kiro, OpenCode, Goose, Amp, Roo Code, JetBrains Junie, Factory Droid, Devin (ex-Windsurf), Mistral Vibe, OpenHands, Letta

“Works with” means the tool reads the open Agent Skills format; a skill written for one tool may use features others lack.

Needs: Declares allowed tools, Needs network access, Needs Python

The author says: Requires Python 3.10+ and dask 2026.8.0; current Zarr 3.4 needs Python 3.12+. DataFrame workflows need pandas 2+ and PyArrow 16+. Cloud paths (s3://, gcs://) need s3fs or gcsfs. Cluster deployment uses dask.distributed (included with dask[complete]).

Security

What our scanner noticed· Low risk

  • Instructions that use the network

A static scan is not a guarantee. Skills are third-party content: review a skill before you let an agent use it.

Attribution and licence

Created by
K-Dense Inc.
Publisher
K-Dense (Community)
Source
K-Dense-AI/scientific-agent-skills · skills/dask · commit a25cf9e
Licence
MIT License (redistribution allowed)
  • LICENSE (added by AutoGineer from LICENSE.md)
  • ATTRIBUTION.md (written by AutoGineer)
Synced

AutoGineer is not affiliated with or endorsed by K-Dense Inc. or K-Dense.

Download ZIP

The ZIP holds the skill’s files, its licence files and an ATTRIBUTION.md. Download dask.zip