fmstephe

13 ms·

91.
by fmstephe 11y ago
Thanks, I feel like I am being a bit thick here. Would it be fair to say that happens-before consistent is a property of every java program. And sequentially consistent is a property of every java program without data-races? (ignoring unsaf
92.
by fmstephe 11y ago
Ok, I am trying to get this of terminology straight. My source for rigorous threading theory comes from 'The Art of Multiprocessor Programming'. There they detail the linearisable and serialisable properties. Does any wise soul ha
93.
Gopher Fest (Live Feed)(youtube.com)
1 points by fmstephe 11y ago|0 comments
94.
by fmstephe 11y ago
Great, thanks Steve.
95.
by fmstephe 11y ago
I apologise in advance that this may not be most appropriate place to ask this question. I am looking for a Rust tutorial. It looks like there was one, but it was deprecated in favour of 'the book'. But 'the book' doesn&
96.
by fmstephe 11y ago
Can you expand on why "window scaling needs to be OS-global to avoid flapping". I have googled it and a I got to http://en.wikipedia.org/wiki/Route_flapping and I couldn't work out how this related to TC
97.
by fmstephe 11y ago
I agree that it looks like we will end up with a much larger, and less universally applicable, toolbox of abstractions. Feels like a fun time to be programming, while we search for the right set of abstractions. :)
98.
by fmstephe 11y ago
That is a very fair statement. It is certainly true that threads are a more successful abstraction than garbage collection. Perhaps a better statement is to observe that garbage collection has improved continuously over time and expanded th
99.
by fmstephe 11y ago
I think this is a really important observation. There was a very interesting discussion between Cliff Click and Rich Hickey (linked at bottom). The highlight of it for me was Cliff Click suggesting that people often assume that because we u
100.
by fmstephe 12y ago
My apologies for being so unobservant :)
101.
by fmstephe 12y ago
Is this open-source? If it is could you post a link to a public repo. Thanks :)
102.
Can you solve the maths question for Singapore school kids?(theguardian.com)
9 points by fmstephe 12y ago|2 comments
103.
by fmstephe 12y ago
The Glass Bead Game - Herman Hesse Read when I was about 14. I just remember the way it excited my mind.
104.
by fmstephe 12y ago
Nitsan Wakart gave two presentations about lock free queues. https://skillsmatter.com/legacy_profile/nitsan-wakart#skills... I gave a talk on simple versions of those queues in London. https://skillsmatter.c
105.
by fmstephe 12y ago
A fun article. But, it seems odd to me that almost all of the focus in lock free queues are unbounded linked-list based implementations. Unbounded size is usually undesirable in production systems. It's a fine property to have sometime
106.
Too much too young, should schooling start at age 7?(newscientist.com)
3 points by fmstephe 12y ago|0 comments
107.
by fmstephe 12y ago
There is a very good FIFO-ish queue which is much simpler than this. It would be interesting to compare their performance on real machines. FIFO-ish queue -- We allocate a fairly large array of pointers (make it a power of two if you need a
108.
by fmstephe 12y ago
I am not a C++ developer. My understanding was that c++ const was found severely lacking for complex structures? I know that java's final is worthless in this scenario. Can anyone elaborate on how effective c++'s const is for this
109.
Cameron wants to ban encryption(theguardian.com)
3 points by fmstephe 12y ago|0 comments
110.
Metaphone 3 support (BSD license interpretation discussion)(github.com)
1 points by fmstephe 12y ago|0 comments
111.
The Plot Against Public Education(politico.com)
2 points by fmstephe 12y ago|0 comments
112.
by fmstephe 12y ago
I was really thinking that the lack of drift in these clocks means we don't need to periodically sync them. If they are synced initially, without a network, we can rely on them indefinitely.
113.
by fmstephe 12y ago
Can any wise person comment on the potential impact of this on distributed systems? If they were cheap enough to pop in a server.
114.
by fmstephe 12y ago
I doubt that anyone was offended. But you will find a very strong negative reaction to jokes in the comments. I think there is a (very wise) desire to avoid a reddit type culture that rewards extended jokes and similar things. This may well
115.
by fmstephe 12y ago
Can anyone explain the use of 'round-robin' to describe mulit-node scenarios and 'fill-first' for single node scenarios. I initially assumed they were describing thread schedulers, but that doesn't make clear sense
116.
by fmstephe 12y ago
The finance sector produces a lot of low level code driving business applications directly. But, broadly you are right I think.
117.
by fmstephe 12y ago
It's such a shame. The Intel one is our best chance to get HTM under my desk. Alas :)
118.
by fmstephe 12y ago
There has been a CPU with transactional memory running big business servers. The Vega boxes from Azuul (~800 cores) running their JVMs. I know of two good internet discussions available talking about their real world experience using them G
119.
by fmstephe 12y ago
That's a good point and often passed over when talking about C4. It's a real shame, because that is a fairly large sticking point. There was an attempt to get the kernel changes needed by C4 pushed into the standard kernel, but I
120.
by fmstephe 12y ago
Another big downside to pools is that a lot of GC implementations will scan only 'live'objects. Large object pools unnaturally increase the number of objects that need to be scanned during GC, negating a (sometimes) useful GC effi

More ›