fossilesque@mander.xyzM to Science Memes@mander.xyzEnglish · 7 months agoExplain yourselves, comp sci.mander.xyzimagemessage-square24fedilinkarrow-up113arrow-down10
arrow-up113arrow-down1imageExplain yourselves, comp sci.mander.xyzfossilesque@mander.xyzM to Science Memes@mander.xyzEnglish · 7 months agomessage-square24fedilink
minus-squarekbotc@lemmy.worldlinkfedilinkEnglisharrow-up0·7 months agoDynamically sized but stored contiguously makes the systems performance engineer in me weep. If the lists get big, the kernel is going to do so much churn.
minus-squareKilling_Spark@feddit.delinkfedilinkEnglisharrow-up1·7 months agoContiguous storage is very fast in terms of iteration though often offsetting the cost of allocation
minus-squareSlotos@feddit.nllinkfedilinkEnglisharrow-up1·7 months agoModern CPUs are also extremely efficient at dealing with contiguous data structures. Branch prediction and caching get to shine on them. Avoiding memory access or helping CPU access it all upfront switches physical domain of computation.
Dynamically sized but stored contiguously makes the systems performance engineer in me weep. If the lists get big, the kernel is going to do so much churn.
Contiguous storage is very fast in terms of iteration though often offsetting the cost of allocation
Modern CPUs are also extremely efficient at dealing with contiguous data structures. Branch prediction and caching get to shine on them.
Avoiding memory access or helping CPU access it all upfront switches physical domain of computation.