{"title":"\u554f\u984c3-47 (3.4.1  The Nature of Time in Concurrent Systems)","author_name":"kiririmode","url":"https://kiririmode.hatenablog.jp/entry/20080805/p1","blog_title":"\u7406\u7cfb\u5b66\u751f\u65e5\u8a18","image_url":null,"height":"190","published":"2008-08-05 00:00:00","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkiririmode.hatenablog.jp%2Fentry%2F20080805%2Fp1\" title=\"\u554f\u984c3-47 (3.4.1  The Nature of Time in Concurrent Systems) - \u7406\u7cfb\u5b66\u751f\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","description":"Exercise 3.49. Give a scenario where the deadlock-avoidance mechanism described above does not work. (Hint: In the exchange problem, each process knows in advance which accounts it will need to get access to. Consider a situation where a process must get access to some shared resources before it can\u2026","provider_url":"https://hatena.blog","version":"1.0","categories":["SICP"],"type":"rich","author_url":"https://blog.hatena.ne.jp/kiririmode/","blog_url":"https://kiririmode.hatenablog.jp/"}