首页>
外国专利>
Dynamic scheduling feasibility analysis of event-driven applications based on reducing tasks of overlapping events
Dynamic scheduling feasibility analysis of event-driven applications based on reducing tasks of overlapping events
展开▼
机译：基于减少重叠事件的任务的事件驱动应用程序的动态调度可行性分析
展开▼
页面导航
摘要
著录项
相似文献
摘要
Embodiments of the present invention provide a method, system and computer program product for dynamic feasibility analysis of event-driven program code. In an embodiment of the invention, a method for a dynamic feasibility analysis of event-driven program code can be provided. The method can include loading multiple different tasks associated with different registered events in event-driven program code of an event-driven application, reducing overlapping ones of the registered events for different ones of the tasks to a single task of the overlapping events to produce a reduced set of tasks and corresponding events, ordering the corresponding events of the reduced set of tasks and grouping the corresponding events by time slice for the event-driven application, and reporting whether or not adding a new event to a particular time slice for the event-driven application results in a depth of events in the particular time slice exceeding a capacity of the particular time slice rendering the event-driven application infeasible.
展开▼
