code wiki / _hdl_build / nx_nomad_schedule_test.nx
nx_nomad_schedule_test.nx
buildroot/runtime/_hdl_build/nx_nomad_schedule_test.nx
about
nx_nomad_schedule_test.nx -- NOMADGATE: proves the sovereign bin-pack scheduler. 3 nodes free:
n0=(cpu4,mem4) n1=(cpu8,mem8) n2=(cpu2,mem2). GREEN iff: a (cpu2,mem2) job bin-packs to the TIGHTEST
feasible node (n2, leftover 0) not the roomiest; capacity is decremented on alloc; the next job re-bin-packs
on updated capacity; a job bigger than every node is UNPLACEABLE (no overcommit); a job needing more mem
than a cpu-OK node is rejected there (both dims checked); a cluster filled exactly leaves 0 and the next
job is rejected (conservation). exit 0 on 7/7.
dependencies 2 imports · 0 importers
imports: nx_nomad_schedule.nxnx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 10 | func ng_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 11 | func ng_num(v: i64) -> i64 { let b: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m;sys_write(1,"-" as *u8,1)}; let t: *u8 = sys_mmap(28); var k: i64=0; if m==0 {t[0]=48;k=1}; while m>0 {t[k]=48+(m%10); m=m/10; k=k+1}; var i: i64=0; while i<k {b[i]=t[k-1-i]; i=i+1}; sys_write(1,b,k); return 0 } |
| 13 | func main() -> i64 |