Task (computing)

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

Optimized Stochastic Policies for Task Allocation in Swarms of Robots

Abstract: We present a scalable approach to dynamically allocating a swarm of homogeneous robots to multiple tasks, which are to be performed in parallel, following a desired distribution. We employ a decentralized strategy that requires no communication among robots. It is based on the development of a continuous abstraction of the swarm obtained by modeling population fractions and defining the task allocation problem as the selection of rates of robot ingress and egress to and from each task. These rates are used to determine probabilities that define stochastic control policies for individual robots, which, in turn, produce the desired collective behavior. We address the problem of computing rates to achieve fast redistribution of the swarm subject to constraint(s) on switching between tasks at equilibrium. We present several formulations of this optimization problem that vary in the precedence constraints between tasks and in their dependence on the initial robot distribution. We use each formulation to optimize the rates for a scenario with four tasks and compare the resulting control policies using a simulation in which 250 robots redistribute themselves among four buildings to survey the perimeters.

Instant Messaging and Interruption: Influence of Task Type on Performance

Abstract: We describe research on the effects of instant messaging (IM) on ongoing computing tasks. We present a study that builds on earlier work exploring the influence of sending notifications at different times and the kinds of tasks that are particularly susceptible to interruption. This work investigates alternative hypotheses about the nature of disruption for a list evaluation task, an activity we had identified as being particularly costly to interrupt. Our findings replicate earlier work, showing the generally harmful effects of IM, and further show that notifications are more disruptive for fast, stimulus-driven search tasks than for slower, more effortful semantic-based search tasks.

Computer interface having a single window mode of operation

Abstract: A computer-human interface manages the available space of a computer display in a manner which reduces clutter and confusion caused by multiple open windows. The interface includes a user-selectable mode of operation in which only those windows associated with the currently active task are displayed on the computer monitor. All other windows relating to non-active tasks are minimized by reducing them in size or replacing them with a representative symbol, such as an icon, so that they occupy a minimal amount of space on the monitor's screen. When a user switches from the current task to a new task, by selecting a minimized window, the windows associated with the current task are automatically minimized as the window pertaining to the new task is displayed at its normal size. As a result, the user is only presented with the window that relates to the current task of interest, and clutter provided by non-active tasks is removed.

Bounds for multiprocessor scheduling with resource constraints

Abstract: One well-studied model ofa multiprocessing system involves a fixed number n ofidentical abstract processors, a finite set oftasks to be executed, each requiring a specified amount ofcomputation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the system is guided by an ordered list L of the tasks, according to the rule that whenever a processor becomes idle, it selects for processing the first unexecuted task on L which may validly be executed. We introduce an additional element of realism into this model by postulating the existence of a set of "resources" with the property that for each resource, the total usage ofthat resource at any instant oftime may not exceed its total availability. For this augmented model, we determine upper bounds on the ratio of finishing times achieved using two different lists, L and L', and exhibit constructions to show that the bounds are best possible. 2. The standard model. We consider a system composed of (usually n) abstract identical processors. The function of the system is to execute some given set

Mechanism for heterogeneous, peer-to-peer, and disconnected workflow operation

Abstract: A mechanism for heterogeneous, peer-to-peer, and disconnected workflow execution across a network infrastructure. Performer Agent entities provide a homogeneous view of humans, applications, and heterogeneous workflow systems and components that act as Performers on the network by executing Tasks. Source Agent entities provide a homogeneous view of heterogeneous service requesters such as workflow scripts executing on different workflow systems, which generate Activities that need to execute on Performers as Tasks. Task Request and Task Response messages are used to standardize the communication between Source Agents and Performer Agents, along with other messages for controlling and queuing Tasks. Workflow systems interact with each other as peers using this mechanism by sending workflow execution requests, workflow script templates, and workflow execution environments to each other. Disconnected operation is handled by ensuring the continuous availability of Source Agents and Performer Agents on the network and providing a mechanism for Sources to disconnect from Source Agents and Performers to disconnect from Performer Agents.