libera/commonlisp - IRC Chatlog
Search
9:37:23
madnificent
Shinmera: I'll check out Luckless. I'm looking for/at benchmarks and info now but may not find the benchmarks you mention. If you have a direct link, that'd be rad. I'm not sure what I'll learn exactly but I hope it will give me a rough idea on what to test for.
9:58:44
madnificent
The readme states that the implementation is based off NonBlockingHashMap and its Common Lisp port in Luckless. But perhaps that's more "we read it".
10:01:10
mfiano
"Improved" I suppose would depend on usage patterns, machine, and operating environment.
10:02:33
mfiano
hayley says it may have a bug and not recommended for use yet, but I still don't see that mentioned in the readme
10:04:29
madnificent
I should care about safety first, so by the time we're at the element of speed, this may be better known.
11:49:51
madnificent
mfiano: I should have asked this way earlier. mu-cl-resources has a lot of multithreading going on in suboptimal ways too. These hash-tables might make a difference for the caches it uses.
12:30:58
hayley
madnificent: Another difference is that resizing in Threadmill is not lock free, whereas it is in Luckless.
12:32:24
hayley
I basically made up the resize logic on the spot, so I'm not so sure it's correct...but it should be, based on what I watched about NonBlockingHashMap.
12:33:11
hayley
I think there might be a bug because decentralise2 sometimes drops like 1 in 10 million messages when using Threadmill, but not any other table. I'll test again tomorrow.
12:40:30
hayley
Really, I do need to get my shit together w.r.t Telekons projects. There is also the concurrent-hash-tables portability library (which is portable in that it handles Luckless, Threadmill, and a table with sharded locks), but I haven't thought of a way to specify which table implementation to use at system load time.
13:01:41
madnificent
hayley: for mu-cl-resources the drops wouldn't be the worst. this is about caching so if a cache isn't stored it'll be calculated again at another time. not clearing would be more challenging.
13:02:42
hayley
And FWIW I don't exactly know that "it drops values randomly"; I only know that decentralise2 drops messages, which might or might not have to do with the table dropping values.
13:03:11
hayley
It might not even have to do with the table at all - just going faster with concurrent programs might lead to more opportunities to expose a bug.
13:04:05
hayley
Oh, well, such is life. And I intend to simplify the code around the table, so we'll get to find out where the bug lays.
13:05:46
madnificent
also, i failed to find the time to further check out your work, but we're running a company around distributed web tech. mostly knowledge sharing with linked data, which is what ActivityPub is built on. we also co-run ipfs-search. if these 90's buzzwords or hipster-tech ring a bell and relate to your work do ping.
13:07:33
hayley
I guess so - Netfarm is what you'd get if you gave IPFS schemas and some methods, and I've written a few (not very nice) things about the Fediverse.
13:17:38
madnificent
so we do a lot in terms of letting people define knowledge in a distributed fashion and sharing that. for instance, adding data to legislation. we have no clue what they'll add, but we can make sure they'll understand each other after the fact. that seems an important piece for distributed knowledge. would love to read about your negs as it helps me see faster where you want to go to :D
13:19:13
hayley
Okay, I wrote something about protocol translation (rather than schema translation, which looked hyped at one time), but it's not very good.
13:19:39
mfiano
hayley: If it's the table it shouldn't be difficult to produce an isolated test for that
13:20:14
hayley
mfiano: Yeah, probably. Wouldn't hurt to port the Luckless tests to my portability library.
13:21:07
hayley
http://lettingthedaysgoby.altervista.org/translate-what-data/ and http://lettingthedaysgoby.altervista.org/translate-what-data/the-drive-to-2021.html
13:21:55
hayley
Right. I only use one AVX2 instruction (VPBROADCASTB) with 128 bit code, and I hope that's not buggy :)
13:23:05
mfiano
Also i would read conditionalize that library. Having something SBCL specific isn't much use, as its a moving target as it is lately
13:24:36
hayley
It's SBCL-specific for the foreseeable future (no SIMD anywhere else?) so I would advise using Luckless instead.
13:28:24
hayley
The only thing going for Threadmill, now that Luckless is catching up in performance, is that I find Threadmill to work better with a lot of "churn" in adding and removing new mappings.
13:47:05
hayley
The SIMD probing lets you skip over a lot of dead entries (which I can't reuse sadly - tried it, proof doesn't hold up), so you can run with a larger load factor and probe length with no problems.
14:09:14
lisp123
pjb: Thanks, that makes sense (leaving it client code) and definitely some advanced use cases, I guess not for daily use otherwise
18:20:06
lisp123
Is there a way to get the compiler notes from SLIME (that pop up when one C-c C-k's a file) during the ASDF load-file process?
18:32:56
scymtym
the *slime-compilation* buffer generally contains printed representations of these conditions (and can visit the corresponding source locations)
19:48:44
varjag
let's say i have a list of pairs in some container P, and these individual pairs can also be referenced elsewhere
19:49:33
varjag
i then have some 'child' container C, that can shadow some of these pairs (because its car or cdr are changed)
19:51:11
varjag
and i want the code referencing pairs in P use the values that are shadowed by C if C is supplied
19:52:50
varjag
rn am thinking to do shadowing in C via alist (keyed by original pairs of P) but it's not very pretty
19:58:06
Alfr
varjag, if P doesn't change while C is relevant, you could equip C with the same interface as P but with modifications only stored in C and reads backed by P if there's nothing appropriate in C.
20:06:04
Alfr
varjag, you might want to look up persistent data structures; maybe there's something suitable out there already?
20:07:22
varjag
well i can surely graft something but would really love some memory efficient solution
20:52:48
nature
Is there a way to change the permission bits of a UNIX file other than with (uiop:run-program "chmod something something") ?