liblfds

6 ms·

1.
by liblfds 10y ago
> Honest question: why do you think that's a useful usecase? I worked for three years on software used by telcos. Carrier grade - they were rigourous about change control and validation, because bugs were totally unacceptable. For
2.
by liblfds 10y ago
Yes. As I understand it, this requires either that every to-be-inlined function is present in the public header file, so it can be #included into every user source file which wishes to use those functions, so they turn up in the object file
3.
by liblfds 10y ago
Make that "one" then :-) I don't actually know know of others, but I know there are a range of other PRNGs which run on single-word states, so they might be viable. Thankyou! I see many flaws in the library though - ther
4.
by liblfds 10y ago
> Is it safe to say then that distinctions such as "lock free" and "wait free" always refer to data structures and not algorithms then? Well, for what my thoughts are worth, I would say no, not inherently and catagori
5.
by liblfds 10y ago
What do you mean by interlocked queue? On Windows, the atomic instrinsic APIs all begin with "interlocked", and although I'm not sure what you mean, it's making me think of that.
6.
by liblfds 10y ago
> Well, the solution to that is to maintain branches of your code for each major version change and to only introduce breakages in major versions. That is what is being done. Versioning is GCC style, "[major].[minor].[bugfix]"
7.
by liblfds 10y ago
Because until recently, the library was license-free. Licenses are important as a concept . Licenses can exist, and when they do, they must be honoured. They are an aspect of the property rights of the owner of the software. That doesn&#
8.
by liblfds 10y ago
I think you mean Treiber, right? typo with the "n". In 1986, on an IBM mainframe, published a white paper describing how to implement a lock-free stack (which is also a freelist, of course). It was the first lock-free data stru
9.
by liblfds 10y ago
> On Linux and maybe Solaris you can use ELF symbol versioning. Remember that the library supports bare metal platforms. It is intended to be used in the absence of an operating system. I'm afraid I'm not sure I undersand what
10.
by liblfds 10y ago
> And when I integrate a new release, how do I verify that > you didn't accidentally change one of the older numbered > versions of your code? They're only released once. No release is changed after its release. Once
11.
by liblfds 10y ago
Lock-free red-black trees now existing in the literature. They were invented recently, about two or three years ago now. > And of outside of batch processing, who uses a binary tree without deletions? IME, it's surprising how often
12.
by liblfds 10y ago
> I never said licenses were not important: YOU SAID THAT. I thought you were saying I thought licenses were not important. I was trying to make it clear I think they are fundamentally important, by being an aspect of property right
13.
by liblfds 10y ago
Thankyou! I hope you're right :-)
14.
by liblfds 10y ago
It depends though where you're coming from. I write the library for the pleasure of it. I'm aiming to create something I think beautiful - for better or for worse, from other people's point of view :-) I'm not actuall
15.
by liblfds 10y ago
I went full-on, for documentation. Many, many years ago, back at Uni, a friend of mine received 100% for his Uni project. I could code many years before I went to Uni, but I was shallow in all other ways - all the ways in which we actual
16.
by liblfds 10y ago
You have to remember what I'm looking to achive here is that a new version can be released, and used, while the existing codebase using the old versions is utterly unchanged . The APIs are unchanged, the library they link to is uncha
17.
by liblfds 10y ago
I may be wrong, but I think an algorithm could only be considered in terms of locking or lock-free if multiple threads were through that algorithm performing work on the same data at the same time (and so potentially running into each other
18.
by liblfds 10y ago
> I can't just link to the new version and get the bug fixes. I think this isn't quite right, by omitting the down side - that you will be getting the not just the bug fixes, but new bugs . It's not all roses! What has o
19.
by liblfds 10y ago
That could work. ASCENDING and DESCENDING. I'll think it over (in the morning - I'm about comatose right now).
20.
by liblfds 10y ago
It's not very polite :-) "Licensing with attitude!"
21.
by liblfds 10y ago
The lock-free binary tree on two cores is about 2x faster than the next best method. On sixteen cores, about 20x faster. Why not use it, if it's packaged up in a library? it's only the difference between typing one API or anothe
22.
by liblfds 10y ago
No. Property rights are absolutely, profoundly, completely, totally, utterly central, vital, irreplacable and essential. Licenses are an offshoot of property rights. However , the arrangement of property rights as they are now being forc
23.
by liblfds 10y ago
I an of the view that it is a problem, but one which is almost wholly ignored and as such, not addressed. Generally, software projects version as you have described, based on breaking the external API. If the API is unchanged, the library
24.
by liblfds 10y ago
OTOH, you do know exactly what it does, without having to read any docs. I am of course open to suggestions for improvement.
25.
by liblfds 10y ago
My view is that all these, ah, parameters for licensing - what is or is not, copyright, public domain existing in some countries and not others, etc, etc - none of these are things I have chosen. They are being imposed upon me. This is no
26.
by liblfds 10y ago
Google's huge investment in AI. You'll be hearing a lot more of it in the future :-) ("Do you REALLY want to use that API? I think you should space your comments out a bit more. Hey, your battery is getting low! BTW, I&#x
27.
by liblfds 10y ago
To answer that, I need to basically explain the difference between lock-free and locking data structures. If we consider a locking data structure, say a binary tree using a mutex to serialise access, we see a couple of things; 1. when a thr
28.
by liblfds 10y ago
CAS or LL/SC is straightforward enough (although you have to be aware in your use of them of the differences between processors in terms of whether they lock cache lines, or have exclusive reservation granules, or per logical-core lock
29.
by liblfds 10y ago
I hope so. I applied to the GCC compiler farm late last year, but received a reply only after so long a time that I'd deleted the key pair I'd submitted because I thought nothing was going to happen - and my efforts to get back in
30.
by liblfds 10y ago
The libraries are not identical; I'm not particularly up to speed with CK, I'm not a user, but there's so much that can be done with any data structure library that there will be things liblfds has done which CK has not, and

More ›