This is a common use case, and most implementations use TensorFlow’s queues to decouple the preprocessing code from the training code. There is a tutorial on how to use queues, but the main steps are as follows: Define a queue, q, that will buffer the preprocessed data. TensorFlow supports the simple tf.FIFOQueue that produces elements … Read more
Sorry that this isn’t directly answering your question, but generally speaking you shouldn’t rely too heavily on measuring latency because it can be quite variable. Not only that, you don’t know if the ping time you measure is even symmetrical, which is important. There’s no point applying 10ms of latency correction if it turns out … Read more
You can’t do this from JS. What you could do is this: client –AJAX– yourserver –ICMP ping– targetservers Make an AJAX request to your server, which will then ping the target servers for you, and return the result in the AJAX result. Possible caveats: this tells you whether the target servers are pingable from your … Read more
The Google Code project does reference a technical paper on the implementation of the ring buffer, however it is a bit dry, academic and tough going for someone wanting to learn how it works. However there are some blog posts that have started to explain the internals in a more readable way. There is an … Read more
Just tested latency from Java on my Corei5 2.8GHz, only single byte send/received, 2 Java processes just spawned, without assigning specific CPU cores with taskset: TCP – 25 microseconds Named pipes – 15 microseconds Now explicitly specifying core masks, like taskset 1 java Srv or taskset 2 java Cli: TCP, same cores: 30 microseconds TCP, … Read more
For macOS, there is the Network Link Conditioner that simulates configurable bandwidth, latency, and packet loss. It is contained in the Additional Tools for Xcode package.
Linux AIO (sometimes known as KAIO or libaio) is something of a black art where experienced practitioners know the pitfalls but for some reason it’s taboo to tell someone about gotchas they don’t already know. From scratching around on the web and experience I’ve come up with a few examples where Linux’s asynchronous I/O submission … Read more
Numbers everyone should know 0.5 ns – CPU L1 dCACHE reference 1 ns – speed-of-light (a photon) travel a 1 ft (30.5cm) distance 5 ns – CPU L1 iCACHE Branch mispredict 7 ns – CPU L2 CACHE reference 71 ns – CPU cross-QPI/NUMA best case on XEON E5-46* 100 ns – MUTEX lock/unlock 100 ns … Read more
Because of the size, you’ll surely want to load the file in the background to avoid blocking the event dispatch thread; SwingWorker is a common choice. Instead of using a Document, consider updating a TableModel and displaying the lines of text in the rows of a JTable. This offers several advantages: Results will begin appearing … Read more