sdfghjklkjhgfds sdfghjiuy
Oct 5th, 2011, 09:01 PM
1. could you have it when you hit search to run till either all pids are found that meat the requirements or the stop button is pressed instead of stopping on the 1st pid
2. i assume the search used a leaner search method to find the pid would it be to time consuming to have multiple cores/threads each handle a part of the search (most useful for shiny pid searches)
eg with quad core (assumed pids must be 9 digits long)
core 1 looks through pid 100000000-250000000
core 2 looks through pid 250000001-500000000
core 3 looks through pid 500000001-750000000
core 4 looks through pid 750000001-999999999
// i know the code looks nothing like this but i it supposed to be readable
PidSegment=max PID/number of cores
for(var i in cores){//i assume i will be 0 1st time
core[i+1] process 1*i to PidSegment*i
}
2. i assume the search used a leaner search method to find the pid would it be to time consuming to have multiple cores/threads each handle a part of the search (most useful for shiny pid searches)
eg with quad core (assumed pids must be 9 digits long)
core 1 looks through pid 100000000-250000000
core 2 looks through pid 250000001-500000000
core 3 looks through pid 500000001-750000000
core 4 looks through pid 750000001-999999999
// i know the code looks nothing like this but i it supposed to be readable
PidSegment=max PID/number of cores
for(var i in cores){//i assume i will be 0 1st time
core[i+1] process 1*i to PidSegment*i
}