Distributed workload placement algorithm traverses network nodes upstream/downstream, aggregating link metrics to find minimum-cost node for data processing tasks.

Patentradars sammanfattning

This invention describes a network-aware workload placement protocol in which a placement request, carrying an aggregated link metric, propagates through network nodes to identify the optimal host for a new data processing workload. Starting from an originating node, the algorithm evaluates upstream nodes against a forwarding condition and compute requirements, recursively transmitting placement requests and collecting placement responses. The node with minimum cumulative cost across all candidates is ultimately selected and the workload is instantiated there, enabling distributed, topology-aware scheduling without centralized orchestration.

AI-genererad och redaktionellt processad.