142 results about "Task dependency" patented technology

An apparatus, system, and method are disclosed for present project scheduling information in combination with workflow information. The apparatus includes a worksheet pane configured to present a worksheet with task entries for the project, a workflow pane configured to overlay representations of timing, workflow, and dependencies in the project, and a mini map pane illustrating the scope of the workflow pane relative to an overall view of the project. The workflow pane includes a date list, a plurality of task icons, and a plurality of task dependency icons. Beneficially, such an apparatus, system, and method would enable a user to efficiently understand the status of a project and manipulate elements of the project.

One embodiment of the present disclosure sets forth a technique for enforcing cross stream dependencies in a parallel processing subsystem such as a graphics processing unit. The technique involves queuing waiting events to create cross stream dependencies and signaling events to indicated completion to the waiting events. A scheduler kernel examines a task status data structure from a corresponding stream and updates dependency counts for tasks and events within the stream. When each task dependency for a waiting event is satisfied, an associated task may execute.

Embodiments include systems and methods for handling task dependencies in a runtime environment using dependence graphs. For example, a computer-implemented runtime engine includes runtime libraries configured to handle tasks and task dependencies. The task dependencies can be converted into data dependencies. At runtime, as the runtime engine encounters tasks and associated data dependencies, it can add those identified tasks as nodes of a dependence graph, and can add edges between the nodes that correspond to the data dependencies without deadlock. The runtime engine can schedule the tasks for execution according to a topological traversal of the dependence graph in a manner that preserves task dependencies substantially as defined by the source code.

The invention discloses a pipeline parallelization method for coarse-grained streaming applications. The pipeline parallelization method includes performing classic data profiling and dependency analysis on serial C-codes to acquire a task dependence graph, performing dependence transformation on the task dependence graph to acquire a directed acyclic graph, building a system feature graph, performing task scheduling on the directed acyclic graph according to the system feature graph and judging whether a task scheduling result meets performance requirements or not, if not, then aggregating and splitting task of the directed acyclic graph to acquire a new directed acyclic graph, selecting and calculating the highest-cost task of the new directed acyclic graph to acquire a new calculated hot spot region, returning to performing the dependency analysis again, segmenting and modifying the serial C-codes according to the task scheduling result so as to obtain parallelized C-codes, encoding to generate parallel executable files through an encoder, and loading the parallel executable files to a target hardware platform to execute. The pipeline parallelization method is adaptable to multilayer nested loop structures and capable of extracting parallelism of the multilayer loop.

A processing apparatus includes task manager circuitry 14 issuing task specifiers to processing circuitry 16, 18, 20, 22, 24 indicating processing tasks to be performed. The task specifier includes a relaxed dependency identifier to which the processing circuitry is responsive. The processing circuitry responds to the relaxed dependency identifier by starting the processing task concerned and then controlling the processing task concerned in dependency upon the status of the other processing task upon which there is a relaxed dependency. The task specifier may also indicate a strict dependency in which a processing task may not be started until the other processing task has completed as well as a no dependency indication in which the processing task may be started without reference to any other processing task.

The invention discloses an ETL task dependence relationship detecting method and device. The method comprises the following steps: for each task of ETL, obtaining a data operating order contained in the task; analyzing the data operating order to obtaining a source table and a target table related to the task; according to the target table, a task attribute table and a task dependence relationship configuration table, obtaining a source table of direct dependence by the target table and a source table of indirect dependence by the target table; and traversing the source table related to the task, the source table of direct dependence and the source table of indirect dependence and marking the error types and optimizable types of all task dependence relationships related to the task according to a preset rule. With adoption of the method provided by the invention, actual task dependence relationships and a preset task dependence relationship are compared according to a preset rule so as to automatically discover erroneous and optimizable task dependence relationships, thus reducing the occurrence frequency of faults caused by task dependence problem, saving time for manual task dependence problem check by testing personnel and further achieving the effect of improving testing efficiency.

The invention provides a task scheduling management method, apparatus and system. According to a task dependency relationship, a superior task and a subordinate task of a current task are determined; an execution result of the subordinate task is obtained based on a preset rule; if all superior tasks are executed successfully, the current task is triggered for execution; when the current task is executed, the execution result of the current task is monitored; and if the current task is executed successfully, the subordinate task is triggered for loading. According to the invention, the superior task and the subordinate task of the current task are obtained based on the task dependency relationship; and the execution of the current task is triggered on the premise that the superior task is executed successfully. Therefore, independent execution of tasks and concurrent execution of tasks can be avoided and thus unified management of tasks can be realized. Meanwhile, spare time of tasks can be avoided and thus operation time spent in execution of all tasks can be saved, so that the execution efficiency of tasks can be improved.

The invention discloses a real-time task scheduling implementation method of a multi-core embedded system. The method comprises the following steps of establishing a real-time task set, calculating a task dependency relation sequence, establishing a task sequence so as to complete a time limit requirement sequence, processing an initial dispatching task and establishing a dispatching sequence. According to the technical scheme, the real-time task scheduling implementation method of the multi-core embedded system is suitable for task real-time scheduling of the multi-core embedded system, a plurality of processor cores of a multi-core processor are fully utilized, the task processing speed in the multi-core embedded system is increased, and the real-time performance of a real-time task is also guaranteed.

Embodiments in the disclosure are directed to the use of distributed computing to align reads against multiple portions of a reference dataset. Aligned portions of the reference dataset that correspond with an above-threshold alignment score can be assessed for the presence of sparse indicators that can be categorized and used to influence a determination of a state transition likelihood. Various tasks associated with the processing of reads (e.g., alignment, sparse indicator detection, and/or determination of a state transition likelihood) may be able to take advantage of parallel processing and can be distributed among the machines while considering the resource utilization of those machines. Different load-balancing mechanisms can be employed in order to achieve even resource utilization across the machines, and in some cases may involve assessing various processing characteristics that reflect a predicted resource expenditure and/or time profile for each task to be processed by a machine.

The invention discloses a multi-stage network plan based schedule calculation method and implementation of the method. The method is characterized in that schedule calculation usually comprises four steps of forward calculation, reverse calculation, final calculation and critical path calculation to obtain the earliest starting and ending time, the latest starting and ending time, the starting and ending time of each task, key tasks are obtained according to definitions of key tasks, and paths formed by the key tasks are key paths. The method which comprises the task dependence relation and the task limit type constraint and the method description capable of being achieve by computer software easily aim at solving the technical problems of computer software programming schedule plans and scheduling optimization.

The name of the invention is: optimal incremental workflow execution allowing meta-programming. A workflow is described and subsequently constructed by a general-purpose program. Among other things, such construction enables meta-programming to be employed. Further, workflow item and task dependencies can be explicitly expressed in the workflow and utilized to, among other things, optimize workflow execution for one or more factors. For instance, dependency information can be employed with respect to scheduling concurrent execution of tasks as well as to confine re-execution, upon workflow or item changes, to tasks affected by the changes. In addition, messages pertaining to workflow processing can be typed to facilitate logging in a structured and easily comprehensible manner.

The object of the present invention is to decrease the effort and cost involved in managing a product development project. Provided is an information processing system comprising a specific task list acquiring section that acquires a specific task list in which at least one of a requirement that is needed for a product being developed and a component included in the product being developed is associated with each of a plurality of specific tasks; a requirement/component dependency relationship information acquiring section that acquires requirement/component dependency relationship information indicating dependency relationships of the requirements and the components indicated by the specific task list; an integrated task dependency relationship calculating section that calculates dependency relationships of the specific tasks based on the requirement/component dependency relationship information; and an integrated task dependency relationship information generating section that generates integrated task dependency relationship information indicating the dependency relationships of the specific tasks.

A software user interface applicable to project tracking software and a method of use thereof is disclosed that enables entry of dependencies and relative deadlines for sub-tasks of projects. Dependency indicators specify dependencies of sub-tasks on the project start time or on completion times of other sub-tasks, and duration indicators specify the timing of deadlines relative to those time events. A plurality of deadlines can apply to the same sub-task so as to indicate thresholds of overdue urgency, and visual indications such as colors can be assigned to sub-tasks within the plurality to enable indications of overdue urgency in visual presentations of project status. Sub-task visual elements can be included that list and name the sub-tasks, and relate the sub-tasks to dependency indicators. Permissions can be entered that control the abilities of users to view and/or enter parameters. The method can operate over a network or the internet.

The invention relates to a task tree-based large scale remote-sensing image parallel embedding method, which comprising the following steps: 1) constructing an embedding task tree based on an abutting relation and a recursion task division, and constructing an embedding task tree according to the constructing method of a balance binary tree; 2) expressing a DAG (directed acyclic graph) model of the embedding task tree; 3) dynamically dispatching the embedding task tree based on CPDS-SQ (a dynamic DAG dispatching strategy based on a core path and a state queue); and 4) parallel processing a plurality of embedding tasks. The method has the following benefits: the data dependency relationship of a series of embedding tasks is decoupled from the MPI-based (message passing interface) parallel embedding realization process and is dispatched by the dynamic task tree for task dependency relationship control, so that the parallel control logic and parallel realization of the parallel embedding process can be greatly simplified, and the parallelism of large scale embedding is explored to the maximum extent to greatly improve the treatment performance and expansibility of large-scale embedding.

The invention discloses an optimization method and device for task scheduling based on metadata. The method includes: obtaining metadata information; acquiring a task dependency graph, wherein the task dependency graph is a directed acyclic graph; according to the metadata information and the task dependency graph, determining a task that meets a first preset condition, wherein the first preset condition is that it is only necessary to rely on some of the tasks in the pre-task of the task when running the task; and optimizing the task that meets the first preset condition.

The embodiment of the invention discloses a task processing method and device and a computer storage medium, and the method comprises the steps: receiving a to-be-processed task, and determining whether the task has a task dependency relationship or not, the task dependency relationship refers to the relationship of mutual influence among tasks, and the task comprises attribute information of thetask; and when the task does not have the task dependency relationship, allocating idle kernel resources to the task according to the attribute information of the task so as to process the task by utilizing the kernel resources. By adopting the embodiment of the invention, the related scheduling processing problem of the task with the task dependency relationship can be effectively solved, and thetransmission delay of the task is reduced, so that the task processing efficiency is improved.

A specification of a graphical representation of task dependency has a plurality of task elements each associated with a different task, a resource element having a plurality of attachment locations, and linking elements coupling the task elements to the resource element at the plurality of associated attachment locations. Associations of task elements to attachment locations on the resource element specify an ordering constraint on the tasks associated with the task elements. The tasks are executed according to the graphical representation of task dependency.

The invention relates to the technical field of data processing, in particular to an application program starting method, which comprises the steps of obtaining a to-be-initialized task required whena target application program is started and a task attribute corresponding to the to-be-initialized task; constructing a task dependence tree according to the to-be-initialized task and the task attribute; determining at least one target task in the task dependence tree; and running the task dependency tree, and starting first frame drawing after running of the target task is finished so as to display a first frame page of the target application program. According to the technical scheme provided by the embodiment of the invention, on one hand, the function of supporting mutual waiting among different task chain nodes can be realized, so that the time required before drawing the first frame of the application program interface is shortened; and on the other hand, the complex dependency relationship between the to-be-initialized tasks can be processed through the tree structure of the task dependency tree, so that the purpose of shortening the time required before the first frame of theapplication program interface is drawn can be achieved.