Scheduling software jobs having dependencies

This invention describes a system for automatically scheduling software tasks, called jobs, by understanding their relationships. It works by looking at a job's definition to figure out what other data or tasks it relies on, especially if those data structures can change. The system can also identify when a job needs to run at a specific time or within a certain period, all without needing extra input from a user.

Why it matters: The proliferation of microservices and data pipelines since 2018 has amplified the need for automated dependency management. Advances in static code analysis and AI-driven code understanding could now make the automatic identification of mutable data structure dependencies, as claimed, more practical and scalable.

Status: Not in forceListed as no longer active. The specific reason is not in the record we hold.
How hard to build: SpecializedSoftware logic, complex scheduling algorithms, data structure analysis

3 AI reinvention directions for this patent

See all three

AI gives you a few directions you could take this. Pick one, and we check whether your version is different enough to patent, then write the filing.

Reinvent this with AI

Where this one came from

Every morning we go through millions of abandoned patents and pick out 15 worth your time. This was one of today’s.

This one

+10