OnlineWoerterBuecher.de - Lexikon, Free On-line Dictionary of Computing



	OnlineWoerterBuecher.de

Navigation

Start

Deutsch-Englisch

Deutsch-Spanisch

Enzyklopädie

Internes

Impressum

Kontakt

Lexikon

multitasking

(Or "multi-tasking", "multiprogramming", "concurrent processing", "concurrency", "process scheduling") A technique used in an href="module.php?name=Lexikon&file=search&eid=1&query=operating system">operating system for sharing a single processor between several independent jobs. The first multitasking operating systems were designed in the early 1960s. Under "href="module.php?name=Lexikon&file=search&eid=1&query=cooperative multitasking">cooperative multitasking" the running task decides when to give up the CPU and under "href="module.php?name=Lexikon&file=search&eid=1&query=pre-emptive multitasking">pre-emptive multitasking" (probably more common) a system process called the "href="module.php?name=Lexikon&file=search&eid=1&query=scheduler">scheduler" suspends the currently running task after it has run for a fixed period known as a "href="module.php?name=Lexikon&file=search&eid=1&query=time-slice">time-slice". In both cases the scheduler is responsible for selecting the next task to run and (re)starting it. The running task may relinquish control voluntarily even in a pre-emptive system if it is waiting for some external href="module.php?name=Lexikon&file=search&eid=1&query=event">event. In either system a task may be suspended prematurely if a hardware href="module.php?name=Lexikon&file=search&eid=1&query=interrupt">interrupt occurs, especially if a higher priority task was waiting for this event and has therefore become runnable. The scheduling href="module.php?name=Lexikon&file=search&eid=1&query=algorithm">algorithm used by the scheduler determines which task will run next. Some common examples are href="module.php?name=Lexikon&file=search&eid=1&query=round-robin">round-robin scheduling, href="module.php?name=Lexikon&file=search&eid=1&query=priority scheduling">priority scheduling, {shortest job first} and {guaranteed scheduling}. Multitasking introduces href="module.php?name=Lexikon&file=search&eid=1&query=overheads">overheads because the processor spends some time in choosing the next job to run and in saving and restoring tasks' state, but it reduces the worst-case time from job submission to completion compared with a simple href="module.php?name=Lexikon&file=search&eid=1&query=batch">batch system where each job must finish before the next one starts. Multitasking also means that while one task is waiting for some external event, the href="module.php?name=Lexikon&file=search&eid=1&query=CPU">CPU to do useful work on other tasks. A multitasking operating system should provide some degree of protection of one task from another to prevent tasks from interacting in unexpected ways such as accidentally modifying the contents of each other' s memory areas. The jobs in a multitasking system may belong to one or many users. This is distinct from href="module.php?name=Lexikon&file=search&eid=1&query=parallel processing">parallel processing where one user runs several tasks on several processors. href="module.php?name=Lexikon&file=search&eid=1&query=Time-sharing">Time-sharing is almost synonymous but implies that there is more than one user. href="module.php?name=Lexikon&file=search&eid=1&query=Multithreading">Multithreading is a kind of multitasking with low href="module.php?name=Lexikon&file=search&eid=1&query=overheads">overheads and no protection of tasks from each other, all threads share the same memory. (1998-04-24)

[ Go Back ]

Free On-line Dictionary of Computing

	All logos and trademarks in this site are property of their respective owner. Page Generation in 0.1064 Seconds, with 16 Database-Queries