Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

My example would probably be the work of Phil Bagwell. IMHO the biggest issue with Linked-lists is they do not support parallelism, they are inherently sequential.


Give up sequential! :)

If you want queues, and you can give up sequential, then you can get huge gains[1] in performance. Specific use cases will have better specific solutions.

[1]: e.g. https://github.com/cameron314/concurrentqueue


You can reduce some linked list operations (including multi-element ones) to a single CAS, which is often good enough.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: