Adapt import commit batches from observed transaction duration
This commit is contained in:
@@ -776,3 +776,13 @@ still exceeds 240 seconds. Removing ID-table copies and metadata-only document
|
||||
scans is directly verified; a general throughput improvement at 10000 nodes is
|
||||
not established. Per-record commit, ACK and remaining table traversal costs remain
|
||||
part of the larger implementation goal.
|
||||
|
||||
Import commit sizing uses runner-local feedback rather than dividing total
|
||||
transaction time by unit count and treating it as a purely marginal cost.
|
||||
The first ready record remains immediate. Successful batches within the soft
|
||||
frame budget grow by a bounded step; an over-budget batch reduces the limit.
|
||||
A short tail or dependency group cannot increase it. `maxBatch`, byte/change
|
||||
limits, atomic reference cycles, parser slices and durability backpressure keep
|
||||
their existing roles. Rejected attempts do not train the success-cost estimate.
|
||||
The limit is a scheduling hint, not another persistent queue or an assurance
|
||||
that an indivisible transaction or subsequent renderer work fits one frame.
|
||||
|
||||
Reference in New Issue
Block a user