Re: Stack based allocation vs. Dynamic allocation

[Ray Blaak <blaak@infomatch.com>]

dale <dale@cs.rmit.edu.au> writes:
> A discussion at work left me claiming that stack based allocation
> was quicker than heap based allocation. 
> 
> A person wrote up a demonstration program that proved that this
> wasn't the case (at least for the experiment).
[...]
> procedure Stack is
>    N : constant := 500;
>    Big : constant := 1024 ** 2;
>    type ints is array (0 .. Big) of Integer;
[...]
> procedure Heap is
>    N : constant := 500;
>    Big : constant := 1024 ** 2;
>    type ints is array (0 .. N - 1) of integer;
>
> Does anyone know what the factors are that would cause stack
> allocation to be so slow?

Well the code you posted has the heap version working with much smaller arrays
(500 vs 1 million), so of course it will be faster. 

Fix the Heap version to have the same array type as in the Stack version and
try again. I am interested in the answer.

-- 
Cheers,                                        The Rhythm is around me,
                                               The Rhythm has control.
Ray Blaak                                      The Rhythm is inside me,
blaak@infomatch.com                            The Rhythm has my soul.