Explain about spooling, Operating System

Assignment Help:

Q. Explain about Spooling?

  • Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where a device can access them whenever it is ready.
  • Spooling is useful since device access data at different rates. Buffer offers a waiting station where data can rest while slower device catches up. Fig below displays the spooling.

8_Explain about Spooling.png

  • Computer can perform I/O in parallel with computation, it becomes possible to have the computer read a deck of cards to adrum, tape or disk and to write out to tape printer while it was computing. This process is known as spooling.
  • The most common spooling application is print spooling. In print spooling documents are loaded in a buffer and then printer pulls them off the buffer at its own rate.
  • Spooling is used for processing data at remote sites also. CPU transmits the data through communications path to a remote printer. Spooling overlaps I/O of one job with computation of other jobs.
  • One difficulty with simple batch systems is that computer still requires to read the decks of cards before it can begin to execute the job. This means that CPU is idle at the time of these relatively slow operations.
  • Spooling batch systems were the first and are simplest of multiprogramming systems

Advantage of Spooling

1.  Spooling operation uses a disk like a very large buffer.

2. Spooling is however capable of overlapping I/O operation for one job with processor operations for another job.


Related Discussions:- Explain about spooling

Process creation, what is process creation and how to create a process

what is process creation and how to create a process

Thread safety, What does it mean for something to be thread-safe? By saying...

What does it mean for something to be thread-safe? By saying that X is thread-safe, we mean that if multiple threads use X at the same time, we don't have to worry about concurrenc

Define lru page replacement algorithm, Define LRU Page Replacement Algorith...

Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti

Cpu, Some CPUs provide for more than two modes of operation. What are two p...

Some CPUs provide for more than two modes of operation. What are two possible uses of these multiple modes?

When page fault frequency in an operating system is reduced, When the Page ...

When the Page fault frequency in an operating system is reduced Locality of reference is appropriate to the process

Suggest a scheme for implementing this policy, Q. Consider a calculating e...

Q. Consider a calculating environment where a process is given the privilege of accessing object only n times. Suggest a scheme for implementing this policy. Answer: Add an i

Define action that implementing meaning of instruction, Determine how Actio...

Determine how Action implementing instruction’s meaning are a actually carried out   Action implementing meaning of instruction are a actually carried out Instruction executio

Explain quick fit algorithams, QUICK FIT ALGORITHAMS Here we keep apart...

QUICK FIT ALGORITHAMS Here we keep apart lists for holes and processes. Therefore this reduces the searching time for holes Hole list and Process list. If we organize the li

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