VMS.DevelopPatternForMallocResults History

Hide minor edits - Show changes to output - Cancel

June 30, 2012, at 04:22 AM by 24.130.186.152 -
Changed line 20 from:
Each file is named:
to:
June 30, 2012, at 04:19 AM by 24.130.186.152 -
Changed lines 5-6 from:
Original approach: has one free list that is centralized and searched linearly [Original Malloc]
Second approach: has an array of free lists, that is shared among cores. [Array Malloc]
to:
Original approach: has one free list that is centralized and searched linearly [[VMS.DevelopCodeExplOrigMalloc | Original Malloc]]
Second approach: has an array of free lists, that is shared among cores. [[VMS.DevelopCodeExplArrayMalloc | Array Malloc]]
June 30, 2012, at 04:18 AM by 24.130.186.152 -
Added lines 1-22:
The purpose of the malloc tests is to compare various malloc approaches to original.\\

Baseline: system malloc

Original approach: has one free list that is centralized and searched linearly [Original Malloc]
Second approach: has an array of free lists, that is shared among cores. [Array Malloc]
Third approach: distributed version of single free list
Fourth approach: distributed version of array of free lists

Organization of results:
Top_Dir/2_runs_and_data/results_from_runs/VMS/Vpthread/Measure_Malloc/*

The parameters in the tests are:
- machine_name: ( [willis](willis machine), [Seans](seans machine), [VMS](VMS machine), [Ninas](ninas machine), [Biaos](biaos machine) )
- Malloc algorithm: (single, array, single_distr, array_distr)
- number of allocations per thread
- number of threads
- chunk size: (fixed small, fixed large, random size)

Each file is named: