Operating System » Deadlock Recovery
Operating System Subcategories
Memory Management Swapping 1Process Scheduling Queue
Virtual Memory Page Replacement Algorithms 1Linux
Cpu SchedulingMemory Management
Computer FundamentalsCpu Scheduling Benefits
Threads Signal HandlingThreads Ult Klt
Distributed Operating SystemBasics
Operating SystemProcesses
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
DeadlockDeadlock Avoidance
Memory Management Swapping 2Memory Allocation 1
Secondary StorageMemory Management Paging 1
Memory Management Paging 2Rtos
Multimedia System Cpu Disk SchedulingSecurity Intrusion Detection
Virtual Memory ThrashingFile System Interface Access Methods 1
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Allocation Methods 1
Disk Scheduling 2Disk Management
Classic Sync ProblemsSemaphores 1
Process CreationMultimedia System Network Management
Semaphores 2Cpu Scheduling 2
Application Io Interface 1Inter Process Communication
Process SynchronizationMultimedia System Compression 1
Network File System 1Disk Scheduling 1
Mass Storage Raid 1File System 1
Communication Systems Bandwidth Transmission MediumSecurity Cryptography
Two Port NetworkProcess Rpc
Virtual Memory Page Replacement Algorithms 2Virtual Memory Frame Allocation
Network File System 2File System Allocation Methods 2
File System Allocation Methods 3Process Control Block
Process StructuresCritical Section Problem
Process Sync MonitorsAtomic Transactions
Deadlock RecoveryMemory Allocation 2
Memory Management SegmentationApplication Io Interface 2
Kernel Io SubsystemsMultimedia System Compression 2
Multimedia System Compression 3Security User Authentication
Security Program System ThreatsSecurity System Facility
Threads Fork ExecThreads Cancellation
Threads PoolsMulti Threading Models
Virtual Memory Demand PagingVirtual Memory
File System ConceptsFile System Implementation
File System Interface Access Methods 2File System Recovery
Io SubsystemSwap Space Management
Mass Storage Raid 2Mass Storage Tertiary Storage
Protection ConceptsProtection Access Matrix
SecurityProtection Memory Protection
Protection Revocation Access RightsNetwork Structure Topology
RobustnessDistributed File System
Distributed SynchronizationDeadlock Prevention
Deadlock DetectionThreads
File System Interface ProtectionFile System Free Space Performance
A deadlock can be broken by ____________

A. Abort one or more processes to break the circular wait
B. Abort all the process in the system
C. Preempt all resources from all processes
D. None of the mentioned

The two ways of aborting processes and eliminating deadlocks are ____________

A. Abort all deadlocked processes
B. Abort all processes
C. Abort one process at a time until the deadlock cycle is eliminated
D. All of the mentioned

Those processes should be aborted on occurrence of a deadlock, the termination of which?

A. Is more time consuming
B. Incurs minimum cost
C. Safety is not hampered
D. All of the mentioned

The process to be aborted is chosen on the basis of the following factors?

A. Priority of the process
B. Process is interactive or batch
C. How long the process has computed
D. All of the mentioned

Cost factors for process termination include ____________

A. Number of resources the deadlock process is not holding
B. Cpu utilization at the time of deadlock
C. Amount of time a deadlocked process has thus far consumed during its execution
D. All of the mentioned

To _______ to a safe state, the system needs to keep more information about the states of processes.

A. Abort the process
B. Roll back the process
C. Queue the process
D. None of the mentioned

What is the solution to starvation?

A. The number of rollbacks must be included in the cost factor
B. The number of resources must be included in resource preemption
C. Resource preemption be done instead
D. All of the mentioned