Jump to content

Ostrich algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by TheParanoidOne (talk | contribs) at 20:09, 4 July 2006 ({{comp-sci-stub}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, the "Ostrich" algorithm is not an algorithm, but rather a strategy of ignoring potential problems on the basis that they may be exceeingly rare - "to stick your head in the sand and pretend that there is no problem". This assumes that it is more cost-effective to allow the problem to occur than to attempt its prevention.

This approach may be used in dealing with deadlocks in concurrent programming if deadlocks are believed to be very rare, and if the cost of detection or prevention is high. Most modern operating systems such as Unix and Microsoft Windows take this approach.

Trade-offs
  • convenience
  • correctness