This would not work for floating point arithmetic in computing. The order in which you perform a calculation changes the outcome, since not every number can be precisely represented by the IEEE 754 standard.
This reminds me of a kind of intelligence scale ive seen before: First there are stupid people, and then there are stupid people who know they are stupid, then there are smart people who think they are smart, and…
The stack head pointers can be swapped and flushed without knowing how much data is in it. However, if you need to know the count/size... Then in general you must accept that the count/size of the write stack is…
Im sure im not the first to have done something like this for logging or buffering in general, but im not aware of any writeups. Information on lock free data structures and the caveats (they are extremely difficult to…
I think you misunderstand the CAS operation. It performs an atomic compare and swap on a pointer (32 or 64 bits), so obviously it requires no coordination to switch out the head pointer of a stack. For example, on an…
Unfortunately no, thus far i have only implemented it in a commercial context as part of a high frequency trading system.
Another approach is just to use two stacks, one for writing and one for flushing. User threads write log lines directly to buffers from an allocator usually via a TLS mediated stream. The use of an allocator avoids…
I just put a similar response in another post, but its just as appropriate here... If you want to know how C++ can be better, you should take a look at at the Reason C++ framwork, especially if you have never seen C++…
If your currently in an apoplectic fit as to why people don't love C++, const correctness, boost, and the standard library, then read no further. For those with a slightly broader perspective and an inquisitive mind,…
This would not work for floating point arithmetic in computing. The order in which you perform a calculation changes the outcome, since not every number can be precisely represented by the IEEE 754 standard.
This reminds me of a kind of intelligence scale ive seen before: First there are stupid people, and then there are stupid people who know they are stupid, then there are smart people who think they are smart, and…
The stack head pointers can be swapped and flushed without knowing how much data is in it. However, if you need to know the count/size... Then in general you must accept that the count/size of the write stack is…
Im sure im not the first to have done something like this for logging or buffering in general, but im not aware of any writeups. Information on lock free data structures and the caveats (they are extremely difficult to…
I think you misunderstand the CAS operation. It performs an atomic compare and swap on a pointer (32 or 64 bits), so obviously it requires no coordination to switch out the head pointer of a stack. For example, on an…
Unfortunately no, thus far i have only implemented it in a commercial context as part of a high frequency trading system.
Another approach is just to use two stacks, one for writing and one for flushing. User threads write log lines directly to buffers from an allocator usually via a TLS mediated stream. The use of an allocator avoids…
I just put a similar response in another post, but its just as appropriate here... If you want to know how C++ can be better, you should take a look at at the Reason C++ framwork, especially if you have never seen C++…
If your currently in an apoplectic fit as to why people don't love C++, const correctness, boost, and the standard library, then read no further. For those with a slightly broader perspective and an inquisitive mind,…