acconsta

9 ms·

31.
by acconsta 11y ago
Hello! I think it's possible to encapsulate unsafe pointer operations so they're only required in memory allocation, I/O primitives, and device DMA. I'll open a github issue or two with thoughts. Out of curiosity, are yo
32.
by acconsta 11y ago
In the current Redox design, everything runs in privileged mode, so it's kind of the ultimate monolith?
33.
by acconsta 11y ago
Along with iOS ad blocking, this seems like a big shift in Apple's stance toward Google.
34.
by acconsta 11y ago
That looks excellent. What hardware?
35.
by acconsta 11y ago
I know this is a young project, but right now it looks like a terrible waste of Rust's features. Raw pointers everywhere, most allocations unchecked, and 264 unsafes in just the kernel. unsafe is a necessary escape hatch, but the t
36.
by acconsta 11y ago
>I could probably write a lengthy blog post on our experiences of C++ vs Java I'd be interested in reading that. There's still a lot of FUD around using C++ for new projects.
37.
by acconsta 11y ago
>the code usually doesn't even pretend to work It does pretend to work for a while, often failing in another function, in another file, with a cryptic message. All preventable by a simple type check.
38.
by acconsta 11y ago
Already exists for memcached! https://github.com/scylladb/seastar/wiki/Memcached-Benchmark
39.
by acconsta 11y ago
On Windows
40.
by acconsta 11y ago
So it comes down to historical compatibility with B? Wow.
41.
by acconsta 11y ago
Do any IDEs support large (million+ LOC) code bases?
42.
by acconsta 11y ago
Yeah, although I don't know how parallel it is because OCaml. I think they might have gotten a multiprocess architecture working?
43.
by acconsta 11y ago
Very interesting, thanks
44.
by acconsta 11y ago
Source? How do you get 80% CPU utilization if you have to physically separate all your job types? http://csl.stanford.edu/~christos/publications/2015.heracles...
45.
by acconsta 11y ago
For... building software? I thought dependent types haven't escaped research languages.
46.
by acconsta 11y ago
Yeah... so it seems like Linux containers can be sufficiently hardened?
47.
by acconsta 11y ago
Take a look at sched_setaffinity and Intel DPDK.
48.
by acconsta 11y ago
Google built multi-row transactions on top of a partitioned row store though? I guess I'm not really sure which applications have a shared memory architecture like the one you're describing. And to be fair, some people are pretty
49.
by acconsta 11y ago
Yeah, I get the impression Linus fucking hates GCC :P That's good though. Compiler freedom is better for everyone.
50.
by acconsta 11y ago
Me too. I've been thinking about doing an analogous benchmark in C++ for a while.
51.
by acconsta 11y ago
No, but the Gmail team might be worried about some Russian guy finding a buffer overflow in YouTube's application. Then what? They can escalate privileges and read your email?
52.
by acconsta 11y ago
It's not quite plug-and-play, but it does seem like there's been some progress. https://lwn.net/Articles/644681/
53.
by acconsta 11y ago
You can still offer isolated transactions, tunable consistency, etc. within a shard though, which Cassandra does. And yes, you can write high performance Java, but for whatever reasons the Cassandra codebase isn't an example of that.
54.
by acconsta 11y ago
Are linux containers really not securable? That's how Google runs all their stuff in production. http://research.google.com/pubs/pub43438.html
55.
by acconsta 11y ago
Oh, oops. 471, 508 679, 766.
56.
by acconsta 11y ago
What's weird is five hours after asking that question, no one has provided a reasonable explanation of why C requires arrays to become pointers on function boundaries. My "online search" found Walter Bright, who knows a thing
57.
by acconsta 11y ago
You can pass structs by value. Why not arrays?
58.
by acconsta 11y ago
Right. I think that's mostly immutable containers though, right? Or is the compiler smarter than that?
59.
by acconsta 11y ago
OK, data definitely helps. It's not always easy to predict what modern CPUs will do! For the record, there seem to be a lot of bounds checking independent of indexing: https://github.com/rust-lang/rust/blob&#x
60.
by acconsta 11y ago
Cassandra's performance scales linearly with the number of nodes though, so per-node performance definitely matters. Probably not 10x, but probably not 1x either.

More ›