Describe the purpose of the checkpoint mechanism, Operating System

Assignment Help:

Describe the purpose of the checkpoint mechanism. How habitually must checkpoints be performed? Explain how the frequency of checkpoints affects:

  • System performance while no failure occurs
  • The time it acquires to recover from a system crash
  • The time it acquires to recover from a disk crash

Answer: A checkpoint log record point outs that a log record and its modified data has been written to stable storage and that the transaction need not to be redone in case of a system crash. Clearly the more often checkpoints are performed the less likely it is that redundant updates will have to be performed during the recovery process.

  • System performance when no failure take places-If no failures takes place the system must incur the cost of performing checkpoints that are essentially unnecessary. In these circumstances performing checkpoints less often will lead to better system performance.
  • The time acquires to recover from a system crash-the existence of a checkpoint record means that an operation will not have to be redone during system recovery. In these circumstances the more often checkpoints were performed the faster the recovery time is from a system crash.
  • The time it acquires to recover from a disk crash-the survival of a checkpoint record means that an operation will not have to be redone during system recovery. In this situation the more frequently checkpoints were performed the faster the recovery time is from a disk crash.

 


Related Discussions:- Describe the purpose of the checkpoint mechanism

How the nested macro calls are expanded, How the Nested Macro calls are exp...

How the Nested Macro calls are expanded LIFO (Last in First out)

What are the different file operations?, What are the different file operat...

What are the different file operations? Create : - Space for the file in the file system update directory table. Write : - file name and data to be written is

Hashed page table, W hat is hashed page table & method of hashed page tabl...

W hat is hashed page table & method of hashed page table with details

Illustrate example for segmentation, EXAMPLE FOR SEGMENTATION Consider ...

EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th

Explain the performance of demand paging, Performance of demand paging ...

Performance of demand paging Demand paging can have an important effect on the performance of a computer system. As long as there are no page faults, the effective access time

Most-recently used algorithm, Evicting the most-recently used (MRU) page do...

Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory

priority-based scheduling algorithm , Your task is to replace the round ro...

Your task is to replace the round robin CPU scheduling scheme you developed in Practical 6 with a priority-based scheduling algorithm. To simplify matters, you can maintain the ori

10 marks, Differentiate between sequential access and direct access method?...

Differentiate between sequential access and direct access method?

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