Class: DispatchPolicy::Tick
- Inherits:
-
Object
- Object
- DispatchPolicy::Tick
- Defined in:
- lib/dispatch_policy/tick.rb
Constant Summary collapse
- THROTTLE_ZERO_THRESHOLD =
0.001- DEFAULT_TIME_SHARE_DURATION_MS =
Time-weighted variant of round-robin: instead of an equal quantum per active partition, allocate quanta proportional to the inverse of recently-consumed compute time. Solo partitions get the full batch_size; competing partitions get slices that bias admission toward whoever has consumed less, so total compute time stays balanced even when one tenant’s backlog is much bigger than another’s. Falls back to the same trailing top-up as the equal round-robin so we never under-fill the batch when only a few partitions are active.
100
Class Method Summary collapse
- .active_policies(policy_name) ⇒ Object
- .autoload_job_for(policy_name) ⇒ Object
- .fetch_batch(policy) ⇒ Object
- .fetch_plain_batch(policy) ⇒ Object
- .fetch_round_robin_batch(policy) ⇒ Object
- .fetch_time_weighted_batch(policy) ⇒ Object
- .lookup_policy(policy_name) ⇒ Object
- .prune_idle_partitions ⇒ Object
- .prune_orphan_gate_rows ⇒ Object
- .reap ⇒ Object
- .release(policy_name:, partitions:) ⇒ Object
- .revert_admission(staged) ⇒ Object
-
.run(policy_name: nil) ⇒ Object
Single admission pass: fetch pending staged jobs per policy, evaluate gates, mark survivors as admitted, then enqueue them on the real backend outside the locking transaction.
- .run_policy(policy, batch) ⇒ Object
Class Method Details
.active_policies(policy_name) ⇒ Object
105 106 107 108 109 110 111 112 |
# File 'lib/dispatch_policy/tick.rb', line 105 def self.active_policies(policy_name) return [ policy_name ] if policy_name StagedJob.pending .where("not_before_at IS NULL OR not_before_at <= ?", Time.current) .distinct .pluck(:policy_name) end |
.autoload_job_for(policy_name) ⇒ Object
258 259 260 261 262 |
# File 'lib/dispatch_policy/tick.rb', line 258 def self.autoload_job_for(policy_name) const_name = policy_name.tr("-", "/").camelize const_name.safe_constantize DispatchPolicy.registry[policy_name] end |
.fetch_batch(policy) ⇒ Object
114 115 116 117 118 119 120 121 122 123 124 |
# File 'lib/dispatch_policy/tick.rb', line 114 def self.fetch_batch(policy) if policy.round_robin? if policy.round_robin_weight == :time fetch_time_weighted_batch(policy) else fetch_round_robin_batch(policy) end else fetch_plain_batch(policy) end end |
.fetch_plain_batch(policy) ⇒ Object
126 127 128 129 130 131 132 133 134 |
# File 'lib/dispatch_policy/tick.rb', line 126 def self.fetch_plain_batch(policy) StagedJob.pending .where(policy_name: policy.name) .where("not_before_at IS NULL OR not_before_at <= ?", Time.current) .order(:priority, :staged_at) .limit(DispatchPolicy.config.batch_size) .lock("FOR UPDATE SKIP LOCKED") .to_a end |
.fetch_round_robin_batch(policy) ⇒ Object
136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 |
# File 'lib/dispatch_policy/tick.rb', line 136 def self.fetch_round_robin_batch(policy) quantum = DispatchPolicy.config.round_robin_quantum batch_size = DispatchPolicy.config.batch_size now = Time.current sql = <<~SQL.squish SELECT rows.* FROM ( SELECT DISTINCT round_robin_key FROM dispatch_policy_staged_jobs WHERE policy_name = ? AND admitted_at IS NULL AND round_robin_key IS NOT NULL AND (not_before_at IS NULL OR not_before_at <= ?) ) AS keys CROSS JOIN LATERAL ( SELECT * FROM dispatch_policy_staged_jobs WHERE policy_name = ? AND admitted_at IS NULL AND round_robin_key = keys.round_robin_key AND (not_before_at IS NULL OR not_before_at <= ?) ORDER BY priority, staged_at LIMIT ? FOR UPDATE SKIP LOCKED ) AS rows LIMIT ? SQL batch = StagedJob.find_by_sql([ sql, policy.name, now, policy.name, now, quantum, batch_size ]) remaining = batch_size - batch.size return batch if remaining <= 0 top_up = StagedJob.pending .where(policy_name: policy.name) .where("not_before_at IS NULL OR not_before_at <= ?", now) .where.not(id: batch.map(&:id)) .order(:priority, :staged_at) .limit(remaining) .lock("FOR UPDATE SKIP LOCKED") .to_a batch + top_up end |
.fetch_time_weighted_batch(policy) ⇒ Object
193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 |
# File 'lib/dispatch_policy/tick.rb', line 193 def self.fetch_time_weighted_batch(policy) batch_size = DispatchPolicy.config.batch_size now = Time.current partitions = StagedJob.pending .where(policy_name: policy.name) .where("not_before_at IS NULL OR not_before_at <= ?", now) .where.not(round_robin_key: nil) .distinct .pluck(:round_robin_key) return fetch_plain_batch(policy) if partitions.empty? consumed = PartitionObservation.consumed_ms_by_partition( policy_name: policy.name, partition_keys: partitions, window: policy.round_robin_window ) # Inverse-of-consumed weights, with a floor so a brand-new partition # (no observations) doesn't dominate to infinity. weights = partitions.each_with_object({}) do |key, acc| consumed_ms = consumed.dig(key, :consumed_ms) || 0 denom = [ consumed_ms, DEFAULT_TIME_SHARE_DURATION_MS ].max acc[key] = 1.0 / denom end total_weight = weights.values.sum quanta = weights.transform_values do |w| [ (batch_size * w / total_weight).floor, 1 ].max end batch = [] partitions.each do |key| rows = StagedJob.pending .where(policy_name: policy.name, round_robin_key: key) .where("not_before_at IS NULL OR not_before_at <= ?", now) .order(:priority, :staged_at) .limit(quanta[key]) .lock("FOR UPDATE SKIP LOCKED") .to_a batch.concat(rows) break if batch.size >= batch_size end remaining = batch_size - batch.size return batch if remaining <= 0 || batch.empty? top_up = StagedJob.pending .where(policy_name: policy.name) .where("not_before_at IS NULL OR not_before_at <= ?", now) .where.not(id: batch.map(&:id)) .order(:priority, :staged_at) .limit(remaining) .lock("FOR UPDATE SKIP LOCKED") .to_a batch + top_up end |
.lookup_policy(policy_name) ⇒ Object
252 253 254 255 256 |
# File 'lib/dispatch_policy/tick.rb', line 252 def self.lookup_policy(policy_name) job_class = DispatchPolicy.registry[policy_name] || autoload_job_for(policy_name) return nil unless job_class job_class.resolved_dispatch_policy end |
.prune_idle_partitions ⇒ Object
54 55 56 57 58 59 60 61 |
# File 'lib/dispatch_policy/tick.rb', line 54 def self.prune_idle_partitions ttl = DispatchPolicy.config.partition_idle_ttl return if ttl.nil? || ttl <= 0 cutoff = Time.current - ttl PartitionInflightCount.where(in_flight: 0).where("updated_at < ?", cutoff).delete_all ThrottleBucket.where("tokens <= ? AND refilled_at < ?", THROTTLE_ZERO_THRESHOLD, cutoff).delete_all end |
.prune_orphan_gate_rows ⇒ Object
63 64 65 66 67 68 69 70 71 72 |
# File 'lib/dispatch_policy/tick.rb', line 63 def self.prune_orphan_gate_rows [ PartitionInflightCount, ThrottleBucket ].each do |model| model.distinct.pluck(:policy_name, :gate_name).each do |policy_name, gate_name| policy = lookup_policy(policy_name) next if policy && policy.gates.any? { |g| g.name == gate_name.to_sym } model.where(policy_name: policy_name, gate_name: gate_name).delete_all end end end |
.reap ⇒ Object
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 |
# File 'lib/dispatch_policy/tick.rb', line 74 def self.reap StagedJob.expired_leases.find_each do |staged| (staged.partitions || {}).each do |gate_name, partition_key| policy = lookup_policy(staged.policy_name) gate = policy&.gates&.find { |g| g.name == gate_name.to_sym } next unless gate&.tracks_inflight? PartitionInflightCount.decrement( policy_name: staged.policy_name, gate_name: gate_name.to_s, partition_key: partition_key.to_s ) end staged.update!(lease_expires_at: nil, completed_at: Time.current) end end |
.release(policy_name:, partitions:) ⇒ Object
91 92 93 94 95 96 97 98 99 100 101 102 103 |
# File 'lib/dispatch_policy/tick.rb', line 91 def self.release(policy_name:, partitions:) partitions.each do |gate_name, partition_key| policy = lookup_policy(policy_name) gate = policy&.gates&.find { |g| g.name == gate_name.to_sym } next unless gate&.tracks_inflight? PartitionInflightCount.decrement( policy_name: policy_name, gate_name: gate_name.to_s, partition_key: partition_key.to_s ) end end |
.revert_admission(staged) ⇒ Object
290 291 292 293 294 295 296 297 298 299 |
# File 'lib/dispatch_policy/tick.rb', line 290 def self.revert_admission(staged) partitions = staged.partitions || {} release(policy_name: staged.policy_name, partitions: partitions) staged.update_columns( admitted_at: nil, lease_expires_at: nil, active_job_id: nil, partitions: {} ) end |
.run(policy_name: nil) ⇒ Object
Single admission pass: fetch pending staged jobs per policy, evaluate gates, mark survivors as admitted, then enqueue them on the real backend outside the locking transaction.
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 |
# File 'lib/dispatch_policy/tick.rb', line 10 def self.run(policy_name: nil) return 0 unless DispatchPolicy.enabled? pending_enqueue = [] StagedJob.transaction do active_policies(policy_name).each do |pname| policy = lookup_policy(pname) next unless policy batch = fetch_batch(policy) next if batch.empty? pending_enqueue.concat(run_policy(policy, batch)) end end admitted_count = 0 pending_enqueue.each do |staged, job| begin job.enqueue(_bypass_staging: true) # ActiveJob adapters report a polite failure by setting # enqueue_error and leaving successfully_enqueued? false # instead of raising. Without this check the staged row # would stay marked admitted while the adapter never queued # the job — losing it silently. if job.successfully_enqueued? admitted_count += 1 else Rails.logger&.warn( "[DispatchPolicy] adapter did not enqueue staged=#{staged.id}: " \ "#{job.enqueue_error&.class}: #{job.enqueue_error&.}" ) revert_admission(staged) end rescue StandardError => e Rails.logger&.error("[DispatchPolicy] enqueue failed staged=#{staged.id}: #{e.class}: #{e.}") revert_admission(staged) end end admitted_count end |
.run_policy(policy, batch) ⇒ Object
264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 |
# File 'lib/dispatch_policy/tick.rb', line 264 def self.run_policy(policy, batch) context = DispatchContext.new(policy: policy, batch: batch) survivors = batch policy.gates.each do |gate| survivors = gate.filter(survivors, context) end survivors.map do |staged| partitions = context.partitions_for(staged) partitions.each do |gate_name, partition_key| gate = policy.gates.find { |g| g.name == gate_name.to_sym } next unless gate&.tracks_inflight? PartitionInflightCount.increment( policy_name: policy.name, gate_name: gate_name.to_s, partition_key: partition_key.to_s ) end job = staged.mark_admitted!(partitions: partitions) [ staged, job ] end end |