3 ms·
I think there's some unintentional benchmark sleight of hand here. I note that the slope of the first segment for Erlang and Haskell is almost the same as idea
by stcredzero 16y ago
I think there's some unintentional benchmark sleight of hand here. I note that the slope of the first segment for Erlang and Haskell is almost the same as ideal, but Python deviates quite a bit. If I were the author, I'd be curious about this and try to analyze it. I suspect this would reveal something about his benchmark. (Probably that it's too small!)
- cperciva 16y agoThe slope is equal to one, i.e., "100% of the incoming connections result in a request being successfully handled". This is a dumb way to graph performance -- usually people look at either (parallel requests, requests per second) or (requests per second, request latency) -- but he seems to have done it correctly.
- stcredzero 16y agoIn the first segment, the slope for Python is not equal to one.
- cperciva 16y agoYou must have better eyes than me. It looks to me like the slopes are all equal to one until the languages hit bottlenecks (for Haskell, at 6000; for Erlang, at 1000; and for Python, at 12000).
- deleted 16y ago[deleted]
- stcredzero 16y agoAh, I misunderstood the graph. The graph for all langs starts at the left, then. The graph makes it hard to tell.