1
2
3
4
5
6
7
8
9
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
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
181
182
183
184
185
186
187
188
189
190
191
192
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
251
252
253
254
255
256
257
258
259
260
261
262
263
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
//! Resident task queue ABI for pause, resume, requeue, and priority aging.
use vyre_driver::backend::BackendError;
use super::planner::MegakernelWorkItem;
use super::policy::MegakernelLaunchRequest;
/// Number of `u32` words in one continuation task slot.
pub const TASK_SLOT_WORDS: usize = 16;
/// Number of bytes in one continuation task slot.
pub const TASK_SLOT_BYTES: usize = TASK_SLOT_WORDS * core::mem::size_of::<u32>();
/// Lowest flag bit set when a task voluntarily paused at a continuation point.
pub const TASK_FLAG_PAUSED: u32 = 1 << 0;
/// Flag bit set when a task yielded so another task can run on the same worker.
pub const TASK_FLAG_YIELDED: u32 = 1 << 1;
/// Flag bit set when a task asked the scheduler to publish it again.
pub const TASK_FLAG_REQUEUE_REQUESTED: u32 = 1 << 2;
/// Flag bit set when a paused task is eligible to resume.
pub const TASK_FLAG_RESUME_READY: u32 = 1 << 3;
/// GPU-visible lifecycle state for one continuation task slot.
#[repr(u32)]
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum TaskState {
/// Slot is empty and may be reused.
Empty = 0,
/// Slot is published and may be claimed by a GPU worker.
Ready = 1,
/// Slot is currently owned by a GPU worker.
Running = 2,
/// Slot finished successfully.
Done = 3,
/// Slot is paused until an external device-visible condition is met.
Paused = 4,
/// Slot yielded voluntarily and should remain schedulable.
Yielded = 5,
/// Slot should be placed back into its priority partition.
Requeued = 6,
/// Slot faulted and must not be executed again without repair.
Faulted = 7,
}
impl TaskState {
/// Decode a raw ABI word into a task state.
#[must_use]
pub const fn from_word(word: u32) -> Option<Self> {
match word {
0 => Some(Self::Empty),
1 => Some(Self::Ready),
2 => Some(Self::Running),
3 => Some(Self::Done),
4 => Some(Self::Paused),
5 => Some(Self::Yielded),
6 => Some(Self::Requeued),
7 => Some(Self::Faulted),
_ => None,
}
}
/// Encode this state as the raw ABI word written by the GPU scheduler.
#[must_use]
pub const fn word(self) -> u32 {
self as u32
}
/// Return true when this state is eligible for GPU scheduling.
#[must_use]
pub const fn is_schedulable(self) -> bool {
matches!(self, Self::Ready | Self::Yielded | Self::Requeued)
}
}
/// Priority partition for a continuation task slot.
#[repr(u32)]
#[derive(Debug, Clone, Copy, Default, PartialEq, Eq, PartialOrd, Ord)]
pub enum TaskPriority {
/// Highest priority partition for latency-critical work.
Critical = 0,
/// High priority partition for urgent work.
High = 1,
/// Default priority partition.
#[default]
Normal = 2,
/// Low priority partition for background work.
Low = 3,
/// Idle partition processed only when higher priorities are empty.
Idle = 4,
}
impl TaskPriority {
/// Decode a raw ABI word into a task priority.
#[must_use]
pub const fn from_word(word: u32) -> Option<Self> {
match word {
0 => Some(Self::Critical),
1 => Some(Self::High),
2 => Some(Self::Normal),
3 => Some(Self::Low),
4 => Some(Self::Idle),
_ => None,
}
}
/// Encode this priority as the raw ABI word used by the priority scheduler.
#[must_use]
pub const fn word(self) -> u32 {
self as u32
}
}
/// One device-visible continuation task slot.
///
/// The first four words match the persistent ring header:
/// status, opcode, tenant, priority. The remaining twelve words are the slot
/// payload. Words 4..6 preserve the legacy [`MegakernelWorkItem`] payload; words 7..15
/// carry continuation and scheduler state.
#[repr(C)]
#[derive(Debug, Clone, Copy, PartialEq, Eq, bytemuck::Pod, bytemuck::Zeroable)]
pub struct TaskWorkItem {
/// Raw [`TaskState`] word.
pub state: u32,
/// Stable op id index into the dialect registry.
pub op_handle: u32,
/// Tenant id checked by the runtime scheduler.
pub tenant_id: u32,
/// Raw [`TaskPriority`] word.
pub priority: u32,
/// Input-buffer handle.
pub input_handle: u32,
/// Output-buffer handle.
pub output_handle: u32,
/// Per-item parameter word.
pub param: u32,
/// Program counter or block id where the worker should resume.
pub continuation_pc: u32,
/// Opaque continuation-local scratch word.
pub continuation_data: u32,
/// Device-visible epoch at which the task may resume.
pub resume_epoch: u32,
/// Stable task id used to join yielded/requeued continuations.
pub task_id: u32,
/// Parent task id for split or fan-out work; zero when absent.
pub parent_task_id: u32,
/// Scheduler age ticks accumulated while waiting.
pub age_ticks: u32,
/// Number of times this task has been requeued.
pub requeue_count: u32,
/// Number of times this task has yielded.
pub yield_count: u32,
/// Bitset of `TASK_FLAG_*` continuation flags.
pub flags: u32,
}
impl TaskWorkItem {
/// Construct a ready continuation task from the compact legacy work item.
#[must_use]
pub const fn from_work_item(
task_id: u32,
tenant_id: u32,
priority: TaskPriority,
item: MegakernelWorkItem,
) -> Self {
Self {
state: TaskState::Ready.word(),
op_handle: item.op_handle,
tenant_id,
priority: priority.word(),
input_handle: item.input_handle,
output_handle: item.output_handle,
param: item.param,
continuation_pc: 0,
continuation_data: 0,
resume_epoch: 0,
task_id,
parent_task_id: 0,
age_ticks: 0,
requeue_count: 0,
yield_count: 0,
flags: 0,
}
}
/// Return the compact legacy work item payload carried by this task.
#[must_use]
pub const fn work_item(&self) -> MegakernelWorkItem {
MegakernelWorkItem {
op_handle: self.op_handle,
input_handle: self.input_handle,
output_handle: self.output_handle,
param: self.param,
}
}
/// Decode the task state word.
#[must_use]
pub const fn task_state(&self) -> Option<TaskState> {
TaskState::from_word(self.state)
}
/// Decode the task priority word.
#[must_use]
pub const fn task_priority(&self) -> Option<TaskPriority> {
TaskPriority::from_word(self.priority)
}
/// Return true when the task is eligible to be claimed by a worker.
#[must_use]
pub const fn is_schedulable(&self) -> bool {
match self.task_state() {
Some(state) => state.is_schedulable(),
None => false,
}
}
/// Encode a pause at `continuation_pc` until `resume_epoch`.
#[must_use]
pub const fn paused(
mut self,
continuation_pc: u32,
continuation_data: u32,
resume_epoch: u32,
) -> Self {
self.state = TaskState::Paused.word();
self.continuation_pc = continuation_pc;
self.continuation_data = continuation_data;
self.resume_epoch = resume_epoch;
self.flags = (self.flags | TASK_FLAG_PAUSED) & !TASK_FLAG_RESUME_READY;
self
}
/// Mark a paused task ready for GPU-side resume.
#[must_use]
pub const fn resumed(mut self) -> Self {
self.state = TaskState::Ready.word();
self.flags =
(self.flags | TASK_FLAG_RESUME_READY) & !(TASK_FLAG_PAUSED | TASK_FLAG_YIELDED);
self
}
/// Yield this task back to the scheduler at `continuation_pc`.
#[must_use]
pub const fn yielded(mut self, continuation_pc: u32, continuation_data: u32) -> Self {
self.state = TaskState::Yielded.word();
self.continuation_pc = continuation_pc;
self.continuation_data = continuation_data;
self.yield_count = match self.yield_count.checked_add(1) {
Some(value) => value,
None => panic!("megakernel task yield_count overflowed u32"),
};
self.flags |= TASK_FLAG_YIELDED;
self
}
/// Requeue this task, optionally changing its priority partition.
#[must_use]
pub const fn requeued(
mut self,
continuation_pc: u32,
continuation_data: u32,
priority: TaskPriority,
) -> Self {
self.state = TaskState::Requeued.word();
self.priority = priority.word();
self.continuation_pc = continuation_pc;
self.continuation_data = continuation_data;
self.requeue_count = match self.requeue_count.checked_add(1) {
Some(value) => value,
None => panic!("megakernel task requeue_count overflowed u32"),
};
self.age_ticks = match self.age_ticks.checked_add(1) {
Some(value) => value,
None => panic!("megakernel task age_ticks overflowed u32"),
};
self.flags |= TASK_FLAG_REQUEUE_REQUESTED;
self
}
/// Mark this task completed.
#[must_use]
pub const fn completed(mut self) -> Self {
self.state = TaskState::Done.word();
self.flags = 0;
self
}
/// Mark this task faulted with a compact fault code.
#[must_use]
pub const fn faulted(mut self, fault_code: u32) -> Self {
self.state = TaskState::Faulted.word();
self.continuation_data = fault_code;
self
}
}
/// Queue telemetry derived from device-visible continuation task slots.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Default)]
pub struct TaskQueueSnapshot {
/// Count of ready slots.
pub ready_count: u32,
/// Count of paused slots.
pub paused_count: u32,
/// Count of yielded slots.
pub yielded_count: u32,
/// Count of requeued slots.
pub requeued_count: u32,
/// Count of running slots.
pub running_count: u32,
/// Count of faulted slots.
pub faulted_count: u32,
/// Sum of per-slot requeue counters.
pub total_requeues: u64,
/// Maximum priority-aging tick observed in the queue.
pub max_priority_age: u32,
}
impl TaskQueueSnapshot {
/// Build a queue snapshot from continuation task slots.
///
/// # Errors
///
/// Returns [`BackendError`] when the slice contains an unknown task state or
/// a count cannot fit the u32 ABI.
pub fn from_tasks(tasks: &[TaskWorkItem]) -> Result<Self, BackendError> {
let mut snapshot = Self::default();
for task in tasks {
snapshot.max_priority_age = snapshot.max_priority_age.max(task.age_ticks);
snapshot.total_requeues = snapshot
.total_requeues
.checked_add(u64::from(task.requeue_count))
.ok_or_else(|| {
BackendError::new(
"megakernel task total_requeues overflowed u64. Fix: drain or shard the task ring before launch.",
)
})?;
match task.task_state() {
Some(TaskState::Empty | TaskState::Done) => {}
Some(TaskState::Ready) => checked_increment(&mut snapshot.ready_count)?,
Some(TaskState::Paused) => checked_increment(&mut snapshot.paused_count)?,
Some(TaskState::Yielded) => checked_increment(&mut snapshot.yielded_count)?,
Some(TaskState::Requeued) => checked_increment(&mut snapshot.requeued_count)?,
Some(TaskState::Running) => checked_increment(&mut snapshot.running_count)?,
Some(TaskState::Faulted) => checked_increment(&mut snapshot.faulted_count)?,
None => {
return Err(BackendError::new(format!(
"megakernel task slot has unknown state word {}. Fix: write a valid TaskState ABI word before publishing the slot.",
task.state
)));
}
}
}
Ok(snapshot)
}
/// Number of slots immediately eligible for GPU scheduling.
#[must_use]
pub fn schedulable_count(&self) -> u32 {
match self.try_schedulable_count() {
Ok(value) => value,
Err(error) => panic!("{error}"),
}
}
/// Checked number of slots immediately eligible for GPU scheduling.
///
/// # Errors
///
/// Returns [`BackendError`] when the summed schedulable count exceeds the
/// u32 launch ABI.
pub fn try_schedulable_count(&self) -> Result<u32, BackendError> {
self.ready_count
.checked_add(self.yielded_count)
.and_then(|value| value.checked_add(self.requeued_count))
.ok_or_else(|| {
BackendError::new(
"megakernel schedulable task count overflowed u32. Fix: shard the task ring before launch.",
)
})
}
/// Number of slots carrying continuation pressure.
#[must_use]
pub fn continuation_pressure_count(&self) -> u64 {
match self.try_continuation_pressure_count() {
Ok(value) => value,
Err(error) => panic!("{error}"),
}
}
/// Checked number of slots carrying continuation pressure.
///
/// # Errors
///
/// Returns [`BackendError`] when continuation pressure exceeds u64.
pub fn try_continuation_pressure_count(&self) -> Result<u64, BackendError> {
u64::from(self.yielded_count)
.checked_add(u64::from(self.requeued_count))
.and_then(|value| value.checked_add(self.total_requeues))
.ok_or_else(|| {
BackendError::new(
"megakernel continuation pressure overflowed u64. Fix: drain or shard the task ring before launch.",
)
})
}
/// Build a Program that runs a one-shot persistent fixpoint over
/// the queue snapshot's state-counter buffer, converging the
/// counts to a stable equilibrium representing the queue's
/// long-run distribution. Wires the self-substrate persistent
/// fixpoint builder for observability collectors that want stable
/// signals over transient queue jitter.
///
/// `current_buffer` / `next_buffer` / `changed_buffer` are
/// caller-supplied buffer names for the persistent_fixpoint
/// ping-pong; `transfer_body` is the per-iteration body that
/// reads `current` and writes `next`. Returns a Program suitable
/// for one dispatch.
///
/// P-RUNTIME-4: replaces a host-side jitter-smoothing loop with
/// a single GPU-side fixpoint dispatch.
#[must_use]
#[cfg(feature = "self-substrate-adapters")]
pub fn build_state_convergence_program(
transfer_body: Vec<vyre_foundation::ir::Node>,
current_buffer: &str,
next_buffer: &str,
changed_buffer: &str,
words: u32,
max_iterations: u32,
) -> vyre_foundation::ir::Program {
vyre_self_substrate::persistent_fixpoint_program::persistent_fixpoint_program(
transfer_body,
current_buffer,
next_buffer,
changed_buffer,
words,
max_iterations,
)
}
/// Merge this queue telemetry into a launch request.
#[must_use]
pub fn apply_to_launch_request(
&self,
mut request: MegakernelLaunchRequest,
) -> MegakernelLaunchRequest {
request = match self.try_apply_to_launch_request(request) {
Ok(request) => request,
Err(error) => panic!("{error}"),
};
request
}
/// Checked merge of queue telemetry into a launch request.
///
/// # Errors
///
/// Returns [`BackendError`] when schedulable count or continuation pressure
/// cannot fit the launch request ABI.
pub fn try_apply_to_launch_request(
&self,
mut request: MegakernelLaunchRequest,
) -> Result<MegakernelLaunchRequest, BackendError> {
request.queue_len = self.try_schedulable_count()?;
request.requeue_count = request
.requeue_count
.checked_add(self.try_continuation_pressure_count()?)
.ok_or_else(|| {
BackendError::new(
"megakernel launch request requeue_count overflowed u64. Fix: drain or shard the task ring before launch.",
)
})?;
request.max_priority_age = request.max_priority_age.max(self.max_priority_age);
Ok(request)
}
}
fn checked_increment(counter: &mut u32) -> Result<(), BackendError> {
*counter = counter.checked_add(1).ok_or_else(|| {
BackendError::new(
"megakernel task queue count exceeds u32::MAX. Fix: shard the task ring before launch.",
)
})?;
Ok(())
}
#[cfg(test)]
mod tests;