From 098d63fa89e51cef74e670ce327f8c39b88f8f44 Mon Sep 17 00:00:00 2001
From: Vitalii Koshura <lestat.de.lionkur@gmail.com>
Date: Mon, 3 Apr 2023 13:45:37 +0200
Subject: [PATCH] Update SchedMatch.md file

Signed-off-by: Vitalii Koshura <lestat.de.lionkur@gmail.com>
---
 SchedMatch.md | 110 +++++++++++++++++++++++++++-----------------------
 1 file changed, 59 insertions(+), 51 deletions(-)

diff --git a/SchedMatch.md b/SchedMatch.md
index 0baca00..2f80013 100644
--- a/SchedMatch.md
+++ b/SchedMatch.md
@@ -1,3 +1,5 @@
+# Scheduler job matchmaking
+
 Currently the scheduler's work-sending algorithm is:
 * if host is reliable, scan entire job array, looking for retries
 * if using HR, scan entire job array, looking for jobs committed to this HR class
@@ -24,70 +26,76 @@ V(J, H) might reflect various factors:
 BOINC includes a default value function.
 Projects can tweak its weights, or define their own value function.
 
-# Details
+## Details
 
 functions:
- job_set_feasible(set):: checks if a set of jobs is feasible (no DB access)
+### job_set_feasible(set)
+checks if a set of jobs is feasible (no DB access)
 * disk usage
 * deadline check (EDF sim or crude)
 * one result per user/host (no DB)
 
- job_feasible_fast(j):: feasibility checks that can be done with no DB access
+### job_feasible_fast(j)
+feasibility checks that can be done with no DB access
 * WU committed to different platform (no DB check)
 * app filtering
 * memory usage
 
- job_feasible_slow(j):: feasibility checks that need DB access
+### job_feasible_slow(j)
+feasibility checks that need DB access
 * one result per user or host per WU (look in DB)
 * WU committed to different platform (look in DB)
 
 Parameters:
- N:: scan at least this many slots (if scan N slots and have enough jobs to send, stop)
- M:: scan at most this many slots (even if don't have enough jobs to send yet)
- L:: if scan this many locked slots, print warning msg (should increase shmem size)
+### N
+scan at least this many slots (if scan N slots and have enough jobs to send, stop)
+### M
+scan at most this many slots (even if don't have enough jobs to send yet)
+### L
+if scan this many locked slots, print warning msg (should increase shmem size)
 
 logic:
-	
-	acquire semaphore
-	i = random index in shmem
-	x = ordered list of jobs to send (empty)
-	slots_scanned = 0
-	slots_locked = 0
-	loop
-	    i = i+1 % array_size
-	    slots_scanned++
-	    if slots_scanned > M
-	        break
-	    if shmem[i] is empty
-	        continue
-	    if shmem[i] is locked
-	        slots_locked++
-	        continue
-	    j = shmem[i]
-	    if !job_feasible_fast(j) continue;
-	    v = v(h, j)
-	    if v <= lowest score in x
-	        continue
-	    S = jobs in x with value >= v
-	    if !job_set_feasible(S+j)
-	        continue
-	    lock j
-	    release semaphore
-	    if !job_feasible_slow(j)
-	        acquire semaphore
-	        unlock j
-	        continue
-	    acquire semaphore
-	    add j to x
-	    while (x minus lowest-val element) satisfies work request
-	        remove lowest-val element of x
-	    while !job_set_feasible(x)
-	        remove lowest-value element of x
-	    if x satisfies work request and slots_scanned >= N
-	        break;
-	for each job j in x
-	    mark slot j as empty
-	release semaphore
-	if slots_locked > L
-	    print "need bigger array" message
-	
\ No newline at end of file
+```
+acquire semaphore
+i = random index in shmem
+x = ordered list of jobs to send (empty)
+slots_scanned = 0
+slots_locked = 0
+loop
+    i = i+1 % array_size
+    slots_scanned++
+    if slots_scanned > M
+        break
+    if shmem[i] is empty
+        continue
+    if shmem[i] is locked
+        slots_locked++
+        continue
+    j = shmem[i]
+    if !job_feasible_fast(j) continue;
+    v = v(h, j)
+    if v <= lowest score in x
+        continue
+    S = jobs in x with value >= v
+    if !job_set_feasible(S+j)
+        continue
+    lock j
+    release semaphore
+    if !job_feasible_slow(j)
+        acquire semaphore
+        unlock j
+        continue
+    acquire semaphore
+    add j to x
+    while (x minus lowest-val element) satisfies work request
+        remove lowest-val element of x
+    while !job_set_feasible(x)
+        remove lowest-value element of x
+    if x satisfies work request and slots_scanned >= N
+        break;
+for each job j in x
+    mark slot j as empty
+release semaphore
+if slots_locked > L
+    print "need bigger array" message
+```