Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
sdab
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
sdab
2y ago
We (co-author here) are using EEVDF already since its in the latest mainline kernels. We havent noticed any major differences using the default settings, but plan to get around to tuning it later.
2.
▲
by
sdab
4y ago
I don't know what github is doing here, but I've seen this antipattern quite a few times in production at some big name companies...
3.
▲
by
sdab
6y ago
I am partial to the iPXE boot idea, you may find https://netboot.xyz useful. As for how to prepare the images, you need a ramfs image with the root filesystem as a cpio file and a kernel as a vmlinuz file. You then serve these i
4.
▲
by
sdab
10y ago
"That allows a single bit to potentially hold two values at once, or for two bits to hold four values at once. Keep scaling those numbers, and you quickly end up with a device that can process data exponentially faster than today’s com
5.
▲
by
sdab
11y ago
My question was about his claim in regards to the result in the paper. In practice, you are right but a consensus algorithm is still "partially correct" if it never decides on a value. It is only incorrect if different nodes decid
6.
▲
by
sdab
11y ago
You mean the OP's comment or mine? I agree with you if you mean the OP's comment. Though your quote refers to synchronized clocks. I dont think OP is referring to synchronized clocks, though your point that Lynch et al does not re
7.
▲
by
sdab
11y ago
"When used as a failure detector, timeouts are just a guess that something is wrong. (If they could, distributed algorithms would do without clocks entirely, but then consensus becomes impossible [10]." Having just re-read Lynch&#
8.
▲
by
sdab
11y ago
My understanding is that it is not enough to just be a "qbit based computer" to be able to solve QBP (i.e. perform shors algorithm to break RSA). These computers are quantum adiabatic computers which are indeed quantum in that the
9.
▲
by
sdab
11y ago
The article refers to 1180 MW of _power_. MW is joules/s and the unit of power is the watt (j/s). Your math talks about MegaWatt-Hours. These are often confused in articles, do you happen to know if that was the case in this artic
10.
▲
by
sdab
11y ago
I figured performance came into it also. It would be nice to see some performance numbers though.
11.
▲
by
sdab
11y ago
I was having trouble understanding why fixed-point arithmetic was particularly useful in game development. In fact, I was curious why fixed point representation was more useful than floating point at all... Two links deep, I found [1]. The
12.
▲
by
sdab
11y ago
If a user realized that the "cost" of viewing the image was free, wouldn't the user disregard the cost on future instances of the experiment? Did the experiment limit a user's participation to one time? Otherwise, the re
13.
▲
by
sdab
11y ago
The author (gahcep) and Stephan (STL, stl maintainer for microsoft) are on r/cpp. https://www.reddit.com/r/cpp/comments/3gd29t/c_internals_stl...
14.
▲
by
sdab
11y ago
Ah, yep I see the race. Here is a fix: https://gist.github.com/sdab/d7ba036b2b7f4b5626cd Thanks for the puzzle, its hard to find good concurrency problems. Edit: Looked through your solution. You are right, we thought
15.
▲
by
sdab
11y ago
My c++ solution: https://gist.github.com/anonymous/7e6cc8f58e9cde1b6fda I believe it follows all of the requirements. There is one glaring flaw which is that it uses a condition variable per 'wait_until_equal'
16.
▲
by
sdab
11y ago
Yep, its a nice problem. Reformulating it such that there are two possibilites (the coins are either different or the same) rather than four (permutations of two coins) is the way to solve the problem. I was going to post a hint rather than
17.
▲
by
sdab
11y ago
Interesting point about image search. In fact, when I perform a Google image search through disconnect and click on an image I see a record of it on google.com/history (while the search itself is not present). I suppose its only to be
18.
▲
by
sdab
11y ago
I also recently read my first Pratchett book after reading some excerpts from around the time he died. Im 5 books in now including having read Mort. On Reaper Man now.
19.
▲
by
sdab
11y ago
When I worked there, it was 12pm-8pm. My friends who work there now do the same. We just get to make our own hours and being in my twenties, I like sleeping in.
20.
▲
by
sdab
12y ago
I have similar goals of coding on the go. I used to use the method of carrying an extra battery, but now I use a chromebook running linux for my portable coding. It has great battery life (~10 hours, though battery not replaceable) and is q
21.
▲
by
sdab
12y ago
You guys mentioned having a test chef. Have you thought about reaching out to Kenji Alt? He writes a popular column for SeriousEats called FoodLab and evaluating a product like this would seem right up his alley. Take a look at his Turkey b
22.
▲
by
sdab
12y ago
I havent used Blueflood, so I couldnt say but it looks like an interesting project.
23.
▲
by
sdab
12y ago
In this case, I would still recommend Cassandra. It can easily handler the data sizes you mention as well as the write rates you imply further down the thread. Cassandra has a nice and simple architecture (every node is identical, no zookee
24.
▲
by
sdab
12y ago
It would be useful to know what "huge" means here. And how you want to look up the data. That said, I've used Cassandra in the past for timeseries data as one of the useful queries that can be made is a range query (if the co
25.
▲
by
sdab
12y ago
I'm more of a c++ programmer, but I think i can chime in on the mutex/pcond being "part" of the struct. Essentially, OP means that why arent they on chan's stack? In the struct you have pointers to mutex and pcond w
26.
▲
by
sdab
12y ago
Thanks for the links. Im aware of Andi's work and enjoy reading his posts on TSX. You're absolutely right about HLE vs HTM. Mostly I wish there was a better fallback than locking when transactions fail, but I suppose this is more
27.
▲
by
sdab
12y ago
In theory yes, though thinking in terms of transactions is subtly different from thinking in terms of threading critical sections. Particularly, they differ in how they handle contention. Locks block while transactions abort/fail. Simp
28.
▲
by
sdab
12y ago
As a systems guy who was intially very skeptical of Transactional Memory, I've been very excited about TSX for a while. Unfortunately, it seems that the initial implementation in the haswell processors wasnt very efficient[1]. Im looki
29.
▲
by
sdab
12y ago
While I agree with your premise of wanting a revolutionary approach, I think your solution is in the wrong direction. I think continuous testing would lead more to "teaching to the test". If anything, I think the revolutionary app
30.
▲
by
sdab
12y ago
You mention being easy to search, but I cant seem to find your site on google or duckduckgo (in case it was my historical disinterest for plants affecting google searches). I tried some combination of the keywords garden, nursery, seeds, pl
More ›