Task (computing)

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

Computer OS dispatcher operation with virtual switching queue and IP queues

Abstract: Driving task dispatching by an operating system in a multiprocessor computer system is accomplished with a virtual switching queue which accepts highest priority tasks from multiple switching queues which in turn are accessed by instruction processors seeking tasks. Overload, plucking and stealing of tasks may be used to effectively balance load within the computer system. Dynamic reconfiguration used where regular queues lose underlying instruction processors.

Near-Optimal and Truthful Online Auction for Computation Offloading in Green Edge-Computing Systems

Abstract: Utilizing the intelligence at the network edge, edge computing paradigm emerges to provide time-sensitive computing services for Internet of Things. In this paper, we investigate sustainable computation offloading in an edge-computing system that consists of energy harvesting-enabled mobile devices (MDs) and a dispatcher. The dispatcher collects computation tasks generated by IoT devices with limited computation power, and offloads them to resourceful MDs in exchange for rewards. We propose an online Rewards-optimal Auction (RoA) to optimize the long-term sum-of-rewards for processing offloaded tasks, meanwhile adapting to the highly dynamic energy harvesting (EH) process and computation task arrivals. RoA is designed based on Lyapunov optimization and Vickrey-Clarke-Groves auction, the operation of which does not require a prior knowledge of the energy harvesting, task arrivals, or wireless channel statistics. Our analytical results confirm the optimality of tasks assignment. Furthermore, simulation results validate the analytical analysis, and verify the efficacy of the proposed RoA.

Systems and methods for dispersing and clustering a plurality of robotic devices

Abstract: The present invention features methods for operating, such as methods for dispersing and clustering, robotic devices (i.e., “robots”) that employ adaptive behavior relative to neighboring robots and external (e.g., environmental) conditions. Each robot is capable of receiving, processing, and acting on one or more multi-device primitive commands that describe a task the robot will perform in response to other robots and the external conditions. The commands facilitate a distributed command and control structure, relieving a central apparatus or operator from the need to monitor the progress of each robot. This virtually eliminates the corresponding constraint on the maximum number of robots that can be deployed to perform a task (e.g., data collection, mapping, searching, dispersion, and retrieval). By increasing the number of robots, the efficiency in completing the task is also increased.

Data processing system with tree and list data structure

Abstract: A multitask multiuser system provides for efficient transfer of data from a remote data base to individual subscribers and has particular utility in the distribution of stock market data. A primary provider distributes the incoming data directly to user tasks or to an inquiry provider or a monitor provider. The inquiry provider responds to specific inquiries by users for information in the data base. The monitor provider maintains lists of information which are being monitored by the host computer for individual users. The inquiry provider and the monitor provider do not repeat requests to the remote data base where a similar request is already pending from another user. Data transfer paths between task are established by a code module which may be linked to any of the tasks. The transfer paths are established using information from a configuration list and they are monitored by the operating system through a wait list established for each user tasks. Providers in the system may establish subscriber lists through the code module.