3,688 views

2 Answers

Best answer
12 votes
12 votes

Correct Answer: (b)

Explanation: Checkpointing is a method of periodically saving the state of a job so that, if for some reason, the job does not complete, it can be restarted from the saved state. Checkpoints can be taken either under the control of the user application or external to the application.

Reference: Checkpointing a job - IBM

selected by
0 votes
0 votes

Checkpointing is a technique to add fault tolerance into computing systems. It basically consists of saving a snapshot of the application's state, so that it can restart from that point in case of failure. This is particularly important for long running application that are executed in vulnerable computing system.So the most appropriate answer is D

Answer:

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Jun 13, 2016
4,693 views
The page replacement algorithm which gives the lowest page fault rate isLRUFIFOOptimal page replacementSecond chance algorithm
9 votes
9 votes
2 answers
2
go_editor asked Jun 13, 2016
5,895 views
The performance of Round Robin algorithm depends heavily onsize of the processthe I/O bursts of the processthe CPU bursts of the processthe size of the time quantum
4 votes
4 votes
1 answer
3
go_editor asked Jun 12, 2016
2,531 views
Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. How many bits are there in the logical address?13 bits15 bits14 bits12 bits
8 votes
8 votes
2 answers
4
go_editor asked Jun 12, 2016
4,083 views
Which of the following need not necessarily be saved on a Context Switch between processes?General purpose registersTranslation look-aside bufferProgram counterStack poin...