-
Notifications
You must be signed in to change notification settings - Fork 178
Expand file tree
/
Copy pathtest_queue.py
More file actions
241 lines (187 loc) · 7.75 KB
/
test_queue.py
File metadata and controls
241 lines (187 loc) · 7.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
# SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.
# SPDX-License-Identifier: Apache-2.0
from __future__ import annotations
from collections import Counter
from collections.abc import ItemsView
from data_designer.engine.dataset_builders.scheduling.queue import FairTaskQueue, QueueView
from data_designer.engine.dataset_builders.scheduling.resources import (
SchedulableTask,
SchedulerResourceKey,
SchedulerResourceRequest,
TaskGroupKey,
TaskGroupSpec,
stable_task_id,
)
from data_designer.engine.dataset_builders.scheduling.task_model import Task
class _FailIfScannedAmounts(dict[SchedulerResourceKey, int]):
locked: bool = False
def items(self) -> ItemsView[SchedulerResourceKey, int]:
if self.locked:
raise AssertionError("QueueView should use incremental accounting for non-candidate tasks.")
return super().items()
def _task(column: str, row_index: int) -> Task:
return Task(column=column, row_group=0, row_index=row_index, task_type="cell")
def _group(name: str, *, weight: float = 1.0, admitted_limit: int | None = None) -> TaskGroupSpec:
return TaskGroupSpec(
key=TaskGroupKey(kind="local", identity=(name,)),
weight=weight,
admitted_limit=admitted_limit,
)
def _item(column: str, row_index: int, group: TaskGroupSpec | None = None) -> SchedulableTask:
task = _task(column, row_index)
group = group or _group(column)
return SchedulableTask(
task_id=stable_task_id(task),
payload=task,
group=group,
resource_request=SchedulerResourceRequest({"submission": 1}),
)
def _select_and_commit(queue: FairTaskQueue) -> SchedulableTask | None:
selection = queue.select_next(lambda _item, _view: True)
if selection is None:
return None
return queue.commit(selection)
def test_fair_task_queue_equal_groups_round_robins() -> None:
queue = FairTaskQueue()
queue.enqueue(
[
_item("a", 0),
_item("a", 1),
_item("b", 0),
_item("b", 1),
_item("c", 0),
_item("c", 1),
]
)
selected = [_select_and_commit(queue) for _ in range(6)]
assert [item.payload.column for item in selected if item is not None] == ["a", "b", "c", "a", "b", "c"]
def test_fair_task_queue_weighted_groups() -> None:
queue = FairTaskQueue()
queue.enqueue(
[_item("a", i, _group("a", weight=2)) for i in range(6)]
+ [_item("b", i, _group("b", weight=1)) for i in range(6)]
)
selected = [_select_and_commit(queue) for _ in range(6)]
counts = Counter(item.payload.column for item in selected if item is not None)
assert counts == {"a": 4, "b": 2}
def test_select_next_is_non_mutating_until_commit() -> None:
queue = FairTaskQueue()
first = _item("a", 0)
second = _item("b", 0)
queue.enqueue([first, second])
selection = queue.select_next(lambda _item, _view: True)
assert selection is not None
assert queue.view().queued_total == 2
committed = queue.commit(selection)
assert committed == first
assert queue.view().queued_total == 1
def test_commit_rejects_stale_selection() -> None:
queue = FairTaskQueue()
first = _item("a", 0)
queue.enqueue([first])
selection = queue.select_next(lambda _item, _view: True)
assert selection is not None
queue.enqueue([_item("b", 0)])
assert queue.commit(selection) is None
assert queue.view().queued_total == 2
def test_select_next_uses_scheduler_eligibility_callback() -> None:
queue = FairTaskQueue()
queue.enqueue([_item("a", 0), _item("b", 0)])
selection = queue.select_next(lambda item, _view: item.payload.column == "b")
assert selection is not None
assert selection.item.payload.column == "b"
assert queue.commit(selection) == selection.item
def test_enqueue_is_idempotent_by_task_id() -> None:
queue = FairTaskQueue()
group = _group("a")
task = _task("a", 0)
item = SchedulableTask(
task_id=stable_task_id(task),
payload=task,
group=group,
resource_request=SchedulerResourceRequest({"submission": 1, "llm_wait": 2}),
)
first = queue.enqueue([item])
second = queue.enqueue([item])
view = queue.view()
assert first == (item.task_id,)
assert second == ()
assert view.queued_total == 1
assert view.queued_by_group == {group.key: 1}
assert view.queued_resource_demand_by_group == {group.key: {"submission": 1, "llm_wait": 2}}
assert view.queued_peer_demand_by_resource == {"submission": 1, "llm_wait": 2}
def test_discard_where_removes_matching_tasks() -> None:
queue = FairTaskQueue()
queue.enqueue([_item(column, i) for column in ["a", "b"] for i in range(2)])
queue.discard_where(lambda item: item.payload.column == "a")
selected = [_select_and_commit(queue) for _ in range(2)]
assert [item.payload.column for item in selected if item is not None] == ["b", "b"]
assert _select_and_commit(queue) is None
def test_queue_view_exposes_group_and_resource_demand() -> None:
queue = FairTaskQueue()
group = _group("a")
task = _task("a", 0)
item = SchedulableTask(
task_id=stable_task_id(task),
payload=task,
group=group,
resource_request=SchedulerResourceRequest({"submission": 1, "llm_wait": 1}),
)
queue.enqueue([item])
view: QueueView = queue.view()
assert view.queued_total == 1
assert view.queued_by_group[group.key] == 1
assert view.queued_resource_demand_by_group[group.key]["llm_wait"] == 1
assert view.first_candidate_resources_by_group[group.key]["submission"] == 1
def test_queue_view_updates_incremental_accounting_after_removals() -> None:
queue = FairTaskQueue()
first_group = _group("a")
second_group = _group("b")
first = SchedulableTask(
task_id=stable_task_id(_task("a", 0)),
payload=_task("a", 0),
group=first_group,
resource_request=SchedulerResourceRequest({"submission": 1, "llm_wait": 2}),
)
second = SchedulableTask(
task_id=stable_task_id(_task("b", 0)),
payload=_task("b", 0),
group=second_group,
resource_request=SchedulerResourceRequest({"submission": 1, "llm_wait": 3}),
)
third = SchedulableTask(
task_id=stable_task_id(_task("b", 1)),
payload=_task("b", 1),
group=second_group,
resource_request=SchedulerResourceRequest({"submission": 1, "local": 1}),
)
queue.enqueue([first, second, third])
queue.discard(first.task_id)
committed = _select_and_commit(queue)
assert committed == second
view = queue.view()
assert view.queued_total == 1
assert first_group.key not in view.queued_by_group
assert view.queued_by_group == {second_group.key: 1}
assert view.queued_resource_demand_by_group == {second_group.key: {"submission": 1, "local": 1}}
assert view.queued_peer_demand_by_resource == {"submission": 1, "local": 1}
def test_queue_view_uses_incremental_accounting_for_non_candidate_tasks() -> None:
queue = FairTaskQueue()
group = _group("a")
first = _item("a", 0, group)
amounts = _FailIfScannedAmounts({"submission": 1})
task = _task("a", 1)
second = SchedulableTask(
task_id=stable_task_id(task),
payload=task,
group=group,
resource_request=SchedulerResourceRequest(amounts),
)
queue.enqueue([first, second])
amounts.locked = True
view = queue.view()
assert view.queued_total == 2
assert view.queued_by_group == {group.key: 2}
assert view.queued_resource_demand_by_group == {group.key: {"submission": 2}}
assert view.first_candidate_resources_by_group == {group.key: {"submission": 1}}
assert view.queued_peer_demand_by_resource == {"submission": 2}