Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
scott_s
on Jan 16, 2015
|
parent
|
context
|
favorite
| on:
The Cost of Scalability in Graph Processing
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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: