Also, for FB6 quad-core implementation, the processing time decreases with 212 particles.
Using the optimized implementation, the global processing time was reduced by a factor equal to 4.7.
The neural network training was implemented in MathWorks MATLAB®, and the application of the trained network was done by a custom made C++ implementation, for fast processing time.
A parallel implementation reduces the processing time only if the number of node computers satisfies the inequity: begin{aligned} k>frac{nt_i }{nt_i -t_d -frac{t_c }{m}} end{aligned} (8)and begin{aligned} nt_i -t_d -frac{t_c }{m}>0 end{aligned} (9)For a continues mode of operation which is typical for dynamic environments the value of (t_{c}/m) is negligible.
On a resource-constrained TMoteSky device [41] using a 8 MHz processor, the current packet conversion implementation requires a processing time of less than 1 ms. By delegating common tasks, such as buffer management, packet creation, QoS management and aggregation, IDRA network services require up to a factor 2-10 less memory than traditional network protocols.
Section "Evaluation methodology and algorithm imple-mentation" details the evaluation methodology, provides a first algorithm implementation and analyzes this implementation in terms of processing time.
Because of its low implementation complexity and fast processing time, we use the Clark-Wright Savings algorithm [44].
Parallel implementation can decrease the processing time of these steps, which leads to higher performance in object tracking due to higher processed frames per second.
We have tested this client/server implementation with over 500 client processes, and the processing time scales very well.
Fortunately, real-time implementation is possible, because the processing time is smaller than the data length.
