Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
fmstephe
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
17 ms
·
121.
▲
by
fmstephe
12y ago
A technique along similar lines is to run your upfuckery implementation on multiple servers and have each of them publish the results. Then you can take the output of the first server, and discard the rest. This can be effective at weeding
122.
▲
by
fmstephe
12y ago
In the financial space the Zing JVM from Azul is very popular, at least it is among the London developers. http://www.azulsystems.com/ It has a pauseless generational collector called C4 (which is detailed in the Garbage Co
123.
▲
by
fmstephe
12y ago
Yes, that is a fair comment. It really does need a better README, and some comments in the code.
124.
▲
by
fmstephe
12y ago
I would work on my matching engine in Go. https://github.com/fmstephe/matching_engine It is just pure fun. The goal would be to hit 6 million transactions per second over the network. Currently finishing up the inter-t
125.
▲
CoreOS now available on Google Compute Engine
(googlecloudplatform.blogspot.co.uk)
2 points
by
fmstephe
12y ago
|
0 comments
126.
▲
by
fmstephe
12y ago
It's a very tricky collection of definitions. All descriptions of it are a bit vague. For instance under lock-free on wikipedia we read "An algorithm is lock-free if it satisfies that when the program threads are run sufficiently
127.
▲
by
fmstephe
12y ago
I take my hat off to you a-priori
128.
▲
by
fmstephe
12y ago
The definition for lock free written there is the same as the one I wrote above. The crucial sentence is found in the second paragraph. Where non-blocking is the umbrella term covering both lock, wait and obstruction free algorithms. "
129.
▲
by
fmstephe
12y ago
I am curious about your definition of wait-free and lock-free. There are a number of conflicting definitions for these two terms floating around the internet. If we take a very simple problem, incrementing a shared counter and doing some ot
130.
▲
by
fmstephe
12y ago
In this particular case you should be able to use no-op instructions to spin without consuming much power. Since the consumer only spins when the queue is empty we know there will be space on the ring buffer and producers won't be impa
131.
▲
by
fmstephe
12y ago
If you want to see an implementation along the lines that jhallenworld describes Martin Thomson has some very high quality implementations here in Java. These are just single producer, single consumer queues https://github.com&#x
132.
▲
The Disruptor has been ported (very alpha) to Go
(github.com)
1 points
by
fmstephe
12y ago
|
0 comments
133.
▲
by
fmstephe
12y ago
I think that Yossi's point was the the non-programmer writes at a very low level of abstraction and this is a great virtue. Although there is a great deal of nuance to this debate I fall more and more on his side of it. I think that on
134.
▲
by
fmstephe
12y ago
As a java developer I can say that his list of sins very nearly is our list of best practices. I think that the programming culture has a big impact here. Yossi's complaints are typically about C++ programmers, and I can't comment
135.
▲
by
fmstephe
12y ago
I like this idea, the UI is fast and nice to use. I built something similar. The idea was to be able to play multiplayer games with people nearby. My motivation was simply to enable face to face two player games as the easiest option. The t
136.
▲
by
fmstephe
13y ago
https://www.youtube.com/watch?v=KXuZi9aeGTw That might be the talk you are thinking about. I am keeping an eye on this. If we can have our cake and eat too w.r.t green threads and performance I will be very happy.
137.
▲
by
fmstephe
13y ago
I too am always on the lookout for the equivalent of this for the clarinet. My wife plays, but with two children in an English house it's hard to practice. If you do find something promsing give me a buzz. I would be very grateful.
138.
▲
by
fmstephe
13y ago
Have they indicated how they plan to get adoption?
139.
▲
by
fmstephe
13y ago
What market is the mill aiming for? Servers, phones, desktop or all of the above?
140.
▲
by
fmstephe
13y ago
I am curious about how you deal with matches that are not exact? > if a value exists at that key you fill the order (or partial fill) If there is an existing sell for 100 and a buy comes in for 101 your hash will miss the 100 entry, do
141.
▲
by
fmstephe
13y ago
Can you post a link to some discussion around this? A google didn't turn up anything obvious. Thanks.
142.
▲
by
fmstephe
13y ago
While I wouldn't want to defend HFT on any moral grounds we are at least seeing some of the technology leaking out into open source. https://github.com/OpenHFT While I don't like the role of HFT in modern markets
143.
▲
by
fmstephe
13y ago
This looks like a wonderful initiative. I hope they succeed, I always have hope that we it is possible to offer some alternative to our mainstream education, which can be painful if you fall outside of the mainstream. As a side note it'
144.
▲
by
fmstephe
13y ago
It loads fine for me. In Chrome 28 Windows. Plus, very nice. I really enjoyed this :)
145.
▲
by
fmstephe
13y ago
Right, that looks like the thing that I missed. Thanks for the link :)
146.
▲
by
fmstephe
13y ago
That has to be a misprint. although it appears to be spread all over the place. If you took photos at full resolution all you would achieve is using up all your disk space and making it harder to sync with other devices etc. Unless I have r
147.
▲
by
fmstephe
13y ago
Is there a place where we can get this fact checked. I ask because this is cementing my opinion about, and fear of, the United States and I would love to know how true this all is.
148.
▲
by
fmstephe
13y ago
Are you writing this on your own? If you are on your own then any methodology will probably be inappropriate. Most methodologies expend most of their energy (and rightly so) coordinating communication between team members, stake holders. Fo
149.
▲
by
fmstephe
13y ago
As a side note the solution to the Discard problem is quite beautiful. https://code.google.com/p/go/source/detail?r=4b61f121966b As I read it makes a quick-try to acquire a pre-allocated buffer, otherwise mak
150.
▲
by
fmstephe
13y ago
Ok, the declarative and idempotency sounds great. But consider this one use case. I want to stop a service, upgrade it to a new version, restart that service. The service is an application which I wrote that runs in apache tomcat. 1:
More ›