Re: Fastcode MM B&V 0.41 (integer benchmark)
- From: "Avatar Zondertau" <avatarzt@xxxxxxxxx (please reply to newsgroup)>
- Date: 31 May 2005 08:43:20 -0700
unit SortIntArrayBenchmark2Unit;
interface
uses Windows, BenchmarkClassUnit, Classes, Math;
type
TQuickSortIntArrayThreads = class(TFastcodeMMBenchmark)
public
procedure RunBenchmark; override;
class function GetBenchmarkName: string; override;
class function GetBenchmarkDescription: string; override;
class function GetSpeedWeight: Double; override;
class function GetCategory: TBenchmarkCategory; override;
end;
implementation
uses SysUtils;
type
TSortIntArrayThread = class(TThread)
FBenchmark: TFastcodeMMBenchmark;
procedure Execute; override;
end;
function SortCompareInt(Item1, Item2: Pointer): Integer;
begin
Result := Integer(Item1) - Integer(Item2);
end;
procedure TSortIntArrayThread.Execute;
var
I, Size: Integer;
List: TList;
const
MINSIZE : Integer = 500;
MAXSIZE : Integer = 1500;
begin
for Size := MINSIZE to MAXSIZE do
begin
List := TList.Create;
try
List.Count := Size;
for I := 0 to Size-1 do
List[I] := Pointer(Random(100));
List.Sort(SortCompareInt);
finally
List.Free;
end;
end;
FBenchmark.UpdateUsageStatistics;
end;
class function TQuickSortIntArrayThreads.GetBenchmarkDescription:
string;
begin
Result := 'A benchmark that measures read and write speed to an array
of Integer. '
+ 'Access pattern is created by selection sorting array of
random values using the QuickSort algorithm implemented in TList.. '
+ 'Measures memory usage after all blocks have been freed. '
+ 'Benchmark submitted by Avatar Zondertau, based on a
benchmark by Dennis Kjaer Christensen.';
end;
class function TQuickSortIntArrayThreads.GetBenchmarkName: string;
begin
Result := 'QuickSortIntegerArrayBenchmark';
end;
class function TQuickSortIntArrayThreads.GetCategory:
TBenchmarkCategory;
begin
Result := bmMemoryAccessSpeed;
end;
class function TQuickSortIntArrayThreads.GetSpeedWeight: Double;
begin
Result := 0.75;
end;
procedure TQuickSortIntArrayThreads.RunBenchmark;
var
SortIntArrayThread : TSortIntArrayThread;
begin
inherited;
SortIntArrayThread := TSortIntArrayThread.Create(True);
SortIntArrayThread.FreeOnTerminate := False;
SortIntArrayThread.FBenchmark := Self;
SortIntArrayThread.Resume;
SortIntArrayThread.WaitFor;
SortIntArrayThread.Free;
end;
end.
.
- References:
- Fastcode MM B&V 0.41
- From: Dennis
- Re: Fastcode MM B&V 0.41
- From: Avatar Zondertau
- Fastcode MM B&V 0.41
- Prev by Date: Re: Fastcode MM B&V 0.41
- Next by Date: Re: filling big array of double
- Previous by thread: Re: Fastcode MM B&V 0.41
- Next by thread: Re: Fastcode MM B&V 0.41 (extended)
- Index(es):
Relevant Pages
|
