Re:The Cost of Scalability in Graph Processing
by scott_s on Friday January 16, 2015 @06:18PM
(#8902431)
That's his whole point. But he goes further, by showing via experiment that a lot of distributed systems are solving problem sizes in benchmarks that can be solved quicker in a single thread.
[ Parent
| on HN ]
There are no comments on this comment yet.