vault backup: 2025-03-10 08:54:43

.obsidian/workspace.json

@@ -13,12 +13,34 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "Concurrent Systems/notes/2b - Round Robin algorithm.md",
+                "file": "Concurrent Systems/notes/3.md",
                 "mode": "source",
                 "source": false
               },
               "icon": "lucide-file",
-              "title": "2b - Round Robin algorithm"
+              "title": "3"
+            }
+          }
+        ]
+      },
+      {
+        "id": "376bc91799eae4a7",
+        "type": "tabs",
+        "children": [
+          {
+            "id": "02dff467d5bcbba5",
+            "type": "leaf",
+            "state": {
+              "type": "pdf",
+              "state": {
+                "file": "Concurrent Systems/slides/class 3.pdf",
+                "page": 7,
+                "left": -27,
+                "top": 562,
+                "zoom": 0.5754156769596199
+              },
+              "icon": "lucide-file-text",
+              "title": "class 3"
             }
           }
         ]
@@ -78,7 +100,8 @@
       }
     ],
     "direction": "horizontal",
-    "width": 307.5
+    "width": 307.5,
+    "collapsed": true
   },
   "right": {
     "id": "bc4b945ded1926e3",
@@ -173,7 +196,8 @@
       }
     ],
     "direction": "horizontal",
-    "width": 364.5
+    "width": 364.5,
+    "collapsed": true
   },
   "left-ribbon": {
     "hiddenItems": {
@@ -192,13 +216,13 @@
       "companion:Toggle completion": false
     }
   },
-  "active": "0d5325c0f9289cea",
+  "active": "6bd7f2a6f353529e",
   "lastOpenFiles": [
-    "Concurrent Systems/notes/1 - CS Basics.md",
-    "Concurrent Systems/notes/3.md",
     "Concurrent Systems/slides/class 3.pdf",
-    "Concurrent Systems/notes/2 - Fast mutex by Lamport.md",
+    "Concurrent Systems/notes/3.md",
+    "Concurrent Systems/notes/1 - CS Basics.md",
     "Concurrent Systems/notes/2b - Round Robin algorithm.md",
+    "Concurrent Systems/notes/2 - Fast mutex by Lamport.md",
     "Concurrent Systems/notes/1b - Peterson algorithm.md",
     "HCIW/slides/Interface and Interaction for IoT.pdf",
     "Pasted image 20250305182542.png",

Concurrent Systems/notes/3.md

@@ -105,5 +105,9 @@ unlock() :=
 	return
 ```
 
->[!info} It is bounded bypass with bound n-1
+>[!note] a>It is bounded bypass with bound n-1>
 
+### Safe registers
+Atomic R/W and specialized HW primitives provide some form of atomicity. But is it possible to enforce MUTEX without atomicity?
+
+A **MRMW Safe register** is a register that provides READ and