-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmultithread.py
108 lines (73 loc) · 2.73 KB
/
multithread.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
## multithread.py ##############################################################
## testing out pythons multithread module ######################################
################################################################################
##from multiprocessing.dummy import Pool as ThreadPool
import threading
import time
from random import shuffle
def getPrimesBetween(checkRange):
primesList = []
start = checkRange["start"]
finish = checkRange["finish"]
for p in range(start, finish):
for i in range(2, p):
if p % i == 0:
break
else:
primesList.append(p)
return primesList
class returnableThread(threading.Thread):
def __init__(self, group=None, target=None, name=None,
args=(), kwargs={}, Verbose=None):
threading.Thread.__init__(self, group, target, name, args, kwargs, Verbose)
self._return = None
def run(self):
if self._Thread__target is not None:
self._return = self._Thread__target(*self._Thread__args, **self._Thread__kwargs)
def join(self):
threading.Thread.join(self)
return self._return
if(__name__ == "__main__"):
##pool = ThreadPool(4)
##results = pool.map(getPrimesBetween, [{"start": 2, "finish": 8000}, {"start": 8001, "finish": 16000}, {"start": 16001, "finish": 24000}])
##pool.close()
##pool.join()
##print "Started prime searching pool"
##print len(getPrimesBetween(2, 80000))
# do some stuff
##download_thread = threading.Thread(target=getPrimesBetween, args=({"start": 2, "finish": 16000},))
##download_thread.start()
results = []
primeSearchRanges = []
rangeWidth = 2500
startValue = 2
for i in range(10):
primeSearchRanges.append({"start": startValue, "finish": startValue+(rangeWidth - 1)})
startValue += rangeWidth
pendingThreads = []
for searchRange in primeSearchRanges:
pendingThreads.append(returnableThread(target=getPrimesBetween, args=(searchRange,)) )
shuffle(pendingThreads)
totalThreadCount = len(pendingThreads)
##primeCalcThread = ThreadWithReturnValue(target=getPrimesBetween, args=({"start": 2, "finish": 26000},))
# continue doing stuff
##primeCalcThread.start()
print "waiting for primes to finish calculating"
activeThreads = []
finishedThreads = []
while(True):
if(len(activeThreads) < 1):
## oddly changing this cutoff doesnt appear to have any real effect
if(pendingThreads != []):
activeThreads.append(pendingThreads.pop())
activeThreads[-1].start()
for thread in activeThreads:
if(not thread.isAlive()):
results.append(thread.join())
finishedThreads.append( activeThreads.pop(activeThreads.index(thread)) )
print len(results)
if(len(finishedThreads) == totalThreadCount):
break
for primeSet in results:
print primeSet
##print primeCalcThread.join()