Task (computing)

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

Ontology-enabled pervasive computing applications

Abstract: Information technology's rapid evolution has made tremendous amounts of information and services available at our fingertips. However, we still face the frustration of trying to do simple things in the device- and application-rich environments where we live and work. Task computing is defined as computation to fill the gap between the tasks that users want to perform and the services that constitute available actionable functionality. To support task computing, we have implemented a Task Computing Environment including client environment, service discovery mechanism, and Semantic Web services and tools. TCE is composed of several components including STEER (Semantic Task Execution EditoR), White Hole, and PIPE (Pervasive Instance Provision Environment).

Programmable controller with multiple priority level task processing

Abstract: A programmable controller for operating a machine to perform programmed functions allows the user to allocate the amount of processing time to be devoted to a machine control program and to user defined background tasks. The allocation is defined by an entry stored in one of several locations in a data table. Each occurrence of a timed interrupt steps the operating system through the data table. When the operating system accesses the location at which the entry is stored, the machine control program is assigned as lower execution priority than any background tasks to be executed. When the last storage location of the data table is accessed, the user control program is restored to a higher execution priority than the background tasks before initiating another stepping sequence through the data table.

Self-organized task allocation to sequentially interdependent tasks in swarm robotics

Abstract: In this article we present a self-organized method for allocating the individuals of a robot swarm to tasks that are sequentially interdependent. Tasks that are sequentially interdependent are common in natural and artificial systems. The proposed method does neither rely on global knowledge nor centralized components. Moreover, it does not require the robots to communicate. The method is based on the delay experienced by the robots working on one subtask when waiting for input from another subtask. We explore the capabilities of the method in different simulated environments. Additionally, we evaluate the method in a proof-of-concept experiment using real robots. We show that the method allows a swarm to reach a near-optimal allocation in the studied environments, can easily be transferred to a real robot setting, and is adaptive to changes in the properties of the tasks such as their duration. Finally, we show that the ideal setting of the parameters of the method does not depend on the properties of the environment.

Stochastic priority-based task scheduler

Abstract: A stochastic priority based scheduler for selecting executable tasks in a computer system is disclosed. The stochastic priority based scheduler selects tasks on the basis of a random number weighted by task priority. Since every task has a nonzero finite probability of being selected, the probability being proportional to the task priority, all tasks, even low priority ones, have a chance of being selected, thus eliminating the lockout problem.

Japanese version of NASA Task Load Index: Sensitivity of its workload score to difficulty of three different laboratory tasks.

Abstract: 日本語版NASA-TLXを用いて3種類の室内実験課題のワークロード測定を行ったところ, いずれの課題においても, 困難度の変化に感度よく対応したTLX得点が得られた. また, 尺度の重要度に関する一対比較から算出される尺度の重みが課題ごとに異なるパターンを示すことから, 3つの実験課題は作業負荷の面で相互に性質の異なるものであったことが検証され, TLX得点が性質の異なる種々の作業に適用可能であることが確認された. さらに, 相関分析や重回帰分析を行って, その結果をオリジナル版のNASA-TLXに関する報告と比較した. 最後に, 一対比較を省略した簡便法から得られる各種指標を推定したところ, 被験者間の変動は正規のNASA-TLX得点であるWWLと同様またはむしろやや小さく, WWLや“全体的負荷”との相関も高いことが明らかになった.