Changes between Version 1 and Version 2 of SchedMatch

Timestamp:

Feb 29, 2008, 2:44:43 PM (18 years ago)

Author:

davea

Comment:

--

SchedMatch

@@ -30 +30 @@
 
 functions:
-        fast_filter():: feasibility checks that can be done with no DB access
-        slow_filter():: feasibility checks that need 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)
 
-When we scan a slot, the possibilities are:
- * slot is empty
- * slot is locked by another scheduler
- * job fails fast filter
- * job fails slow filter
- * none of the above
+ 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
+ * 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:
@@ -56 +57 @@
 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 !fast_filter(j) continue;
-        v = v(h, j)
-        if v > lowest score in x
-                lock j
-                release semaphore
-                if !slow_filter(j)
-                        acquire semaphore
-                        unlock j
-                        continue
-                acquire semaphore
-                if x satisfies client's work request
-                        unlock and remove lowest-score element of x
-                add j to x
-        if x satisfies client's work request and slots_scanned >= N
-                break;
+    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
+    mark slot j as empty
 release semaphore
 if slots_locked > L
-        print "need bigger array" message
+    print "need bigger array" message
 }}}