You can use this function I wrote. You call GetTimeMs64(), and it returns the number of milliseconds elapsed since the unix epoch using the system clock – the just like time(NULL), except in milliseconds. It works on both windows and linux; it is thread safe. Note that the granularity is 15 ms on windows; on … Read more
It might be worth noting two years later (to help any future Rust programmers who stumble on this page) that there are now tools to benchmark Rust code as a part of one’s test suite. (From the guide link below) Using the #[bench] attribute, one can use the standard Rust tooling to benchmark methods in … Read more
#include <iostream> #include <cstdio> #include <ctime> int main() { std::clock_t start; double duration; start = std::clock(); /* Your algorithm here */ duration = ( std::clock() – start ) / (double) CLOCKS_PER_SEC; std::cout<<“printf: “<< duration <<‘\n’; }
The heap usage comes from the C++ standard library. It allocates memory for internal library use on startup. If you don’t link against it, there should be zero difference between the C and C++ version. With GCC and Clang, you can compile the file with: g++ -Wl,–as-needed main.cpp This will instruct the linker to not … Read more
Here are some up-to-date albeit narrow findings of mine with GCC 4.7.2 and Clang 3.2 for C++. UPDATE: GCC 4.8.1 v clang 3.3 comparison appended below. UPDATE: GCC 4.8.2 v clang 3.4 comparison is appended to that. I maintain an OSS tool that is built for Linux with both GCC and Clang, and with Microsoft’s … Read more
I’ve been working with OO MATLAB for a while, and ended up looking at similar performance issues. The short answer is: yes, MATLAB’s OOP is kind of slow. There is substantial method call overhead, higher than mainstream OO languages, and there’s not much you can do about it. Part of the reason may be that … Read more
If you actually want to benchmark real world code, use tools like Xdebug and XHProf. Xdebug is great for when you’re working in dev/staging, and XHProf is a great tool for production and it’s safe to run it there (as long as you read the instructions). The results of any one single page load aren’t … Read more
https://dev.mysql.com/doc/refman/8.0/en/insert-optimization.html The time required for inserting a row is determined by the following factors, where the numbers indicate approximate proportions: Connecting: (3) Sending query to server: (2) Parsing query: (2) Inserting row: (1 × size of row) Inserting indexes: (1 × number of indexes) Closing: (1) From this it should be obvious, that sending one … Read more
Rough results from the following benchmark: 2x write, 3x read. Here’s a simple benchmark in python you can adapt to your purposes, I was looking at how well each would perform simply setting/retrieving values: #!/usr/bin/env python2.7 import sys, time from pymongo import Connection import redis # connect to redis & mongodb redis = redis.Redis() mongo … Read more
Nevermind. The “length failure” merely indicates that about half the time the length of the response was different. Since the contents are dynamic, it’s probably the session identifier or something like that.