From 98e3df3a2823634f6eded192ac07cc21e1cf53d6 Mon Sep 17 00:00:00 2001 From: John Gatward Date: Wed, 25 Mar 2026 12:33:18 +0000 Subject: [PATCH] test --- docs/lectures/osc/04_concurrency1.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/lectures/osc/04_concurrency1.md b/docs/lectures/osc/04_concurrency1.md index 7bcb9ba..0706adb 100644 --- a/docs/lectures/osc/04_concurrency1.md +++ b/docs/lectures/osc/04_concurrency1.md @@ -155,7 +155,7 @@ Deadlocks have to be prevented as well. A set of processes/threads is *deadlocked* if each process/thread in the set is waiting for an event that only the other process/thread in the set can cause -Each **deadlocked process/thread** is waiting for a resource held by another deadlocked process/thread (which cannot run and hence release the resource) . +Each **deadlocked process/thread** is waiting for a resource held by another deadlocked process/thread (which cannot run and hence release the resource). * Assume that X and Y are **mutually exclusive resources**. * Thread A and B need to **acquire both resources** and request them in oppose orders.