# timing Published articles for timing. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## From slow tests to slow production: Debugging with Stackprof DevFeed: [From slow tests to slow production: Debugging with Stackprof]() Original publisher: [Read original article]() Published: 2026-08-13T00:00:00Z Content type: tutorial Language: en Sources: [Aha! Engineering Blog]() Topics: [debugging](), [Tooling](), [RSpec](), [Databases]() Tags: [ci](), [cpu-time](), [database](), [debugging](), [logs](), [overhead](), [performance](), [production-debugging](), [profiling](), [rspec](), [snapshots](), [tests](), [timing]() ### AI overview An investigation into tests that became six times slower traces the stall to code generating example data and Active Record callbacks. The article explains using Stackprof with RSpec to profile the test, including I/O time, and reports that the test spent 71% of its time sleeping. ### Source excerpt One morning, a developer announced in our Slack channel that some tests were failing on our main branch. The cause of the failures was not obvious. No recent PRs seemed related, and neither the code nor the tests had changed in a long time. The test ## Deciding Whether to Continue a Stagnating Software Project in the AI Era DevFeed: [Deciding Whether to Continue a Stagnating Software Project in the AI Era]() Original publisher: [Read original article]() Author: Mike Yerou Published: 2026-03-31T12:48:11Z Content type: opinion Language: en Sources: [Rock and Null]() Topics: [Artificial Intelligence](), [Software](), [Users](), [data]() Tags: [ai](), [business](), [data](), [software](), [thoughts](), [timing](), [users]() ### AI overview The article examines the difficulty of deciding whether to continue a software project that has users and some traction but is neither a clear failure nor a clear success. It argues that rapidly changing AI tools and markets make waiting riskier, while retention data, intuition, and current traction can inform the choice between continuing and moving on. ### Source excerpt Most projects don't fail spectacularly; they just linger in the "middle." In a fast-moving AI era, deciding if your current traction is enough to keep going, or if it's time to move on. ## Per-worker, and global, IO bandwidth in explain plans DevFeed: [Per-worker, and global, IO bandwidth in explain plans]() Original publisher: [Read original article]() Author: depesz Published: 2026-02-21T13:24:57Z Content type: article Language: en Sources: [select \* from depesz;]() Topics: [PostgreSQL](), [IO](), [parallel]() Tags: [analyze](), [execution](), [explain](), [explain-depesz-com](), [io](), [parallel](), [plan](), [postgresql](), [speed](), [timing](), [uncategorized](), [worker]() ### AI overview This article explains how PostgreSQL explain plans can report per-worker and global I/O bandwidth during parallel execution. It describes how summed worker timings differ from wall-clock time and introduces an exclusive-time bandwidth figure for the disks' total workload. ### Source excerpt Jeremy Schneider suggested a change to how plans are displayed - adding another bit of information in case we have timing information for IO for explain node. Took me a while to research, but it finally made it's way... Let's consider this simple plan. In it's Parallel Seq Scan node we see: -> Parallel Seq ... Continue reading "Per-worker, and global, IO bandwidth in explain plans" ## Getting comfortable with psql DevFeed: [Getting comfortable with psql]() Original publisher: [Read original article]() Author: Map Published: 2024-11-11T15:57:56Z Content type: tutorial Language: en Sources: [Craig Kerstiens]() Topics: [Command-line interface](), [Database]() Tags: [cli](), [commands](), [config](), [database](), [pager](), [postgres](), [psql](), [query](), [tables](), [timing](), [vim]() ### AI overview A practical introduction to getting comfortable with psql, the PostgreSQL command-line interface. It covers utility commands, describing tables, configuration options, query timing, output formatting, pager settings, and editing queries with an external editor. ### Source excerpt psql is a CLI editor that ships with Postgres. It's incredibly powerful for working with Postgres, and doesn't take too much of a learning curve to start to get comfortable so you can really feel like an expert working with your database. Just a rundown of a few things to get you started: Once connected in psql you can get an idea of all utility commands available with: \? A handy thing I use all the time is \d. \d will describe the tables within database. You can also add a table/index/etc. onto it to describe that specific table such as: \d accounts There are a number of options you can set in your psqlrc (config) file to customize your CLI experience. But you can also toggle those when directly working in psql. \timing will give you the time it took to run your query \x auto will autoformat your text output \pset pager 0 turns off your pager or 1 to turn it back on Oh and for editing a query in your editor of choice. Make sure you set your $EDITOR enviroment variable to the editor of your choice, though the only right choice is vim: \e Just a few things to get you started working with psql. Your browser does not support video ## Leap Seconds and GNSS Time Offsets DevFeed: [Leap Seconds and GNSS Time Offsets]() Original publisher: [Read original article]() Published: 2021-08-03T08:03:10Z Content type: article Language: en Sources: [Bert Hubert's writings]() Topics: [systems](), [navigation]() Tags: [gnss](), [timing](), [utc]() ### AI overview The article explains how GNSS systems handle leap seconds. GPS, Galileo, and BeiDou use continuous monotonic timescales and broadcast their offsets from UTC so receivers can derive UTC accurately. ### Source excerpt Leap seconds are controversial things. Since the Earth does not rotate at a steady rate, over time the Earth could get ahead or behind "atomic time". Whatever solution you propose for this, someone is going to be unhappy. I take no position on what the best thing to do is here, except that one day I would like to do the math on the "great leap second gyroscopes" that we could mount near the poles to steady the Earth's rotation, so we can stop talking about this. ## Review of the Uputronics GPS/RTC Raspberry Pi Expansion Board DevFeed: [Review of the Uputronics GPS/RTC Raspberry Pi Expansion Board]() Original publisher: [Read original article]() Published: 2020-07-09T11:38:00Z Content type: comparison Language: en Sources: [Bert Hubert's writings]() Topics: [Raspberry Pi](), [Hardware](), [Monitoring]() Tags: [configuration](), [gnss](), [measurements](), [pi-4](), [raspberry-pi](), [receiver](), [review](), [timing]() ### AI overview A review of Uputronics' GPS/RTC Raspberry Pi Expansion Board, tested with the galmon.eu GNSS monitoring project. The board uses a u-blox M8 timing receiver, provides raw GNSS and correlator data, and offers a stable clock signal. The review also covers antenna performance, Raspberry Pi 4 configuration, UART communication, and baud-rate considerations. ### Source excerpt Hi everyone, Disclaimer: this is a review of a free sample I got sent by Uputronics. I recently spotted on Twitter that Uputronics had launched a GPS/RTS Raspberry Pi Expansion Board, and that they were looking for worthy projects to test it. I thought our Galileo/GPS/BeiDou/GLONASS monitoring project galmon.eu might be worthy and Uputronics agreed. Relevant for our purposes, this is an actual 'timing receiver'. Any GNSS chip will get you a location, but some of them go the extra mile to also deliver a very stable clock signal. ## The July Galileo Outage: What happened and why DevFeed: [The July Galileo Outage: What happened and why]() Original publisher: [Read original article]() Published: 2019-11-07T08:48:53Z Content type: article Language: en Sources: [Bert Hubert's writings]() Topics: [navigation](), [systems]() Tags: [atomic](), [clocks](), [gnss](), [orbit](), [outage](), [performance](), [precision](), [systems](), [technical-article](), [timing]() ### AI overview An excerpt examines the July Galileo outage, explaining how GNSS operation depends on accurately modeling satellite orbits and atomic clocks and distinguishing errors in satellite, clock, and ground timing data. ### Source excerpt By bert hubert / bert@hubertnet.nl This post is an excerpt of a far longer post on Galileo, its structures and the cause of the outage. Here we'll only focus on the outage - the potential underlying reasons behind it are described in the full article. Since the week-long outage in July I've been fascinated by Galileo and, together with a wonderful crew of developers, experts and receiver operators, have learned so much about what I now know are called 'Global Navigation Satellite Systems' or GNSS. ## JavaScript animation loop DevFeed: [JavaScript animation loop]() Original publisher: [Read original article]() Author: Stanko Published: 2018-03-18T00:00:00Z Content type: tutorial Language: en Sources: [Stanko Tadić]() Topics: [JavaScript](), [Three.js](), [Game Development](), [Web Development]() Tags: [animation](), [game-development](), [javascript](), [javascript-animation](), [three-js](), [timing]() ### AI overview This tutorial explains why frame-count-based JavaScript animations can run at the wrong speed when requestAnimationFrame is delayed or throttled. It shows how to use elapsed, or delta, time to maintain movement at the intended rate, using a three.js game-animation context. ### Source excerpt I've been really busy lately, doing both work and pet projects. At the moment I'm playing with three.js trying to clone old DOS game to JavaScript. Games (and animations in general) need animation loop in which we are going to update the scene and re-render it. Example animations are simplified and they just move a box 60px per second. But the concepts applied are universal and can be used for more complicated real life cases. Timing problem # We all know that animating should be done using requestAnimationFrame. My first attempt ended up being naive and it looked something like this: const box = document.querySelector('.Box'); // Initial position let position = 0; function animate() { // Updating scene logic // moving box for one pixel per frame // "requestAnimationFrame" is optimized for 60fps // so we should get smooth movement of 60px per second position += 1; // Render updated scene box.style.transform = `translateX(${ position }px)`; // Start next frame requestAnimationFrame(animate); } // Start animation animate(); At the first glance this looks fine. But it has one major problem. requestAnimationFrame is usually triggered 60 times per second, but often this is not the case. For example, the most browsers will pause it if tab goes to background. Busy (or low-end) CPU will also slow it down. Imagine for some reason that is does get triggered only 10 times per second.In the example bellow I faked it by using 100ms setTimeout. In that case our box will be moved by 1px every 100ms, ending up on 10px per second. This means our animation speed is relative to how many times requestAnimationFrame is called per second. That is the big timing problem we are trying to solve. Our animation should calculate the right position based on time passed, rather then just incrementing it by 1px each update. Delta time to the rescue # Now we know what to do - adjust the position based on time passed between two updates. Every time we are doing the update, we are going to calculate ## Hospital Ransomware DevFeed: [Hospital Ransomware]() Original publisher: [Read original article]() Author: Adam Published: 2017-05-13T00:00:00Z Content type: opinion Language: en Sources: [Shostack & Friends Blog]() Topics: [ransomware](), [Cybersecurity](), [Security](), [Test automation]() Tags: [automation](), [patches](), [ransomware](), [security](), [test-automation](), [timing]() ### AI overview A commentary on hospital ransomware and patch timing argues that attack risk may overtake patch-related risk at around 10 days, while improved test automation and attack frameworks could shorten that interval. It also notes that organizations using older technology often lack the test automation needed for rapid smoke testing. ### Source excerpt [no description provided] ## Timing Tests in Python For Fun and Profit DevFeed: [Timing Tests in Python For Fun and Profit]() Original publisher: [Read original article]() Author: Haki Benita Published: 2016-11-08T22:00:00Z Content type: tutorial Language: en Sources: [Haki Benita]() Topics: [Python](), [test]() Tags: [articles](), [django](), [performance](), [python](), [reporting](), [testing](), [tests](), [timing]() ### AI overview A Python tutorial on finding slow tests by measuring test execution time, reporting tests that exceed a threshold, and building custom unittest result and runner classes to produce a consolidated report without modifying existing test cases. ### Source excerpt Hunting down slow tests by reporting tests that take longer than a certain threshold (Because the first step to better test performance is awareness!) ## Teaching an LSTM to Play Beethoven DevFeed: [Teaching an LSTM to Play Beethoven]() Original publisher: [Read original article]() Published: 2015-07-01T00:00:00Z Content type: tutorial Language: en Sources: [Alex Korbonits]() Topics: [MIDI](), [Code](), [Lua](), [GPU]() Tags: [audio](), [channel](), [code](), [experiment](), [format](), [gpu](), [lstm](), [lua](), [music](), [structure](), [timing](), [torch](), [training](), [types](), [velocity]() ### AI overview An experiment trains Karpathy's char-rnn LSTM on Beethoven piano sonata MIDI files, treating the raw MIDI bytes as a sequence. The author describes prepending a shared MIDI header to generated output so players could interpret it, and reports imperfect results containing occasional phrase-like and melodic fragments. ### Source excerpt In June 2015, I trained Karpathy's char-rnn on a corpus of Beethoven piano sonata MIDI files. Here's what it sounds like -- and how I got it to play. ## Timing-safe memcmp and API parity DevFeed: [Timing-safe memcmp and API parity]() Original publisher: [Read original article]() Author: Nate Lawson Published: 2014-06-24T12:03:33Z Content type: opinion Language: en Sources: [rdist]() Topics: [API](), [C](), [Optimization](), [vulnerability](), [ordering]() Tags: [api](), [assembly](), [branch-prediction](), [c](), [cache](), [compiler](), [cpu](), [developers](), [optimization](), [ordering](), [performance](), [security](), [timing]() ### AI overview The article discusses OpenBSD's timing-safe bcmp and memcmp APIs. It supports simpler constant-time equality comparison but questions timing-safe ordered comparison because compiler and CPU behavior may undermine its guarantees and because ordering secret data can indicate larger architectural problems. ### Source excerpt OpenBSD released a new API with a timing-safe bcmp and memcmp. I strongly agree with their strategy of encouraging developers to adopt "safe" APIs, even at a slight performance loss. The strlcpy/strlcat family of functions they pioneered have been immensely helpful against overflows. Data-independent timing routines are extremely hard to get right, and the farther you are from ... Continue reading Timing-safe memcmp and API parity