author | wenzelm |
Sat, 02 Jun 2018 21:59:11 +0200 | |
changeset 68354 | 93d3c967802e |
parent 68129 | b73678836f8e |
child 68598 | d465b396ef85 |
permissions | -rw-r--r-- |
28165 | 1 |
(* Title: Pure/Concurrent/task_queue.ML |
2 |
Author: Makarius |
|
3 |
||
4 |
Ordered queue of grouped tasks. |
|
5 |
*) |
|
6 |
||
7 |
signature TASK_QUEUE = |
|
8 |
sig |
|
29340 | 9 |
type group |
32221 | 10 |
val new_group: group option -> group |
32052 | 11 |
val group_id: group -> int |
29340 | 12 |
val eq_group: group * group -> bool |
32221 | 13 |
val cancel_group: group -> exn -> unit |
14 |
val is_canceled: group -> bool |
|
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
52558
diff
changeset
|
15 |
val group_status: group -> exn list |
28179 | 16 |
val str_of_group: group -> string |
43951 | 17 |
val str_of_groups: group -> string |
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
18 |
val urgent_pri: int |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
19 |
type task |
45136
2afb928c71ca
static dummy_task (again) to avoid a few extra allocations;
wenzelm
parents:
44341
diff
changeset
|
20 |
val dummy_task: task |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
21 |
val group_of_task: task -> group |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
22 |
val name_of_task: task -> string |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
23 |
val pri_of_task: task -> int |
68354
93d3c967802e
record active execution task and depend on it -- avoid new executions bumping into old ones;
wenzelm
parents:
68129
diff
changeset
|
24 |
val eq_task: task * task -> bool |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
25 |
val str_of_task: task -> string |
43951 | 26 |
val str_of_task_groups: task -> string |
50975 | 27 |
val task_statistics: task -> Properties.T |
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
28 |
val running: task -> (unit -> 'a) -> 'a |
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
29 |
val joining: task -> (unit -> 'a) -> 'a |
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
30 |
val waiting: task -> task list -> (unit -> 'a) -> 'a |
28165 | 31 |
type queue |
32 |
val empty: queue |
|
66378 | 33 |
val group_tasks: queue -> group list -> task list |
41708 | 34 |
val known_task: queue -> task -> bool |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
35 |
val all_passive: queue -> bool |
68129 | 36 |
val total_jobs: queue -> int |
37 |
val status: queue -> |
|
38 |
{ready: int, pending: int, running: int, passive: int, urgent: int, total: int} |
|
47404
e6e5750f1311
simplified Future.cancel/cancel_group (again) -- running threads only;
wenzelm
parents:
45642
diff
changeset
|
39 |
val cancel: queue -> group -> Thread.thread list |
44341
a93d25fb14fc
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
wenzelm
parents:
44340
diff
changeset
|
40 |
val cancel_all: queue -> group list * Thread.thread list |
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
41 |
val finish: task -> queue -> bool * queue |
54649
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
42 |
val enroll: Thread.thread -> string -> group -> queue -> task * queue |
66166 | 43 |
val enqueue_passive: group -> string -> (unit -> bool) -> queue -> task * queue |
41708 | 44 |
val enqueue: string -> group -> task list -> int -> (bool -> bool) -> queue -> task * queue |
29365 | 45 |
val extend: task -> (bool -> bool) -> queue -> queue option |
47423
8a179a0493e3
more robust Future.fulfill wrt. duplicate assignment and interrupt;
wenzelm
parents:
47404
diff
changeset
|
46 |
val dequeue_passive: Thread.thread -> task -> queue -> bool option * queue |
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
47 |
val dequeue: Thread.thread -> bool -> queue -> (task * (bool -> bool) list) option * queue |
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
48 |
val dequeue_deps: Thread.thread -> task list -> queue -> |
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
49 |
(((task * (bool -> bool) list) option * task list) * queue) |
28165 | 50 |
end; |
51 |
||
35242
1c80c29086d7
eliminated opaque signature matching -- tends to cause problems with toplevel pp for abstract types;
wenzelm
parents:
35012
diff
changeset
|
52 |
structure Task_Queue: TASK_QUEUE = |
28165 | 53 |
struct |
54 |
||
52537 | 55 |
val new_id = Counter.make (); |
40450
8eab60e1baeb
private counter, to keep externalized ids a bit smaller;
wenzelm
parents:
39243
diff
changeset
|
56 |
|
8eab60e1baeb
private counter, to keep externalized ids a bit smaller;
wenzelm
parents:
39243
diff
changeset
|
57 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
58 |
(** nested groups of tasks **) |
41670 | 59 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
60 |
(* groups *) |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
61 |
|
35242
1c80c29086d7
eliminated opaque signature matching -- tends to cause problems with toplevel pp for abstract types;
wenzelm
parents:
35012
diff
changeset
|
62 |
abstype group = Group of |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
63 |
{parent: group option, |
40450
8eab60e1baeb
private counter, to keep externalized ids a bit smaller;
wenzelm
parents:
39243
diff
changeset
|
64 |
id: int, |
44247 | 65 |
status: exn option Synchronized.var} |
35242
1c80c29086d7
eliminated opaque signature matching -- tends to cause problems with toplevel pp for abstract types;
wenzelm
parents:
35012
diff
changeset
|
66 |
with |
29121 | 67 |
|
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
68 |
fun make_group (parent, id, status) = Group {parent = parent, id = id, status = status}; |
32052 | 69 |
|
44247 | 70 |
fun new_group parent = make_group (parent, new_id (), Synchronized.var "group_status" NONE); |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
71 |
|
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
72 |
fun group_id (Group {id, ...}) = id; |
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
73 |
fun eq_group (group1, group2) = group_id group1 = group_id group2; |
28551 | 74 |
|
43951 | 75 |
fun fold_groups f (g as Group {parent = NONE, ...}) a = f g a |
76 |
| fold_groups f (g as Group {parent = SOME group, ...}) a = fold_groups f group (f g a); |
|
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
77 |
|
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
78 |
|
32221 | 79 |
(* group status *) |
80 |
||
32251 | 81 |
fun cancel_group (Group {status, ...}) exn = |
82 |
Synchronized.change status |
|
44247 | 83 |
(fn exns => SOME (Par_Exn.make (exn :: the_list exns))); |
29121 | 84 |
|
32251 | 85 |
fun is_canceled (Group {parent, status, ...}) = |
44247 | 86 |
is_some (Synchronized.value status) orelse |
32251 | 87 |
(case parent of NONE => false | SOME group => is_canceled group); |
32221 | 88 |
|
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
52558
diff
changeset
|
89 |
fun group_status (Group {parent, status, ...}) = |
44247 | 90 |
the_list (Synchronized.value status) @ |
53190
5d92649a310e
simplified Goal.forked_proofs: status is determined via group instead of dummy future (see also Pure/PIDE/execution.ML);
wenzelm
parents:
52558
diff
changeset
|
91 |
(case parent of NONE => [] | SOME group => group_status group); |
28165 | 92 |
|
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
93 |
fun str_of_group group = |
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
94 |
(is_canceled group ? enclose "(" ")") (string_of_int (group_id group)); |
28179 | 95 |
|
43951 | 96 |
fun str_of_groups group = |
97 |
space_implode "/" (map str_of_group (rev (fold_groups cons group []))); |
|
98 |
||
35242
1c80c29086d7
eliminated opaque signature matching -- tends to cause problems with toplevel pp for abstract types;
wenzelm
parents:
35012
diff
changeset
|
99 |
end; |
1c80c29086d7
eliminated opaque signature matching -- tends to cause problems with toplevel pp for abstract types;
wenzelm
parents:
35012
diff
changeset
|
100 |
|
28165 | 101 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
102 |
(* tasks *) |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
103 |
|
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
104 |
val urgent_pri = 1000; |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
105 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
106 |
type timing = Time.time * Time.time * string list; (*run, wait, wait dependencies*) |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
107 |
|
45136
2afb928c71ca
static dummy_task (again) to avoid a few extra allocations;
wenzelm
parents:
44341
diff
changeset
|
108 |
val timing_start = (Time.zeroTime, Time.zeroTime, []): timing; |
2afb928c71ca
static dummy_task (again) to avoid a few extra allocations;
wenzelm
parents:
44341
diff
changeset
|
109 |
|
45354
a2157057024c
optional timing, to avoid redundant allocation of mutable cells;
wenzelm
parents:
45136
diff
changeset
|
110 |
fun new_timing () = |
a2157057024c
optional timing, to avoid redundant allocation of mutable cells;
wenzelm
parents:
45136
diff
changeset
|
111 |
if ! Multithreading.trace < 2 then NONE |
a2157057024c
optional timing, to avoid redundant allocation of mutable cells;
wenzelm
parents:
45136
diff
changeset
|
112 |
else SOME (Synchronized.var "timing" timing_start); |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
113 |
|
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
114 |
abstype task = Task of |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
115 |
{group: group, |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
116 |
name: string, |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
117 |
id: int, |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
118 |
pri: int option, |
50975 | 119 |
timing: timing Synchronized.var option, |
120 |
pos: Position.T} |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
121 |
with |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
122 |
|
45136
2afb928c71ca
static dummy_task (again) to avoid a few extra allocations;
wenzelm
parents:
44341
diff
changeset
|
123 |
val dummy_task = |
50975 | 124 |
Task {group = new_group NONE, name = "", id = 0, pri = NONE, timing = NONE, |
125 |
pos = Position.none}; |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
126 |
|
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
127 |
fun new_task group name pri = |
50975 | 128 |
Task {group = group, name = name, id = new_id (), pri = pri, timing = new_timing (), |
129 |
pos = Position.thread_data ()}; |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
130 |
|
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
131 |
fun group_of_task (Task {group, ...}) = group; |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
132 |
fun name_of_task (Task {name, ...}) = name; |
68354
93d3c967802e
record active execution task and depend on it -- avoid new executions bumping into old ones;
wenzelm
parents:
68129
diff
changeset
|
133 |
fun id_of_task (Task {id, ...}) = id; |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
134 |
fun pri_of_task (Task {pri, ...}) = the_default 0 pri; |
43951 | 135 |
|
68354
93d3c967802e
record active execution task and depend on it -- avoid new executions bumping into old ones;
wenzelm
parents:
68129
diff
changeset
|
136 |
fun eq_task (task1, task2) = id_of_task task1 = id_of_task task2; |
93d3c967802e
record active execution task and depend on it -- avoid new executions bumping into old ones;
wenzelm
parents:
68129
diff
changeset
|
137 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
138 |
fun str_of_task (Task {name, id, ...}) = |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
139 |
if name = "" then string_of_int id else string_of_int id ^ " (" ^ name ^ ")"; |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
140 |
|
43951 | 141 |
fun str_of_task_groups task = str_of_task task ^ " in " ^ str_of_groups (group_of_task task); |
142 |
||
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
143 |
fun update_timing update (Task {timing, ...}) e = |
62923 | 144 |
Thread_Attributes.uninterruptible (fn restore_attributes => fn () => |
41702
dca4c58c5d57
Task_Queue.update_timing: more precise treatment of interruptibility;
wenzelm
parents:
41695
diff
changeset
|
145 |
let |
dca4c58c5d57
Task_Queue.update_timing: more precise treatment of interruptibility;
wenzelm
parents:
41695
diff
changeset
|
146 |
val start = Time.now (); |
dca4c58c5d57
Task_Queue.update_timing: more precise treatment of interruptibility;
wenzelm
parents:
41695
diff
changeset
|
147 |
val result = Exn.capture (restore_attributes e) (); |
62826 | 148 |
val t = Time.now () - start; |
45136
2afb928c71ca
static dummy_task (again) to avoid a few extra allocations;
wenzelm
parents:
44341
diff
changeset
|
149 |
val _ = (case timing of NONE => () | SOME var => Synchronized.change var (update t)); |
41702
dca4c58c5d57
Task_Queue.update_timing: more precise treatment of interruptibility;
wenzelm
parents:
41695
diff
changeset
|
150 |
in Exn.release result end) (); |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
151 |
|
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
152 |
fun task_ord (Task {id = id1, pri = pri1, ...}, Task {id = id2, pri = pri2, ...}) = |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
153 |
prod_ord (rev_order o option_ord int_ord) int_ord ((pri1, id1), (pri2, id2)); |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
154 |
|
50975 | 155 |
fun task_statistics (Task {name, id, timing, pos, ...}) = |
156 |
let |
|
157 |
val (run, wait, wait_deps) = |
|
158 |
(case timing of NONE => timing_start | SOME var => Synchronized.value var); |
|
159 |
fun micros time = string_of_int (Time.toNanoseconds time div 1000); |
|
160 |
in |
|
63806 | 161 |
[("now", Value.print_real (Time.toReal (Time.now ()))), |
162 |
("task_name", name), ("task_id", Value.print_int id), |
|
50975 | 163 |
("run", micros run), ("wait", micros wait), ("wait_deps", commas wait_deps)] @ |
164 |
Position.properties_of pos |
|
165 |
end; |
|
166 |
||
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
167 |
end; |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
168 |
|
41709
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
169 |
structure Tasks = Table(type key = task val ord = task_ord); |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
170 |
structure Task_Graph = Graph(type key = task val ord = task_ord); |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
171 |
|
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
172 |
|
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
173 |
(* timing *) |
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
174 |
|
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
175 |
fun running task = |
62826 | 176 |
update_timing (fn t => fn (a, b, ds) => (a + t, b, ds)) task; |
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
177 |
|
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
178 |
fun joining task = |
62826 | 179 |
update_timing (fn t => fn (a, b, ds) => (a - t, b, ds)) task; |
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
180 |
|
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
181 |
fun waiting task deps = |
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
182 |
update_timing (fn t => fn (a, b, ds) => |
62826 | 183 |
(a - t, b + t, |
41702
dca4c58c5d57
Task_Queue.update_timing: more precise treatment of interruptibility;
wenzelm
parents:
41695
diff
changeset
|
184 |
if ! Multithreading.trace > 0 |
dca4c58c5d57
Task_Queue.update_timing: more precise treatment of interruptibility;
wenzelm
parents:
41695
diff
changeset
|
185 |
then fold (insert (op =) o name_of_task) deps ds else ds)) task; |
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
186 |
|
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
187 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
188 |
|
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
189 |
(** queue of jobs and groups **) |
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
190 |
|
41709
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
191 |
(* known group members *) |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
192 |
|
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
193 |
type groups = unit Tasks.table Inttab.table; |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
194 |
|
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
195 |
fun get_tasks (groups: groups) gid = |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
196 |
the_default Tasks.empty (Inttab.lookup groups gid); |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
197 |
|
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
198 |
fun add_task (gid, task) groups = |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
199 |
Inttab.update (gid, Tasks.update (task, ()) (get_tasks groups gid)) groups; |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
200 |
|
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
201 |
fun del_task (gid, task) groups = |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
202 |
let val tasks = Tasks.delete_safe task (get_tasks groups gid) in |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
203 |
if Tasks.is_empty tasks then Inttab.delete_safe gid groups |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
204 |
else Inttab.update (gid, tasks) groups |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
205 |
end; |
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
206 |
|
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
207 |
|
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
208 |
(* job dependency graph *) |
28165 | 209 |
|
210 |
datatype job = |
|
29365 | 211 |
Job of (bool -> bool) list | |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
212 |
Running of Thread.thread | |
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
213 |
Passive of unit -> bool; |
28165 | 214 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
215 |
type jobs = job Task_Graph.T; |
28176
01b21886e7f0
job: explicit 'ok' status -- false for canceled jobs;
wenzelm
parents:
28171
diff
changeset
|
216 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
217 |
fun get_job (jobs: jobs) task = Task_Graph.get_node jobs task; |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
218 |
fun set_job task job (jobs: jobs) = Task_Graph.map_node task (K job) jobs; |
28202
23cb9a974630
added focus, which indicates a particular collection of high-priority tasks;
wenzelm
parents:
28196
diff
changeset
|
219 |
|
32250 | 220 |
fun add_job task dep (jobs: jobs) = |
221 |
Task_Graph.add_edge (dep, task) jobs handle Task_Graph.UNDEF _ => jobs; |
|
222 |
||
28176
01b21886e7f0
job: explicit 'ok' status -- false for canceled jobs;
wenzelm
parents:
28171
diff
changeset
|
223 |
|
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
224 |
(* queue *) |
28176
01b21886e7f0
job: explicit 'ok' status -- false for canceled jobs;
wenzelm
parents:
28171
diff
changeset
|
225 |
|
68129 | 226 |
datatype queue = Queue of {groups: groups, jobs: jobs, urgent: int, total: int}; |
28165 | 227 |
|
68129 | 228 |
fun make_queue groups jobs urgent total = |
229 |
Queue {groups = groups, jobs = jobs, urgent = urgent, total = total}; |
|
230 |
||
231 |
val empty = make_queue Inttab.empty Task_Graph.empty 0 0; |
|
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
232 |
|
66378 | 233 |
fun group_tasks (Queue {groups, ...}) gs = |
234 |
fold (fn g => fn tasks => Tasks.merge (op =) (tasks, get_tasks groups (group_id g))) |
|
235 |
gs Tasks.empty |
|
236 |
|> Tasks.keys; |
|
237 |
||
41708 | 238 |
fun known_task (Queue {jobs, ...}) task = can (Task_Graph.get_entry jobs) task; |
239 |
||
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
240 |
|
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
241 |
(* job status *) |
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
242 |
|
59332 | 243 |
fun ready_job (task, (Job list, (deps, _))) = |
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
44299
diff
changeset
|
244 |
if Task_Graph.Keys.is_empty deps then SOME (task, rev list) else NONE |
59332 | 245 |
| ready_job (task, (Passive abort, (deps, _))) = |
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
44299
diff
changeset
|
246 |
if Task_Graph.Keys.is_empty deps andalso is_canceled (group_of_task task) |
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
44299
diff
changeset
|
247 |
then SOME (task, [fn _ => abort ()]) |
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
248 |
else NONE |
59332 | 249 |
| ready_job _ = NONE; |
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
250 |
|
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
251 |
fun ready_job_urgent false = ready_job |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
252 |
| ready_job_urgent true = (fn entry as (task, _) => |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
253 |
if pri_of_task task >= urgent_pri then ready_job entry else NONE); |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
254 |
|
59333
4ef80efc36c8
clarified active_job: take dependencies into account (e.g. future based on promise);
wenzelm
parents:
59332
diff
changeset
|
255 |
fun active_job (task, (Running _, _)) = SOME (task, []) |
4ef80efc36c8
clarified active_job: take dependencies into account (e.g. future based on promise);
wenzelm
parents:
59332
diff
changeset
|
256 |
| active_job arg = ready_job arg; |
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
257 |
|
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
258 |
fun all_passive (Queue {jobs, ...}) = is_none (Task_Graph.get_first active_job jobs); |
28165 | 259 |
|
68129 | 260 |
fun total_jobs (Queue {total, ...}) = total; |
261 |
||
28165 | 262 |
|
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
263 |
(* queue status *) |
32052 | 264 |
|
68129 | 265 |
fun status (Queue {jobs, urgent, total, ...}) = |
32052 | 266 |
let |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
267 |
val (x, y, z, w) = |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
268 |
Task_Graph.fold (fn (_, (job, (deps, _))) => fn (x, y, z, w) => |
32052 | 269 |
(case job of |
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
44299
diff
changeset
|
270 |
Job _ => if Task_Graph.Keys.is_empty deps then (x + 1, y, z, w) else (x, y + 1, z, w) |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
271 |
| Running _ => (x, y, z + 1, w) |
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
272 |
| Passive _ => (x, y, z, w + 1))) |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
273 |
jobs (0, 0, 0, 0); |
68129 | 274 |
in {ready = x, pending = y, running = z, passive = w, urgent = urgent, total = total} end; |
32052 | 275 |
|
276 |
||
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
277 |
|
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
278 |
(** task queue operations **) |
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
279 |
|
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
280 |
(* cancel -- peers and sub-groups *) |
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
281 |
|
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
282 |
fun cancel (Queue {groups, jobs, ...}) group = |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
283 |
let |
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
284 |
val _ = cancel_group group Exn.Interrupt; |
44341
a93d25fb14fc
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
wenzelm
parents:
44340
diff
changeset
|
285 |
val running = |
47404
e6e5750f1311
simplified Future.cancel/cancel_group (again) -- running threads only;
wenzelm
parents:
45642
diff
changeset
|
286 |
Tasks.fold (fn (task, _) => |
e6e5750f1311
simplified Future.cancel/cancel_group (again) -- running threads only;
wenzelm
parents:
45642
diff
changeset
|
287 |
(case get_job jobs task of Running thread => insert Thread.equal thread | _ => I)) |
e6e5750f1311
simplified Future.cancel/cancel_group (again) -- running threads only;
wenzelm
parents:
45642
diff
changeset
|
288 |
(get_tasks groups (group_id group)) []; |
44341
a93d25fb14fc
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
wenzelm
parents:
44340
diff
changeset
|
289 |
in running end; |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
290 |
|
37854
047c96f41455
back to more strict dependencies, even for canceled groups (reverting parts of 02936e77a07c);
wenzelm
parents:
37216
diff
changeset
|
291 |
fun cancel_all (Queue {jobs, ...}) = |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
292 |
let |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
293 |
fun cancel_job (task, (job, _)) (groups, running) = |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
294 |
let |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
295 |
val group = group_of_task task; |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
296 |
val _ = cancel_group group Exn.Interrupt; |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
297 |
in |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
298 |
(case job of |
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
299 |
Running t => (insert eq_group group groups, insert Thread.equal t running) |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
300 |
| _ => (groups, running)) |
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
301 |
end; |
44341
a93d25fb14fc
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
wenzelm
parents:
44340
diff
changeset
|
302 |
val running = Task_Graph.fold cancel_job jobs ([], []); |
a93d25fb14fc
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
wenzelm
parents:
44340
diff
changeset
|
303 |
in running end; |
32101
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
304 |
|
e25107ff4f56
support for nested groups -- cancellation is propagated to peers and subgroups;
wenzelm
parents:
32099
diff
changeset
|
305 |
|
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
306 |
(* finish *) |
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
307 |
|
68129 | 308 |
fun finish task (Queue {groups, jobs, urgent, total}) = |
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
309 |
let |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
310 |
val group = group_of_task task; |
43951 | 311 |
val groups' = fold_groups (fn g => del_task (group_id g, task)) group groups; |
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
312 |
val jobs' = Task_Graph.del_node task jobs; |
68129 | 313 |
val total' = total - 1; |
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
44299
diff
changeset
|
314 |
val maximal = Task_Graph.is_maximal jobs task; |
68129 | 315 |
in (maximal, make_queue groups' jobs' urgent total') end; |
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
316 |
|
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
317 |
|
54649
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
318 |
(* enroll *) |
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
319 |
|
68129 | 320 |
fun enroll thread name group (Queue {groups, jobs, urgent, total}) = |
54649
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
321 |
let |
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
322 |
val task = new_task group name NONE; |
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
323 |
val groups' = fold_groups (fn g => add_task (group_id g, task)) group groups; |
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
324 |
val jobs' = jobs |> Task_Graph.new_node (task, Running thread); |
68129 | 325 |
val total' = total + 1; |
326 |
in (task, make_queue groups' jobs' urgent total') end; |
|
54649
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
327 |
|
99b9249b3e05
more official task context via Task_Queue.enroll, which is required to participate in group cancellation (e.g. to terminate command exec);
wenzelm
parents:
53190
diff
changeset
|
328 |
|
28185
0f20cbce4935
simplified dequeue: provide Thread.self internally;
wenzelm
parents:
28184
diff
changeset
|
329 |
(* enqueue *) |
28165 | 330 |
|
68129 | 331 |
fun enqueue_passive group name abort (Queue {groups, jobs, urgent, total}) = |
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
332 |
let |
66166 | 333 |
val task = new_task group name NONE; |
43951 | 334 |
val groups' = fold_groups (fn g => add_task (group_id g, task)) group groups; |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
335 |
val jobs' = jobs |> Task_Graph.new_node (task, Passive abort); |
68129 | 336 |
val total' = total + 1; |
337 |
in (task, make_queue groups' jobs' urgent total') end; |
|
34277
7325a5e3587f
added Future.promise/fulfill -- promised futures that are fulfilled by external means;
wenzelm
parents:
32814
diff
changeset
|
338 |
|
68129 | 339 |
fun enqueue name group deps pri job (Queue {groups, jobs, urgent, total}) = |
28165 | 340 |
let |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
341 |
val task = new_task group name (SOME pri); |
43951 | 342 |
val groups' = fold_groups (fn g => add_task (group_id g, task)) group groups; |
28185
0f20cbce4935
simplified dequeue: provide Thread.self internally;
wenzelm
parents:
28184
diff
changeset
|
343 |
val jobs' = jobs |
41683
73dde8006820
maintain Task_Queue.group within Task_Queue.task;
wenzelm
parents:
41682
diff
changeset
|
344 |
|> Task_Graph.new_node (task, Job [job]) |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
345 |
|> fold (add_job task) deps; |
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
346 |
val urgent' = if pri >= urgent_pri then urgent + 1 else urgent; |
68129 | 347 |
val total' = total + 1; |
348 |
in (task, make_queue groups' jobs' urgent' total') end; |
|
28165 | 349 |
|
68129 | 350 |
fun extend task job (Queue {groups, jobs, urgent, total}) = |
29365 | 351 |
(case try (get_job jobs) task of |
68129 | 352 |
SOME (Job list) => SOME (make_queue groups (set_job task (Job (job :: list)) jobs) urgent total) |
29365 | 353 |
| _ => NONE); |
354 |
||
28185
0f20cbce4935
simplified dequeue: provide Thread.self internally;
wenzelm
parents:
28184
diff
changeset
|
355 |
|
0f20cbce4935
simplified dequeue: provide Thread.self internally;
wenzelm
parents:
28184
diff
changeset
|
356 |
(* dequeue *) |
0f20cbce4935
simplified dequeue: provide Thread.self internally;
wenzelm
parents:
28184
diff
changeset
|
357 |
|
68129 | 358 |
fun dequeue_passive thread task (queue as Queue {groups, jobs, urgent, total}) = |
39243
307e3d07d19f
Future.promise: more robust treatment of concurrent abort vs. fulfill (amending 047c96f41455);
wenzelm
parents:
39232
diff
changeset
|
359 |
(case try (get_job jobs) task of |
307e3d07d19f
Future.promise: more robust treatment of concurrent abort vs. fulfill (amending 047c96f41455);
wenzelm
parents:
39232
diff
changeset
|
360 |
SOME (Passive _) => |
307e3d07d19f
Future.promise: more robust treatment of concurrent abort vs. fulfill (amending 047c96f41455);
wenzelm
parents:
39232
diff
changeset
|
361 |
let val jobs' = set_job task (Running thread) jobs |
68129 | 362 |
in (SOME true, make_queue groups jobs' urgent total) end |
47423
8a179a0493e3
more robust Future.fulfill wrt. duplicate assignment and interrupt;
wenzelm
parents:
47404
diff
changeset
|
363 |
| SOME _ => (SOME false, queue) |
8a179a0493e3
more robust Future.fulfill wrt. duplicate assignment and interrupt;
wenzelm
parents:
47404
diff
changeset
|
364 |
| NONE => (NONE, queue)); |
39243
307e3d07d19f
Future.promise: more robust treatment of concurrent abort vs. fulfill (amending 047c96f41455);
wenzelm
parents:
39232
diff
changeset
|
365 |
|
68129 | 366 |
fun dequeue thread urgent_only (queue as Queue {groups, jobs, urgent, total}) = |
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
367 |
if not urgent_only orelse urgent > 0 then |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
368 |
(case Task_Graph.get_first (ready_job_urgent urgent_only) jobs of |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
369 |
SOME (result as (task, _)) => |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
370 |
let |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
371 |
val jobs' = set_job task (Running thread) jobs; |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
372 |
val urgent' = if pri_of_task task >= urgent_pri then urgent - 1 else urgent; |
68129 | 373 |
in (SOME result, make_queue groups jobs' urgent' total) end |
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
374 |
| NONE => (NONE, queue)) |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
375 |
else (NONE, queue); |
28202
23cb9a974630
added focus, which indicates a particular collection of high-priority tasks;
wenzelm
parents:
28196
diff
changeset
|
376 |
|
28165 | 377 |
|
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
378 |
(* dequeue wrt. dynamic dependencies *) |
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
379 |
|
68129 | 380 |
fun dequeue_deps thread deps (queue as Queue {groups, jobs, urgent, total}) = |
32055
6a46898aa805
recovered a version of dequeue_towards (cf. bb7b5a5942c7);
wenzelm
parents:
32052
diff
changeset
|
381 |
let |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
382 |
fun ready [] rest = (NONE, rev rest) |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
383 |
| ready (task :: tasks) rest = |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
384 |
(case try (Task_Graph.get_entry jobs) task of |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
385 |
NONE => ready tasks rest |
43792
d5803c3d537a
Table.lookup_key and Graph.get_entry allow to retrieve the original key, which is not necessarily identical to the given one;
wenzelm
parents:
41709
diff
changeset
|
386 |
| SOME (_, entry) => |
59332 | 387 |
(case ready_job (task, entry) of |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
388 |
NONE => ready tasks (task :: rest) |
45642 | 389 |
| some => (some, fold cons rest tasks))); |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
390 |
|
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
391 |
fun ready_dep _ [] = NONE |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
392 |
| ready_dep seen (task :: tasks) = |
41709
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
393 |
if Tasks.defined seen task then ready_dep seen tasks |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
394 |
else |
43792
d5803c3d537a
Table.lookup_key and Graph.get_entry allow to retrieve the original key, which is not necessarily identical to the given one;
wenzelm
parents:
41709
diff
changeset
|
395 |
let val entry as (_, (ds, _)) = #2 (Task_Graph.get_entry jobs task) in |
59332 | 396 |
(case ready_job (task, entry) of |
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
44299
diff
changeset
|
397 |
NONE => ready_dep (Tasks.update (task, ()) seen) (Task_Graph.Keys.dest ds @ tasks) |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
398 |
| some => some) |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
399 |
end; |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
400 |
|
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
401 |
fun result (res as (task, _)) deps' = |
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
402 |
let |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
403 |
val jobs' = set_job task (Running thread) jobs; |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
59333
diff
changeset
|
404 |
val urgent' = if pri_of_task task >= urgent_pri then urgent - 1 else urgent; |
68129 | 405 |
in ((SOME res, deps'), make_queue groups jobs' urgent' total) end; |
32055
6a46898aa805
recovered a version of dequeue_towards (cf. bb7b5a5942c7);
wenzelm
parents:
32052
diff
changeset
|
406 |
in |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
407 |
(case ready deps [] of |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
408 |
(SOME res, deps') => result res deps' |
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
409 |
| (NONE, deps') => |
41709
2e427f340ad1
more scalable collections of tasks, notably for totality of known group members;
wenzelm
parents:
41708
diff
changeset
|
410 |
(case ready_dep Tasks.empty deps' of |
41684
b828d4b53386
refined Task_Queue.dequeue_deps (more incremental);
wenzelm
parents:
41683
diff
changeset
|
411 |
SOME res => result res deps' |
41695
afdbec23b92b
eliminated slightly odd abstract type Task_Queue.deps;
wenzelm
parents:
41684
diff
changeset
|
412 |
| NONE => ((NONE, deps'), queue))) |
32055
6a46898aa805
recovered a version of dequeue_towards (cf. bb7b5a5942c7);
wenzelm
parents:
32052
diff
changeset
|
413 |
end; |
6a46898aa805
recovered a version of dequeue_towards (cf. bb7b5a5942c7);
wenzelm
parents:
32052
diff
changeset
|
414 |
|
62663 | 415 |
|
416 |
(* toplevel pretty printing *) |
|
417 |
||
62819
d3ff367a16a0
careful export of type-dependent functions, without losing their special status;
wenzelm
parents:
62663
diff
changeset
|
418 |
val _ = ML_system_pp (fn _ => fn _ => Pretty.to_polyml o Pretty.str o str_of_task); |
d3ff367a16a0
careful export of type-dependent functions, without losing their special status;
wenzelm
parents:
62663
diff
changeset
|
419 |
val _ = ML_system_pp (fn _ => fn _ => Pretty.to_polyml o Pretty.str o str_of_group); |
62663 | 420 |
|
41681
b5d7b15166bf
Future.join_results: discontinued post-hoc recording of dynamic dependencies;
wenzelm
parents:
41680
diff
changeset
|
421 |
end; |