scispace - formally typeset
Search or ask a question
Topic

Task (computing)

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


Papers
More filters
Journal ArticleDOI
01 Jun 2000
TL;DR: This paper considers an approach to operator-guided real time motion control of robot arm manipulators that's based on the use of configuration space (C-space), and results in a significant improvement in performance: shorter path, less time to complete the task, and virtually no arm-obstacle collisions.
Abstract: This paper considers an approach to operator-guided real time motion control of robot arm manipulators that's based on the use of configuration space (C-space). The goal is to improve operator performance in a complex environment with obstacles, In such tasks, traditional teleoperation techniques, which are all based on control in work space (W-space), suffer from human errors tied to deficiencies in human spatial reasoning. The C-space approach transforms the problem into one humans are much better equipped to handle-moving a point in a maze-and results in a significant improvement in performance: shorter path, less time to complete the task, and virtually no arm-obstacle collisions. Versions of the approach are described for two-dimensional (2-D) and three-dimensional (3-D) tasks, and tools are developed to efficiently interface the human and machine intelligence. Effectiveness of the C-space approach is demonstrated by a series of experiments, showing an improvement in performance on the order of magnitude in the 2-D case and a factor of two to four in the 3-D case, compared to usual work space control.

34 citations

Book ChapterDOI
26 Aug 2008
TL;DR: This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the work-stealing technique with both theoretical and experimental results bounding the work/running time.
Abstract: This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the work-stealing technique. Unlike previous approaches where a deque for each processor is typically used to locally store ready tasks and where a processor that runs out of work steals a ready task from the deque of a randomly selected processor, the current paper instead presents an original implementation of work-stealing without using any deque but a distributed list in order to bound overhead for task creations. The paper contains both theoretical and experimental results bounding the work/running time.

34 citations

Patent
Christopher G. Kaler1
29 Sep 2006
TL;DR: In this paper, a method for multiple peer groups for performing computing, communication, and/or storage tasks is presented, where each peer group is configured to perform a specific operation.
Abstract: Multiple peer groups for performing computing, communication, and/or storage tasks. A method may be performed for example, in a computing environment including one or more agents networked together. The method includes providing data to the agents using two or more distinct peer groups. The peer groups include members from among the agents. The method further includes performing at each of the peer groups operations on the data. Each peer group is configured to perform a specific operation. The method also includes coordinating the operations at each of the peer groups such that a common computing, communication and/or storage task is accomplished by aggregating the operations at each of the peer groups.

34 citations

Proceedings Article
27 Jul 2014
TL;DR: In this paper, a task allocation algorithm that allows tasks to be easily sequenced to yield high-quality solutions is proposed, which is based on a Fisher market with agents as buyers and tasks as goods.
Abstract: Realistic multi-agent team applications often feature dynamic environments with soft deadlines that penalize late execution of tasks This puts a premium on quickly allocating tasks to agents, but finding the optimal allocation is NP-hard due to temporal and spatial constraints that require tasks to be executed sequentially by agents We propose FMC TA, a novel task allocation algorithm that allows tasks to be easily sequenced to yield high-quality solutions FMC_TA first finds allocations that are fair (envyfree), balancing the load and sharing important tasks between agents, and efficient (Pareto optimal) in a simplified version of the problem It computes such allocations in polynomial or pseudo-polynomial time (centrally or distributedly, respectively) using a Fisher market with agents as buyers and tasks as goods It then heuristically schedules the allocations, taking into account inter-agent constraints on shared tasks We empirically compare our algorithm to state-of-the-art incomplete methods, both centralized and distributed, on law enforcement problems inspired by real police logs The results show a clear advantage for FMC TA both in total utility and in other measures commonly used by law enforcement authorities

34 citations

Patent
17 Dec 2010
TL;DR: In this paper, a method for receiving a work flow for the ingestion, transformation, and distribution of content, wherein the work flow includes one or more work unit tasks, selecting one of the ones or more tasks for execution when resources are available, retrieving work unit task information that includes a work unit definition that specifies which tasks are capable of being at least one of an input to the one task or output for the other task.
Abstract: A method including receiving a work flow for the ingestion, transformation, and distribution of content, wherein the work flow includes one or more work unit tasks; selecting one of the one or more work unit tasks for execution when resources are available; retrieving work unit task information that includes a work unit definition that specifies which of the one or more other work unit tasks are capable of being at least one of an input to the one of the one or more work unit tasks or an output for the one of the one or more work unit tasks, and work unit task connector parameters that specify a type of input content and a type of output content; and executing the one of the one or more work unit tasks based on a translated work unit task information.

34 citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202210
2021695
2020712
2019784
2018721
2017565