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

Paging, protection in paging

protection in paging

Thread pools, Another solution then would be to keep a pool of threads. Whe...

Another solution then would be to keep a pool of threads. Whenever a new task arrives, the system would simply get a thread from pool and set that thread to work on the given task.

Advantage of minimizing the file space, Q. a number of systems automaticall...

Q. a number of systems automatically delete all user files when a user logs off or a job terminates unless the user explicitly requests that they be kept other systems keep all fil

CPU Scheduing FCFS, Assume that P A , P B and P C are three distinguished p...

Assume that P A , P B and P C are three distinguished program s . When P A is executed, it needs 10 ticks to complete its execution and it forks new processes executing P B at tick

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

Explian integrating a request/response mechanism, Explian Integrating a Req...

Explian Integrating a Request/Response Mechanism Traditional application developers will need to develop a mechanism for communication between requesting (client) and respondin

Deadlock prevention-resource allocation graph allocation, Explain Deadlock ...

Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm :  Using this algorithm we are able to actually know if there exists in th

What is time-stamping, time-stamping It is a method proposed by Lampor...

time-stamping It is a method proposed by Lamport, used to sequencing events in a distributed machine without the use of clocks. This process is intended to order events consis

What are the issues in designing a network-transparency, Transparency : ...

Transparency : Users must be able to access remote resources as though these resources were local. Transparency should as well promote user mobility. Users must be allowed to lo

Name the hardware to support demand paging, The hardware to support demand ...

The hardware to support demand paging is as follows Page table: This table has the skill to mark an entry invalid though a valid-invalid bit or particular value of protectio

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