Task (computing)

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

Computer network of interactive multitasking computers for parallel processing of network subtasks concurrently with local tasks

Abstract: A local area computer network provides distributed parallel processing. The network comprises a plurality of workstations or personal computers, each having preemptive multitasking for the interactive execution of a local task in the foreground concurrently with a remote network subtask in the background. A large compute-intensive task may be partitioned into a plurality of parallel subtasks executed simultaneously with each subtask executed in the background by a respective workstations without substantial interference with the local task being executed concurrently in the foreground. The computer time and processing power which would otherwise be wasted while waiting for slow input/output operations is instead utilized to provide a powerful parallel multiprocessor system for handling compute-intensive tasks too large for an individual workstations.

A Low Fragmentation Heuristic for Task Placement in 2D RTR HW Management

Abstract: A novel technique is proposed for the management of a two-dimensional run-time reconfigurable device in order to get true hardware multitasking. The proposed technique uses a Vertex List Set to keep track of the available free area, and of the candidate locations to place the arriving tasks. Each Vertex List describes the contour of each unoccupied area fragment in the reconfigurable device. Several heuristics are proposed to solve the problem of selecting one of the vertices to place the task. The heuristic that gives best results is based on a novel fragmentation metric. This metric estimates for each alternative location the suitability of the resulting free device area to accept future incoming tasks. Finally, we show that our approach, with a reasonable complexity, gives better results, in terms of device fragmentation and efficiency, than other techniques.

Method, system, and program for synchronizing subtasks using sequence numbers

Abstract: Provided is a method, system and program for synchronizing sequential subtasks of a task, so that the subtasks can be dispatched to generate operations in a particular sequence. In one embodiment, a subtask which has been prepared for dispatching is queued in a queue until the queued subtask is the next subtask in sequence for dispatching. In one embodiment, the subtasks may be sorted in the queue by task and by subtask sequence.

Processor Cluster Architecture and Associated Parallel Processing Methods

Abstract: A parallel processing architecture comprising a cluster of embedded processors that share a common code distribution bus. Pages or blocks of code are concurrently loaded into respective program memories of some or all of these processors (typically all processors assigned to a particular task) over the code distribution bus, and are executed in parallel by these processors. A task control processor determines when all of the processors assigned to a particular task have finished executing the current code page, and then loads a new code page (e.g., the next sequential code page within a task) into the program memories of these processors for execution. The processors within the cluster preferably share a common memory (1 per cluster) that is used to receive data inputs from, and to provide data outputs to, a higher level processor. Multiple interconnected clusters may be integrated within a common integrated circuit device.