Priority inversion is not a method for deadlock recovery. Priority inversion is a concurrent computing problem in which a higher-priority operation is implicitly preempted by a lower-priority activity, resulting in an inversion of the desired priority scheme. This problem often occurs in systems where jobs with varying priority levels share resources (such as CPU or memory). The actual methods for deadlock recovery include:
Resource preemption: Involves forcibly taking resources from some processes and reallocating them to others to break the deadlock.
Process termination: Involves forcibly terminating one or more processes involved in the deadlock to break the cycle.
Process rollback: Involves rolling back one or more processes to a previous safe state to resolve the deadlock.