-
Notifications
You must be signed in to change notification settings - Fork 2
Benchmark Suite
The GraphBrew Benchmark Suite provides automated tools for running comprehensive experiments across multiple graphs, algorithms, and benchmarks.
scripts/
├── graphbrew_experiment.py # ⭐ MAIN: One-click unified pipeline
│ # Downloads, builds, benchmarks, analyzes
├── requirements.txt # Python dependencies
├── lib/ # 📦 Core modules (all functionality)
│ ├── download.py # Graph downloading
│ ├── benchmark.py # Benchmark execution
│ ├── cache.py # Cache simulation
│ ├── weights.py # Weight management
│ ├── training.py # ML training
│ ├── features.py # Graph feature extraction
│ └── ... # Other modules
Weight files are stored under results/weights/ (not scripts/).
python3 scripts/graphbrew_experiment.py --full --size small # Full pipeline
python3 scripts/graphbrew_experiment.py --train --size small # Training pipeline
python3 scripts/graphbrew_experiment.py --size small --quick # Quick test
python3 scripts/graphbrew_experiment.py --brute-force # ValidationSizes: small (16 graphs, 62MB) · medium (28, 1.1GB) · large (37, 25GB) · xlarge (6, 63GB) · all (87, 89GB). Categories include mesh, web, social, road, citation, P2P, and synthetic graphs.
Results saved to ./results/ (reorder_*.json, benchmark_*.json, cache_*.json) and weights to ./results/weights/ (registry.json, type_N/weights.json).
python3 scripts/graphbrew_experiment.py --phase reorder --size small
python3 scripts/graphbrew_experiment.py --phase benchmark --size small --skip-cache
python3 scripts/graphbrew_experiment.py --phase cache --size small
python3 scripts/graphbrew_experiment.py --phase weightsSee Command-Line-Reference for all options including --min-mb, --max-graphs, --trials, --quick.
Results are JSON arrays. See Configuration-Files for the complete schema of benchmark_*.json, cache_*.json, reorder_*.json, and type_N.json weight files.
After benchmarking, the pipeline automatically computes amortization metrics:
-
Break-even N* =
reorder_overhead / time_saved_per_iteration— iterations before reordering pays off -
E2E Speedup@N =
N × baseline_time / (reorder_overhead + N × reordered_time)— end-to-end speedup - MinN@95% — smallest N where reorder overhead < 5% of total cost
python3 scripts/graphbrew_experiment.py --phase all # Amortization computed automatically
python3 -m scripts.lib.metrics # Standalone amortization analysisNote: Experiments default to 7 benchmarks (
EXPERIMENT_BENCHMARKS— TC excluded). After RANDOM baseline.sgconversion, the pipeline pre-generates reordered.sgfor each of the 12 reorder algorithms (--pregenerate-sg, default ON). At benchmark time, pre-generated.sgfiles are loaded with-o 0— no runtime reorder overhead. The reorder phase runs 12 algorithms (baselines ORIGINAL/RANDOM skipped). Benchmarking runs all 14 eligible algorithms.
See Python-Scripts#-amortization--end-to-end-evaluation---phase-all for full details.
Analyze how reordering affects PageRank convergence.
Run PageRank directly via the binary with verbose output:
# Run PR with verbose convergence output
./bench/bin/pr -f graph.mtx -s -o 7 -n 5Or include in the experiment pipeline:
# Run benchmarks (includes convergence data in results)
python3 scripts/graphbrew_experiment.py --phase benchmark --size smallPageRank convergence can vary by reordering algorithm. Run with --benchmarks pr to see iteration counts and final error for each algorithm on your graphs.
# One-click full experiment
python3 scripts/graphbrew_experiment.py --full --size mediumFor step-by-step control, see Running-Benchmarks for manual execution and Command-Line-Reference for all options.
See Troubleshooting for common issues. Quick fixes:
- Missing graphs:
--download-only --force-download - Memory issues:
--size smallor--max-mb 500 - Timeouts:
--skip-slow --skip-expensive
- Correlation-Analysis - Analyze benchmark results
- AdaptiveOrder-ML - Train the perceptron
- Running-Benchmarks - Manual benchmark commands
- Python-Scripts - Full script documentation