If you wish to submit an article, please contact support@dataorienteddesign.com for details.
Lots of good resources linked from this site by Daniele Bartolini: Data Oriented Design Resources
Data-Oriented Design book (2018 version)- html with links
Data-Oriented Design book (2018 version) - PDF download (better images)
Data-Oriented Design book - 2018 paperback version (with extra chapters)
Data-Oriented Design book (2018 version)- html with links
Data-Oriented Design book (2018 version) - PDF download (better images)
When traversing objects stored on an intrusive linked list, it only takes one pointer indirection to get to the object, compared to two pointer indirections for std::list. This causes less memory-cache thrashing so your program runs faster — particularly on modern processors which have huge delays for memory stalls.