Delphi Cookbook - Third Edition

There's more...

Showing dynamically changing data is always a challenge, and is a typical synchronization problem if you have to read from a blocking and very fast data source; however, using queues in an efficient way can help to reach the correct architecture. If you have very high concurrency (many consumers or many producers), or a very high producer speed compared to the consumer's speed, you may have some performance improvements using lock-free data structures.

Unluckily, in Delphi, there are no ready-to-use lock-free data structures; however, there are very good libraries, even open source, that implement it in the context of multithreaded programming. One of the most popular libraries, although, at the time of writing, it is only ...