This technical whitepaper by veteran real-time instructor David Kalinsky examines the queueing calculations that should be done as part of the design of application software for embedded systems using a real-time operating system. These calculations serve to properly configure message queues, linked lists, ring buffers, memory pools and partitions. Both capacity and queueing time issues are discussed, with emphasis on practical examples rather than mathematical proofs.
Whitepaper: “Queueing Calculations for Real-Time OS Users”
Submitted by David Kalinsky 2004-03-15 OS News 4 Comments
When will we ever SEE REAL practical USES for examples?
In other words, will we ever really see a full real time computer (remember, the OS is apart of the computer, you can’t have your cake and eat it too.).
You mean like in those robotic arms that assembled your car/computer/fridge/whatever?
When you read almost all articles, for example about creating compiler, they will never give you real, working example, but something nonexistent (like virtual machine), that has nothing to do with reality.
Actually, that isn’t true. Sometimes papers are just theory, and sometimes the idea has also been implemented in which case the paper will usually describe how well the theory worked in practise.
And John Galt, theory always comes before implementation. If you only want to see implemented stuff, it’s best not to read technical papers and just stick with beta announcements.