Jump to content

Task (computing)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Matthiaspaul (talk | contribs) at 13:52, 19 August 2013 (Bypassed disambiguation page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computing, a task is an execution path through address space[1] - in other words, a set of program instructions that are loaded in memory. The address registers have been loaded with the initial address of the program. At the next clock cycle, the CPU will start execution, in accord with the program. The sense is that some part of "a plan is being accomplished". As long as the program remains in this part of the address space, the task can continue, in principle, indefinitely, unless the program instructions contain a halt, exit, or return.

  • In the computer field, "task" can have the sense of a real-time application, as distinguished from process, which takes up space (memory), and execution time. See operating system.
    • Both "task" and "process" should be distinguished from event, which takes place at a specific time and place, and which a computer program can allow for.
  • Note that various environments have introduced the concept of a tasklet.

See also

Notes

  1. ^ Data General, RDOS Reference Manual