Let's perform a simple benchmark testing the random and sequential access to arrays and lists. I would like to compare:

• static array with predefined size (allocated on stack)
• TList container class (allocated on heap)
• dynamic array (allocated on heap)
• generic Delphi TList or Free Pascal TFPGList (allocated on heap)

I use an array/list of 10M elements of integer and varaint data type. You can change the type definition in "type" section if need to test other cases.

I know not much feedbacks about real tests on hyper-threading in OLAP world. Here is a SQL Server hyper-threading from Linchi Shea.

So, using hyper-threading doesn't mean that you will get the advantages always. At least some performance tests are required to ensure this technical choice.