-
Notifications
You must be signed in to change notification settings - Fork 13
/
data_loader.py
108 lines (88 loc) · 3.9 KB
/
data_loader.py
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
# -*- coding: utf-8 -*-
"""
MIT License
Copyright (c) 2017 sli
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
"""
import time
from queue import Queue as th_queue
from thread_pool import thread_pool
class data_loader:
def __init__(self, n_workers, load_func, max_interval=15, min_interval=5e-2):
self._n_workers = n_workers
self._thread_pool = thread_pool(n_workers + 1)
self._task_queue = th_queue()
self._oqueue = th_queue()
self._closed = th_queue()
self._max_interval = max_interval
self._min_interval = min_interval
def func_wrapper(*args, **kwargs):
self._oqueue.put(load_func(*args, **kwargs))
self._func_wrapper = func_wrapper
self._thread_pool.add_task(self._manage)
def _get(self, *args, **kwargs):
"""
不保证结果与调用的顺序性,用于随机数据加载
"""
osize = self._oqueue.qsize()
self._task_queue.put((args, kwargs, osize))
return self._oqueue.get()
def __enter__(self):
return self._get
def __exit__(self, *args, **kwargs):
self._closed.put(1)
self._thread_pool.wait_completion()
def _manage(self):
interval = 1.0
n_new_tasks = 0.0
osize = 0
while self._closed.qsize() == 0:
n_wait_tasks = self._thread_pool.tasks.qsize()
tps = (n_new_tasks - n_wait_tasks) / interval
if n_wait_tasks > 0:
interval *= (1.0 + 0.2 * n_wait_tasks/self._n_workers)
if interval > self._max_interval:
interval = self._max_interval
elif osize < self._n_workers:
interval *= 0.6
if interval < self._min_interval:
interval = self._min_interval
n_new_tasks = self._task_queue.qsize()
n_added_tasks = 0
for i in range(n_new_tasks):
args, kwargs, osize = self._task_queue.get()
for j in range(1 + self._n_workers//(n_wait_tasks + osize + 1)):
self._thread_pool.add_task(self._func_wrapper, *args, **kwargs)
n_added_tasks += 1
if tps > 0:
print("<%.5f s> \033[1;33m%.4f t/s\033[0m \033[1;31m!%d\033[0m \033[1;32m+%d/%d\033[0m \033[1;34m%d\033[0m"%(interval, tps, n_wait_tasks, n_added_tasks, n_new_tasks, osize))
n_new_tasks = n_added_tasks + n_wait_tasks #这里n_new_tasks变成总等待任务数量
time.sleep(interval)
print("\033[1;31mCLOSING......\033[0m")
if __name__ == "__main__":
import time
def func(s, interval):
time.sleep(interval)
return s
with data_loader(n_workers=3, load_func=func) as data:
for i in range(1000):
d = data(i, 0.5)
print("inx: %d | ret: %d"%(i, d))
if i > 150 and i < 400:
time.sleep(0.1)
else:
time.sleep(0.2)