-
Notifications
You must be signed in to change notification settings - Fork 2
AdaptiveOrder
AdaptiveOrder is GraphBrew's runtime selection boundary. The current validated deployment path is a frozen deterministic rule, not a machine-learning model.
It does not require a previous kernel run. For a new graph, it samples graph structure, combines that sample with kernel identity, LLC capacity, and declared reuse, and applies the frozen predicate once.
# One kernel invocation reusing one materialized mapping
./bench/bin/pr -f graph.sg -s \
-o '14:_:_:_:allkernel-lowreuse-rule:best-endtoend:1' \
-n 3
# Two kernel invocations reusing one materialized mapping
./bench/bin/bfs -f graph.sg -s \
-o '14:_:_:_:allkernel-lowreuse-rule:best-endtoend:2' \
-n 3Reuse is mandatory and must be at most 2.
The validated v2 rule uses:
- graph size;
- sampled average degree and degree coefficient of variation;
- kernel-specific property working set relative to LLC;
- kernel identity; and
- declared mapping reuse.
It may not use:
- graph filename or canonical graph name;
- benchmark-database lookup;
- runtime training;
- runtime k-nearest-neighbor search; or
- trial execution of multiple reorderers.
The rule chooses between:
-
FastLeiden-SizeDesc-Gorder8
12:leiden:compose:sg_none:comm_size_desc:intra_gorder:gw8: cd_parallel:sgmb4096:gordf5000:norefine:2:2 -
Boost Rabbit fallback.
The exact frozen predicate and validation figures are documented in All-Kernel Low-Reuse Selector.
- PR
- PR-SpMV
- BFS
- Afforest CC
- CC-SV
- BC
- SSSP
- reuse 1 or 2
Unsupported kernels and reuse above 2 use the fallback.
The decision is deterministic. The selected GraphBrew mapping can still vary
because its cd_parallel community detection is schedule-sensitive.
The public portfolio ratios account for chosen mapping cost plus reused kernel
time. They do not store algorithm-14 feature-extraction time. The deployable
binary prints Adaptive Feature Time, which must be included in final
deployment timing.
Legacy offline-model modes remain for research compatibility but are not the validated contribution.
The final rule was derived on 18 graphs, frozen, and tested on 12 additional graphs. All seven selected holdouts won at reuse 1 and 2; five graphs used Boost Rabbit fallback.
Public evidence: