because of the concurrency issues. Unless the algorithm

送交者: ak70 于 2011-02-24, 02:33:08:

回答: why not? 由 steven 于 2011-02-24, 02:26:17:

is wait-free, I don't know how to measure it with big-O. If one uses locks, then in many cases, the latency is not so high, but lock-free (but not wait-free) algorithms seem to have higher latency in general and an execution could be delayed indefinitely.

所有跟贴:

big O works for concurrent also, - steven (109 bytes) 2011-02-24, 02:50:15 (551913)
- what about the delays caused by resource locking? - ak70 (139 bytes) 2011-02-24, 03:19:35 (551915)
  - The delay for syncrhonizing tasks is no different than any other delay. - steven (34 bytes) 2011-02-24, 10:32:40 (552047)

加跟贴