sikuli-driver team mailing list archive

[RaiMan <question272304@xxxxxxxxxxxxxxxxxxxxx>]

Question #272304 on Sikuli changed:
https://answers.launchpad.net/sikuli/+question/272304

    Status: Open => Answered

RaiMan proposed the following answer:
if you delegate the background observe of each image to a different
region, then you will create 1000 threads, that are processed in
parallel.

having for example a 4 processor system, the elapsed time until completion of the last observe will be roughly 250 times the time of one individual search, since observing is very greedy on cpu time.
Finding at least one of them is the statistical mean value: 250/2 meaning 125.

So if you take 0.3 seconds for an individual search it will last on
average about 40+ seconds, to find at least one.

You have to add the time to setup 1000 threads (no idea what that costs)
and some other parallel processing overhead.

But if you tell me more about your intention, I could tell you more
about possible ways to go with SikuliX.

-- 
You received this question notification because your team Sikuli Drivers
is an answer contact for Sikuli.