Abstract
Scheduling periodic tasks across distributed systems can present challenges, as methods relying on central coordinators or inter-node communication for scheduling decisions may introduce performance bottlenecks and single points of failure. The disclosed technology describes a system where independent nodes can deterministically select a task executor without requiring direct communication for the selection decision. Each node can compute a stabilized timestamp from a synchronized clock, combine it with a task-specific value to create a seed, and use the seed with a deterministic pseudo-random number generator to select an executor from a shared list. This approach can facilitate coordinated, probabilistic task execution that may be resilient to network partitions, can reduce communication overhead, and can provide randomization to help avoid misleading diagnostic patterns that could arise from predictable scheduling.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Pingenot, Joseph, "Communication-Free Distributed Task Scheduling Using Stabilized Time", Technical Disclosure Commons, ()
https://www.tdcommons.org/dpubs_series/9425