force selected pipeline stages in throughput mode
Validate Operations / validate-operations (push) Has been cancelled
Validate Operations / validate-operations (push) Has been cancelled
increase throughput scheduler budget add experimental throughput auto mode
This commit is contained in:
@@ -138,7 +138,10 @@ remain approximations, not extra inferred memory traffic.
|
||||
adjustment between physical execution cost and nominal volume priority, scaling
|
||||
it by chunk lanes. Initialization uses nominal priorities; transposes count as
|
||||
bulk moves there. One joint prefix/resource DP constructs the initial partition.
|
||||
Bounded beam refinement changes partitions and their core allocations together.
|
||||
Bounded incumbent/frontier refinement changes partitions and core allocations together.
|
||||
Numeric depths require exactly that many nonempty compute stages throughout both DPs,
|
||||
packing, refinement, and realization. Auto uses the same optimizer across a bounded
|
||||
stage-count domain; all depths share the queue-evaluation budget.
|
||||
Queue-aware Spatial evaluation scores every admitted physical placement. PEFT,
|
||||
final schedule evaluation, and reported per-core demand use physical estimates.
|
||||
These quantities must not be substituted for measured simulator periods.
|
||||
@@ -255,3 +258,21 @@ Storage costs `O(P+R+G D)` for bounded generation count `G`, plus bounded recurr
|
||||
Reports separate extraction, expansion, and queue-analysis times.
|
||||
Fingerprints compare memory and blocking-operation order, without addresses or work between requests.
|
||||
Equal fingerprints therefore do not prove equal request readiness or timing.
|
||||
|
||||
### Shared automatic-depth initialization
|
||||
|
||||
`PipelinePartitionTable` owns the ordered segment costs and joint prefix/resource
|
||||
states. Automatic depth shares integer-core segment curves across its depth
|
||||
initializations. Each depth samples its original bounded resource grid.
|
||||
Its reserved-core count changes that grid, so identical DP states are not available across depths.
|
||||
Both modes use the same recurrence, legality checks, and constructive packing
|
||||
implementation.
|
||||
Ordered cost curves share threshold scans. Scalar queries retain their original
|
||||
cost and placement decisions. Compact plans retain the constructive core count
|
||||
before spare cores are assigned. Minimum-resource completion uses the same
|
||||
shared scalar-equivalent curves.
|
||||
|
||||
Automatic-depth initialization reports separate grouping, segment packing,
|
||||
DP-state evaluation, and physical placement. Fixed-depth initialization remains
|
||||
inside the candidate-generation timing. The complete queue model determines
|
||||
eligibility and final selection. Initialization priorities are search costs, not timing bounds.
|
||||
|
||||
Reference in New Issue
Block a user