I thought "deadly embrace" was synonymous with deadlock. And it's definitely not obsolete. In fact, there's one guy (Kercel) who seems to have claimed that deadlock handling demonstrates the realizability of (M,R)-systems (or at least the ability of Turing Machines to "simulate" such systems - the scare quotes are necessary).
On 10/5/21 9:41 AM, Frank Wimberly wrote: >>race conditions, deadlocks, etc. > > > My favorite when I took an OS course 50+ years ago was "deadly embrace" which > I'm sure is an obsolete problem. It occurred when two processes were waiting > for each other. -- "Better to be slapped with the truth than kissed with a lie." ☤>$ uǝlƃ .-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
