The expected change will be prioritized message and forward to the correct (latency-aware and no-bp based on scoring function) places.
Some improvement can be concerned in the future under our context,
- Lock-free work stealing
- Decentralized priority scheduling based on work-stealing. In the case, the priority is counted via scoring function, and also provide a lock-free under a similar approach to multi-level queue scheduling.
Reference: Load Balancing Prioritized Tasks via Work-Stealing
The expected change will be prioritized message and forward to the correct (latency-aware and no-bp based on scoring function) places.
Construct fields of latency sensitive slot in publish message. Potential message might embed with header or in payload.
Mix priority factors into scoring function.
Some improvement can be concerned in the future under our context,
Reference: Load Balancing Prioritized Tasks via Work-Stealing