Conditional Recurrent Schedule Management for Mobile Resource Conservation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Mobile computing devices face limitations in resources such as memory, storage, and battery life, and existing systems lack efficient mechanisms to manage recurring actions that require increasing levels of these resources, leading to inefficiencies and potential resource starvation.
Innovation Solution
A scheduler service that manages conditional recurrent schedules based on event notifications, executing actions only when defined activation conditions are met, thereby optimizing resource usage and preventing frequent execution of schedules.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If recurring actions are executed frequently to ensure timely processing, then productivity is improved, but resource consumption increases and device lifespan decreases
Solution Approach 1:
The patent implements periodic action by establishing recurrent schedules that execute actions at defined intervals rather than continuously. The scheduler service monitors activation times and conditions, triggering actions only when the periodic interval is reached and conditions are met, thereby reducing resource consumption while maintaining timely processing of recurring tasks.
Solution Approach 2:
The patent applies feedback by implementing condition monitoring mechanisms that continuously assess system state before executing recurring actions. The scheduler service evaluates activation conditions (such as device state, resource availability, or external events) before triggering scheduled actions, ensuring actions are executed only when appropriate, thus optimizing resource usage while maintaining productivity.
2Productivity
If resource usage is increased to handle multiple recurring actions, then productivity is improved, but device lifespan deteriorates
Solution Approach 1:
The patent reduces device lifespan degradation by implementing periodic execution of recurring actions through a scheduler service. Instead of continuously consuming resources, actions are executed at defined intervals based on activation times and conditions, significantly reducing cumulative resource usage and extending device operational life while maintaining the ability to handle multiple recurring tasks.
Solution Approach 2:
The patent applies partial action by executing only the necessary portion of recurring actions when conditions permit. The scheduler service evaluates activation conditions and may skip or delay certain actions if conditions are not met, rather than forcing execution. This approach maintains productivity for critical actions while reducing overall resource consumption to extend device lifespan.
3Adaptability or versatility
If per-application notification mechanisms are used to trigger actions, then adaptability is improved, but device complexity increases
Solution Approach 1:
The patent reduces device complexity by implementing a universal scheduler service that handles recurring actions for multiple applications through a single centralized mechanism. Instead of each application implementing its own notification and scheduling logic, the scheduler service provides a unified platform that manages activation times, conditions, and action execution for all applications, thereby maintaining adaptability while simplifying the overall system architecture.
Solution Approach 2:
The patent introduces an intermediary scheduler service that mediates between applications and the execution engine. The scheduler service receives scheduling parameters from applications, monitors system state, and triggers actions when conditions are met, acting as a buffer that simplifies application code while maintaining adaptability. Applications only need to define their recurring actions and conditions, leaving the complex scheduling and monitoring logic to the intermediary scheduler service.
Data Source
AI summary
Managing recurrent schedules based on events and conditions. Schedules from a plurality of applications are identified based on an activation time for the schedules and a determination of whether or not conditions defined for the schedules are met. The identified schedules are activated by performing actions associated with each of the identified schedules. In an embodiment, the schedules are grouped based on functionality and prioritized to avoid conflicts within each group.


