Editing Deadlock (computer science) (section)

===Ignoring deadlock===
In this approach, it is assumed that a deadlock will never occur. This is also an application of the [[Ostrich algorithm]].<ref name="pric_os" /><ref name="distri_tanen">{{cite book |last=Tanenbaum |first=Andrew S. |url=https://books.google.com/books?id=l6sDRvKvCQ0C&q=Tanenbaum+ostrich&pg=PA177 |publisher=Pearson Education |year=1995 |title=Distributed Operating Systems |edition=1st |page=117 |isbn=9788177581799 |access-date=16 October 2020 |archive-date=18 April 2021 |archive-url=https://web.archive.org/web/20210418011235/https://books.google.com/books?id=l6sDRvKvCQ0C&q=Tanenbaum+ostrich&pg=PA177 |url-status=live }}</ref> This approach was initially used by [[MINIX]] and [[UNIX]].<ref name="embb"/> This is used when the time intervals between occurrences of deadlocks are large and the data loss incurred each time is tolerable.

Ignoring deadlocks can be safely done if deadlocks are [[formal verification|formally proven]] to never occur. An example is the RTIC framework.<ref>{{Cite web|url=https://rtic.rs/0.5/book/en/|title=Preface - Real-Time Interrupt-driven Concurrency|access-date=1 October 2020|archive-date=18 September 2020|archive-url=https://web.archive.org/web/20200918143731/https://rtic.rs/0.5/book/en/|url-status=live}}</ref>