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

Define lazy swapper, Define lazy swapper. Rather than swapping the enti...

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne

Online Q & A System, It uses unix commands such as forks and pipe .I need s...

It uses unix commands such as forks and pipe .I need solution to this project

What is the occupation of the object manager, Q. What is the occupation of ...

Q. What is the occupation of the object manager? Answer: Substance present a generic set of kernel mode interfaces to user mode programs. Objects are influenced by the execut

Which algorithm makes the most efficient use of memory, Question : (a) ...

Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

What are the allocation methods of a disk space, What are the allocation me...

What are the allocation methods of a disk space? Methods of allocating disk space which are widely in use are a. Contiguous allocation b. Linked allocation c. Indexed

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

Explain threads in details?, What are threads? A thread - sometimes c...

What are threads? A thread - sometimes called as an implementation context or a lightweight process - is a single sequential flow of control within a program. We use threads

THREADS, advantage and dis advantage of threads

advantage and dis advantage of threads

Explain lru additional reference bits algorithm, Additional Reference bits...

Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

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