Task (computing)

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

Method and system for intertask messaging between multiple processor

Abstract: A system and method for communicating messages between tasks on separate processors in a multiprocessor system are disclosed herein. A mediator task having a separate incoming message queue is used to handle message(s) from remote task(s) on other processor(s). A message from a remote task intended for a local task of a local processor is stored in the message queue of the mediator task. During an execution of the mediator task on the local processor, the mediator task is adapted to transfer the message from its message queue to the message queue of the intended local task, either directly or via another task. The present invention finds particular benefit in data processing in network devices.

System and method for job scheduling in application servers

Abstract: A method and a system for job scheduling in application servers. A common metadata of a job is deployed, the job being a deployable software component. An additional metadata of the job is further deployed. A scheduler task based on the additional metadata of the job is created, wherein the task is associated with a starting condition. The scheduler task is started at an occurrence of the starting condition, and, responsive to this an execution of an instance of the job is invoked asynchronously.

Methods and systems for assigning multiple tasks

Abstract: Methods and systems are disclosed for assigning multiple tasks to a technician. One method allows a user to interface with an Integrated Dispatch System and assign multiple tasks to at least one technician. Each task describes a repair of a telecommunications network. The method displays a graphical user interface on a computer, and the graphical user interface indicates the assignment of the multiple tasks.

End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems

Abstract: A cause-effect chain is used to define the logical order of data dependent tasks, which is independent from the execution order of the jobs of the (periodic/sporadic) tasks. Analyzing the worst-case End-to-End timing behavior, associated to a cause-effect chain, is an important problem in embedded control systems. For example, the detailed timing properties of modern automotive systems are specified in the AUTOSAR Timing Extensions.In this paper, we present a formal End-to-End timing analysis for distributed systems. We consider the two most important End-to-End timing semantics, i.e., the button-to-action delay (termed as the maximum reaction time) and the worst-case data freshness (termed as the maximum data age). Our contribution is significant due to the consideration of the sporadic behavior of job activations, whilst the results in the literature have been mostly limited to periodic activations. The proof strategy shows the (previously unexplored) connection between the reaction time (data age, respectively) and immediate forward (backward, respectively) job chains. Our analytical results dominate the state of the art for sporadic task activations in distributed systems and the evaluations show a clear improvement for synthesized task systems as well as for a real world automotive benchmark setting.

Query on demand video browsing

Abstract: This paper describes a novel method for browsing a large collection of news video by linking various forms of related video fragments together as threads. Each thread contains a sequence of shots with high feature-based similarity. Two interfaces are designed which use threads as the basis for browsing. One interface shows a minimal set of threads, and the other as many as possible. Both interfaces are evaluated in the TRECVID interactive retrieval task, where they ranked among the best interactive retrieval systems currently available. The results indicate that the use of threads in interactive video search is very beneficial. We have found that in general the query result and the timeline are the most important threads. However, having several additional threads allow a user to find unique results which cannot easily be found by using query results and time alone.