Pronto: Federated Task Scheduling
Andreas Grammenos, Evangelia Kalyvianaki, Peter Pietzuch

TL;DR
This paper introduces Pronto, a federated, asynchronous task scheduling algorithm for large-scale networks that uses local models and rejection signals to improve scheduling efficiency and resource utilization.
Contribution
Pronto is the first federated, memory-limited, asynchronous scheduling algorithm that enables independent node decisions and global system insights in large-scale networks.
Findings
Achieves state-of-the-art performance with limited memory.
Predicts system responsiveness using CPU-Ready metric.
Exhibits scalable performance without communication latency.
Abstract
We present a federated, asynchronous, memory-limited algorithm for online task scheduling across large-scale networks of hundreds of workers. This is achieved through recent advancements in federated edge computing that unlocks the ability to incrementally compute local model updates within each node separately. This local model is then used along with incoming data to generate a rejection signal which reflects the overall node responsiveness and if it is able to accept an incoming task without resulting in degraded performance. Through this innovation, we allow each node to execute scheduling decisions on whether to accept an incoming job independently based on the workload seen thus far. Further, using the aggregate of the iterates a global view of the system can be constructed, as needed, and could be used to produce a holistic perspective of the system. We complement our findings,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Stochastic Gradient Optimization Techniques · IoT and Edge/Fog Computing
