10.07.2015 Views

Is Parallel Programming Hard, And, If So, What Can You Do About It?

Is Parallel Programming Hard, And, If So, What Can You Do About It?

Is Parallel Programming Hard, And, If So, What Can You Do About It?

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 11Data Structures11.1 ListsLists, doublelists, hlists, hashes, trees, rbtrees, radixtrees.11.2 Computational Complexityand PerformanceComplexity, performance, O(N).11.3 Design TradeoffsTrade-offs between memory consumption, performance,complexity.11.4 ProtectionCompiler (e.g., const) and hardware.11.5 Bits and BytesBit fields, endianness, packing.11.6 <strong>Hard</strong>ware ConsiderationsCPU word alignment, cache alignment.@@@ pull in material from Orran Kreiger’s 1995paper (permission granted).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!