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
Download the skill as a ZIP:
https://mp-staging.autogineer.com/agent-skills/k-dense-ai/dask/downloadUnzip 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:// pathsRequires 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_partitionsPerformance 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()calledUse
map_partitionsfor efficient custom operationsConvert 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_blocksIntegration 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_blocksfor 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
foldbyinstead ofgroupbyfor better performanceOperations 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 dashboardKey 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_blocksto fuse operationsCheck 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 bottlenecksCommon 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
Test on small data with synchronous scheduler:
dask.config.set(scheduler='synchronous')
result = computation.compute() # Can use pdb, easy debuggingValidate with threads on sample:
sample = ddf.head(1000) # First partition only by default; may return fewer rows
# Test logic, then scale to full datasetScale 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()andclient.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_partitionsormap_blocksto 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 guidereferences/arrays.md- Complete Dask Array guidereferences/bags.md- Complete Dask Bag guidereferences/futures.md- Complete Dask Futures and distributed computing guidereferences/schedulers.md- Complete scheduler selection and configuration guidereferences/best-practices.md- Performance optimization and troubleshootingreferences/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
- ATTRIBUTION.mdAdded by AutoGineer959 B
- LICENSELicence file added by AutoGineer1.0 KiB
- SKILL.md17.1 KiB
- references/arrays.md13.5 KiB
- references/bags.md11.4 KiB
- references/best-practices.md7.9 KiB
- references/dataframes.md10.3 KiB
- references/futures.md13.1 KiB
- references/review.md8.5 KiB
- references/schedulers.md12.9 KiB
references/best-practices.md
Dask Best Practices
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.
Performance Optimization Principles
Start with Simpler Solutions First
Before implementing parallel computing with Dask, explore these alternatives:
Better algorithms for the specific problem
Efficient file formats (Parquet, HDF5, Zarr instead of CSV)
Compiled code via Numba or Cython
Data sampling for development and testing
These alternatives often provide better returns than distributed systems and should be exhausted before scaling to parallel computing.
Chunk Size Strategy
Critical Rule: Chunks should be small enough that many fit in a worker's available memory at once.
Starting estimate: Allow several chunks per active thread plus outputs, temporary buffers, Python overhead, and shuffle data. Ten chunks per core is a heuristic, not a safe universal limit.
Why It Matters:
Too large chunks: Memory overflow and inefficient parallelization
Too small chunks: Excessive scheduling overhead
Example Calculation:
8 cores with 32 GB RAM
400 MB per chunk (32 GB / 8 cores / 10) would consume the entire nominal budget; start smaller to leave workspace and OS headroom. Measure uncompressed memory, not file size.
Monitor with the Dashboard
The Dask dashboard provides essential visibility into:
Worker states and resource utilization
Task progress and bottlenecks
Memory usage patterns
Performance characteristics
Access the dashboard to understand what's actually slow in parallel workloads rather than guessing at optimizations.
Critical Pitfalls to Avoid
1. Don't Create Large Objects Locally Before Dask
Wrong Approach:
import pandas as pd
import dask.dataframe as dd
# Loads entire dataset into memory first
df = pd.read_csv('large_file.csv')
ddf = dd.from_pandas(df, npartitions=10)Correct Approach:
import dask.dataframe as dd
# Let Dask handle the loading
ddf = dd.read_csv('large_file.csv')Why: Loading data with pandas or NumPy first forces the scheduler to serialize and embed those objects in task graphs, defeating the purpose of parallel computing.
Key Principle: Use Dask methods to load data and use Dask to control the results.
2. Avoid Repeated compute() Calls
Wrong Approach:
results = []
for item in items:
result = dask_computation(item).compute() # Each compute is separate
results.append(result)Correct Approach:
computations = [dask_computation(item) for item in items]
results = dask.compute(*computations) # Single compute for allWhy: Calling compute in loops prevents Dask from:
Parallelizing different computations
Sharing intermediate results
Optimizing the overall task graph
3. Don't Build Excessively Large Task Graphs
Symptoms:
Millions of tasks in a single computation
Severe scheduling overhead
Long delays before computation starts
Solutions:
Increase chunk sizes to reduce number of tasks
Use
map_partitionsormap_blocksto fuse operationsBreak computations into smaller pieces with intermediate persists
Consider whether the problem truly requires distributed computing
Example Using map_partitions:
# Instead of applying function to each row
ddf['result'] = ddf.apply(complex_function, axis=1, meta=('result', 'float64'))
# Python row calls within partitions, not one Dask task per row
# Apply to entire partitions at once
ddf = ddf.map_partitions(lambda df: df.assign(result=complex_function(df)))Infrastructure Considerations
Scheduler Selection
Use Threads For:
Numeric work with GIL-releasing libraries (NumPy, Pandas, scikit-learn)
Operations that benefit from shared memory
Single-machine workloads with array/dataframe operations
Use Processes For:
Text processing and Python collection operations
Pure Python code that's GIL-bound
Operations that need process isolation
Use Distributed Scheduler For:
Multi-machine clusters
Need for diagnostic dashboard
Asynchronous APIs
Better data locality handling
Thread Configuration
Recommendation: Aim for roughly 4 threads per process on numeric workloads.
Rationale:
Balance between parallelism and overhead
Allows efficient use of CPU cores
Reduces context switching costs
Memory Management
Persist Strategically: Persist reusable intermediates only after filtering and selecting columns; persistence blocks later optimizer pushdown. Distributed persistence stays on workers, while local persistence occupies local memory. It is not an automatic cure for memory errors.
# Persist intermediate results that are reused
intermediate = expensive_computation(data).persist()
result1 = intermediate.operation1().compute()
result2 = intermediate.operation2().compute()Clear Memory When Done:
# Explicitly delete large objects
del intermediateData Loading Best Practices
Use Appropriate File Formats
For Tabular Data:
Parquet: Columnar, compressed, fast filtering
CSV: Only for small data or initial ingestion
For Array Data:
HDF5: Good for numeric arrays
Zarr: Cloud-native, parallel-friendly
NetCDF: Scientific data with metadata
Optimize Data Ingestion
Read Multiple Files Efficiently:
# Use glob patterns to read multiple files in parallel
ddf = dd.read_parquet('data/year=2024/month=*/day=*.parquet')Specify Useful Columns Early:
# Only read needed columns
ddf = dd.read_parquet('data.parquet', columns=['col1', 'col2', 'col3'])Common Patterns and Solutions
Pattern: Embarrassingly Parallel Problems
For independent computations, use Futures:
from dask.distributed import Client
client = Client()
futures = [client.submit(func, arg) for arg in args]
results = client.gather(futures)Pattern: Data Preprocessing Pipeline
Use Bags for initial ETL, then convert to structured formats:
import dask.bag as db
import json
# Process raw JSON Lines
bag = db.read_text('logs/*.json').map(json.loads)
bag = bag.filter(lambda x: x['status'] == 'success')
# Convert to DataFrame for analysis
ddf = bag.to_dataframe()Pattern: Iterative Algorithms
Persist data between iterations:
data = dd.read_parquet('data.parquet')
data = data.persist() # Only when reusable partitions fit worker memory
for iteration in range(num_iterations):
data = update_function(data)
data = data.persist() # Persist updated versionDebugging Tips
Use Single-Threaded Scheduler
For debugging with pdb or detailed error inspection:
import dask
dask.config.set(scheduler='synchronous')
result = computation.compute() # Runs in single thread for debuggingCheck Task Graph Size
Before computing, check the number of tasks:
print(len(ddf.__dask_graph__())) # Should be reasonable, not millionsValidate on Small Data First
Test logic on small subset before scaling:
# Test on first partition
sample = ddf.head(1000)
# Validate results
# Then scale to full datasetPerformance Troubleshooting
Symptom: Slow Computation Start
Likely Cause: Task graph is too large Solution: Increase chunk sizes or use map_partitions
Symptom: Memory Errors
Likely Causes:
Chunks too large
Too many intermediate results
Memory leaks in user functions
Solutions:
Decrease chunk sizes
Use persist() strategically and delete when done
Profile user functions for memory issues
Symptom: Poor Parallelization
Likely Causes:
Data dependencies preventing parallelism
Chunks too large (not enough tasks)
GIL contention with threads on Python code
Solutions:
Restructure computation to reduce dependencies
Increase number of partitions
Switch to multiprocessing scheduler for Python code
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