Ostrich algorithm
The ostrich algorithm is a term from computer science . If multiple threads due to cyclical conditions between resources in a deadlock (Engl. Deadlock come), there are several ways to handle this.
The ostrich algorithm is practically the simplest approach: the fact that a deadlock has occurred is simply ignored. The consequence of this is that this deadlock is never resolved - the threads wait indefinitely for the resources and are eventually released from the state “from outside” (usually by aborting them). The “ostrich algorithm” is thus simply a derogatory term for not solving a problem.
From a technical point of view, preventing or automatically resolving deadlocks is the right approach and this form of "troubleshooting" is out of the question. However, if the effort involved is too great, or the probability that a deadlock will occur is too small, or if a deadlock can only be brought about specifically through human intervention, this procedure can be useful.
The name of the algorithm comes from the ostrich , which, according to a false rumor, sticks its head in the sand in case of danger in order to ignore the "problem".
Individual evidence
- ^ Tanenbaum, Andrew S .: Modern operating systems. 3. Edition. Munich: Person Studium 2009. S. 520.