frankmcsherry

12 ms·

61.
by frankmcsherry 8y ago
> 4. Any sort of refactoring that may adjust ownership. E.g. going from T to Rc<T>. GC requires fewer choices so these refactorings are easier. This pain is real. I've been using Rust for four years now, and it hasn't got
62.
by frankmcsherry 8y ago
1. Jon sits two desks away, right? ;) Re 2., I assumed (incorrectly, it seems) that virtual memory mappings can eventually spill to disk. If you grab 1/32 of RAM For the kernel, then you could only virtually map 16x RAM if the page tab
63.
by frankmcsherry 8y ago
I'm not at OSDI or I would have asked there, but: 1. Your skepticism for using Rust cites [26], the PLOS paper from the same people who did [27]. They've essentially recanted, in that their PLOS talk was right after Niko's ke
64.
by frankmcsherry 8y ago
Durability is a student's research project at the moment. It's up and running for "Spark" style computations but the work has broader ambitions. In essence, all of the internal state in DD are easily (automatically) seri
65.
by frankmcsherry 8y ago
Shameless plug for something that does all of these things (perhaps not exactly as you want, but ..) https://github.com/frankmcsherry/differential-dataflow
66.
by frankmcsherry 8y ago
In case you are sincerely interested, the literal very next section enumerates which other projects they borrow from and their corresponding directories in the repo. I'm sure you can come back with "the xv6 dependence is underspec
67.
by frankmcsherry 8y ago
To be pedantic, shouldn't you also need to rule out the possibility that x is a negative number? For example, x = -1 satisfies your quadratic equation, but because we are doing an odd power of x you can rule it out.
68.
by frankmcsherry 8y ago
This is a Rust version, btw: https://github.com/frankmcsherry/abomonation It still needs me to opt in to declaring methods as unsafe, rather than automatically surfacing my uses of unsafe. I could definitely &quo
69.
by frankmcsherry 8y ago
For people who want to fight about tracing vs ref-counting, please read this first, on how the two are dual and most collectors use both: http://www.cs.virginia.edu/%7Ecs415/reading/bacon-garbage.pd...
70.
by frankmcsherry 8y ago
You don't need rejection sampling, but you do need a loop. It is easier to see that a finite number of samples is not sufficient: If you have only a probability distribution defined by a product space where all distinguishable events h
71.
by frankmcsherry 8y ago
It's a super interesting post, and I've no reason to think that iterative deepening would be better, just that it is designed to deal with exactly this problem. The lack of growth in novel states may invalidate its main hypothesis
72.
by frankmcsherry 8y ago
https://en.wikipedia.org/wiki/Iterative_deepening_depth-firs... Edit: for context, wasn't meant to be "zomg how you so dumb" so much as "everyone should also read, cause is relevant".
73.
by frankmcsherry 8y ago
This seems like a very unfair reading of what the author actually wrote: > One note about the results for kdb+: The ingestion scripts I used for kdb+ partition/index the data on the year and passenger_count columns. This may give it
74.
by frankmcsherry 8y ago
To paraphrase: "if it were a good idea, my books would have discussed it." Are we done here?
75.
by frankmcsherry 8y ago
GraphX had an even-poorer showing in 2016 in the BigDatalog paper: http://yellowstone.cs.ucla.edu/~yang/paper/sigmod2016-p958.p... I wouldn't hold your breath on it getting faster. Edit: and if you are intere
76.
by frankmcsherry 8y ago
No, they did not only generate tuples in-memory for SABER. From the linked Flink blog post: > Databricks made a few modifications to the original benchmark, all of which are explained in their own post: > Removing Redis from step 5 &g
77.
by frankmcsherry 8y ago
I think the point is that there is no clear reason System A must do more work than System B. Serious Datalog environments will identify strictly monotonic programs and execute them more efficiently (e.g. with racy asynchrony); they wil
78.
by frankmcsherry 8y ago
I'm drinking at the moment, so maybe messy but not sad. The engine supports negation in the standard way: stratification. You can call 'from_antijoin' with a static relation for its second argument but not a variable. It is n
79.
by frankmcsherry 8y ago
How is this FAQ different from Elixir's FAQ?
80.
by frankmcsherry 9y ago
Obvs he's complaining that the video didn't cite his work. :) One of the differences between researchers and tinkerers unmentioned in the article: vanity.
81.
by frankmcsherry 9y ago
What you are looking for is "Private Information Retrieval". For the cube root result, check out: http://www.tau.ac.il/~bchor/PIR.pdf
82.
by frankmcsherry 9y ago
If anyone wants to read more, there are (pre this article) papers on cache friendly/oblivious priority queues, e.g. http://erikdemaine.org/papers/BufferTrees_STOC2002/paper.pdf The rough gist is that if the o
83.
by frankmcsherry 9y ago
You could probably just have a link that directs the reader to HN and posts a pre-filled "I have barely read about Rust, and it all seems over-complicated and ill-designed; convince me" comment.
84.
by frankmcsherry 9y ago
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366....
85.
by frankmcsherry 9y ago
I think what they are getting at is the following, which isn't a proof or anything (if you are looking for rules to follow, the much simpler "your model isn't differentially private" is probably even more accurate): Let
86.
by frankmcsherry 9y ago
> Those compilers performed nowhere near the level of optimization that modern compilers do. I think this gets at Wirth's law a bit. Yes compilers perform lots of optimizations now, but in Rust's case it is at least partly beca
87.
by frankmcsherry 9y ago
In my experience (with Rust programs that take 20mins+) it is all about the monomorphisation of generics. The great majority of the time is spent in LLVM, because Rust hands over many GB of LLVM IR for optimization, having done not very muc
88.
by frankmcsherry 9y ago
> In theory better targeted ads allow a company to spend it's advertising budget more effectively. I still don't see why customers want this. I would rather a company struggle to spend its ad budget effectively, and then conclu
89.
by frankmcsherry 9y ago
My understanding of how this shook out: https://www.reddit.com/r/rust/comments/7m99wo/outperforming_... tl;dr: the C and Rust versions had signed integers rather than unsigned like the ATS version, a
90.
by frankmcsherry 9y ago
In case anyone wants to check out some pre-history, back in 2002 Manfred Warmuth et al.[0] were using learning (Weighted Majority) to drive systems components like cache replacement policy. I'm not sure where the work went from there,

More ›