Differences between foreground and background, Operating System

Assignment Help:

Describe the differences between foreground and background processing. What advantage does background processing provide?

1. Background processes typically run with little or no user interaction, they interact with the system instead. Foreground processes are what the user interacts with.

2. Background processes, unless explicitly ran so, run with non-admin permissions.

This is also called batch processing.

3. A foreground process has access to the terminal (standard input and output), while the background process does not.

4. A background process runs without being connected to your keyboard. If the background process requires any keyboard input, it waits.

The basic advantage of background processing is that it allows the system to run other commands; the processor does not have to wait until it completes one task to start another. This provides the ability to have multiple applications executing at the same time. For example, a user can play a game with one application while another application is playing a song. To the developer, the advantage of multitasking gives the ability to create tools and applications which use more than one process and to create processes that use multiple threads of execution.


Related Discussions:- Differences between foreground and background

Explain the various types of computer systems, Explain the various types of...

Explain the various types of computer systems. Mainframe systems Large Number of CPU with Greatest Processing Power:  Huge Memory Capacity:  Increased Performance by s

Explain system-wide open-file and per-process open-file, Explain system-wid...

Explain system-wide open-file and per-process open-file The system-wide open-file table have a copy of the FCB of each open file, as well as other information. The per-pr

Memory management, 4. Describe priority scheduling algorithm. Consider the ...

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re

Requirements memory management intended to satisfy?, Normal 0 f...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

What are tree-structured directories, What are Tree-structured directories ...

What are Tree-structured directories We can generalize the directory structure to a tree of arbitrary height. This permits the user to create their own sub directories and to c

What is internal fragmentation?, What is internal fragmentation? Consid...

What is internal fragmentation? Consider holes of 20k assume the process requests 18 bites. If we allocate accurately the request block, we are left with a hole of 2k. The over

What is preallocation, What is preallocation? Why do it? Allocating spa...

What is preallocation? Why do it? Allocating space for a file before making the file to allow for expansion. This reserves space for a certain file so that other files can't gr

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd