Node deadline mechanism based on process flow band
A process and node technology, applied in the field of automation, can solve problems such as incomprehension and lack of intuitive modeling methods, and achieve the effect of improving performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0016] exist image 3 In , a simple workflow graph based on the node deadline mechanism DAG representation of the process flow belt is shown. In the DAG graph, the activities located in the same path are executed serially, and the completion time is the sum of the execution time of all activities, and is subject to the priority multi-active page constraint. Therefore, if one of the activities chooses a lower-level service to execute, other activities will choose a higher-level service due to deadline constraints, that is, the service selection of these activities (essentially the time allocation for each activity) affects each other , which gives the following (1) Given G=(V, E), time-priority multiple active pages must be located on the same path. For j, the predecessor activity r is called j's forward time-priority multi-leaf activity; for r, the successor activity j is called r's backward time-priority multi-leaf activity. (2) Given G=(V, E), its maximum forward time prio...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com