Task (computing)

About: Task (computing) is a research topic. Over the lifetime, 9718 publications have been published within this topic receiving 129364 citations.

Process automation method and apparatus

Abstract: The invention provides in one aspect a method for generating a schedule for the performance of a process, wherein the process comprises a plurality of steps. Each step of the process comprises one or more operations. The method comprises first obtaining input containing information defining the process and then generating from the input a series of nodes definitions, each node definition corresponding to at least one step of the process. Each node definition includes duration and device usage information relating to at least one step and further includes information identifying at least one previous step and at least one subsequent step. Then, one or more tasks are generated using the series of node definitions, each task comprising at least one step of the process, such that every step in the process is associated with at least one task. Once the tasks are defined, a schedule of operations is generated using the generated tasks and the node definitions, said schedule of operations corresponding to the defined process. In a preferred embodiment, the method of the present invention employs a graphical user interface to obtain the input. Also, preferably, the graphical user interface consists of icons representative of operations that may be performed on the work sample.

Decentralized cooperative auction for multiple agent task allocation using synchronized random number generators

Abstract: A collection of agents, faced with multiple tasks to perform, must effectively map agents to tasks in order to perform the tasks quickly with limited wasted resources. We propose a decentralized control algorithm based on synchronized random number generators to enact a cooperative task auction among the agents. The algorithm finds probabilistically reasonable solutions in few rounds of bidding. Additionally, as the length of the auction increases, the expectation of a better solution increases. This algorithm is not intended to find the optimal solution; it finds a good solution with less computation and communication.

Debugging multiple threads or processes

Abstract: Debugging multiple tasks, using a single instance of a debugger application intended to be only capable of debugging a single task, is performed by intercepting system calls made by the debugger application to the operating system. The intercepted system calls are directed to an appropriate task, which is one amongst the multiple tasks to be debugged.

Method for balancing the utilization of input/output devices

Abstract: During the operation of a data processing system capable of multi-tasking, a count is made of the number of times each I/O device is accessed by each task. The counting is done over the time interval between successive allocation routines. During each allocation, an analysis is made using the count and time interval to estimate the utilization of each device due to the current tasks. An estimate is also made of the anticipated utilization due to the task undergoing allocation. The estimated current and anticipated utilization are then considered and an attempt is made to allocate data sets to the least utilized I/O devices so as to achieve balanced I/O activity.

System and method for modifying execution of scripts for a job scheduler using deontic logic

Abstract: A system and method for modifying execution scripts associated with a job scheduler may include monitoring for the execution of a task to determine when the task has failed. Details of the failed task may be identified and used to attempt recovery from the task failure. After initiating any recovery tasks, execution of the recovery tasks may be monitored, and one or more supplementary recovery tasks may be identified and executed, or the original task may be rerun at an appropriate execution point based on the initial point of failure. Thus, when a task has failed, an iterative process may begin where various effects of the failed task are attempted to be rolled back, and depending on the success of the rollback, the initial task can be rerun at the point of failure, or further recovery tasks may be executed.