Task (computing): Difference between revisions

Revision as of 02:49, 9 August 2009

Revision as of 08:22, 3 November 2009

Line 1:

{{Unreferenced|date=February 2007}}

A '''task''' is "an execution path through address space". In other words, a set of [[Computer program|program]] [[instruction (computer science)|instruction]]s that are loaded in [[computer storage|memory]]. The [[address register]]s have been loaded with the initial address of the program. At the next [[clock cycle]], the [[Central processing unit|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 <tt>[[halt]]</tt>, <tt>[[exit (operating system)|exit]]</tt>, or <tt>[[return (instruction)|return]]</tt>.

Line 5 ⟶ 6:

***In a computer [[graphical user interface]] (GUI), an event can be as simple as a mouse click or keystroke.

== See also ==

* [[Thread (computer science)|Thread]]

* [[Process states]]

Line 12 ⟶ 13:

* [[Computer multitasking]]

{{DEFAULTSORT:Task (Computing)}}

[[Category:Computing terminology]]

[[Category:Articles lacking sources (Erik9bot)]]

[[de:Task]]