Invention Grant
US08881154B2 Complex dependency graph with bottom-up constraint matching for batch processing
有权
用于批处理的自下而上约束匹配的复杂依赖图
- Patent Title: Complex dependency graph with bottom-up constraint matching for batch processing
- Patent Title (中): 用于批处理的自下而上约束匹配的复杂依赖图
-
Application No.: US12340742Application Date: 2008-12-22
-
Publication No.: US08881154B2Publication Date: 2014-11-04
- Inventor: Gustavo A. Plancarte , Tao Wang , Vijay B. Kurup
- Applicant: Gustavo A. Plancarte , Tao Wang , Vijay B. Kurup
- Applicant Address: US WA Redmond
- Assignee: Microsoft Corporation
- Current Assignee: Microsoft Corporation
- Current Assignee Address: US WA Redmond
- Agent Damon Rieth; Brian Haslam; Micky Minhas
- Main IPC: G06F9/455
- IPC: G06F9/455 ; G06F9/46 ; G06F9/48

Abstract:
Architecture that includes a batch framework engine incorporated into the server and that supports a rich set of dependencies between tasks in a single batch job. A bottom-up approach is employed where analysis is performed if a task can run based on the parent tasks. The framework runs batch jobs without the need of a client, and provides the ability to create dependencies between tasks, which allow the execution of tasks in parallel or in sequence. Using an AND/OR relationship engine, a task can require that all parent tasks (logical AND) meet requirements to run, or that only one parent (logical OR) is required to meet its requirements in order to run. Clean-up or non-important tasks can have the a flag set where even if such tasks fail when executing, the batch job will ignore these tasks when defining the final status of the job.
Public/Granted literature
- US20100162248A1 COMPLEX DEPENDENCY GRAPH WITH BOTTOM-UP CONSTRAINT MATCHING FOR BATCH PROCESSING Public/Granted day:2010-06-24
Information query