Parallel Functional Implementations: Graphbased vs. Stackbased Reduction

G. Hogen, R. Loogen

	   The {\em meshed stack} is a technique for the management
	   of control structures in distributed implementations of
	   dynamic process systems.  In the environment of a parallel
	   abstract machine for the execution of functional programs,
	   we compare this approach to the classical graphbased reduction
	   technique. Experimental results will show, that the stackbased
	   reduction is more efficient in space and time, especially in
	   relation to garbage collection. Also, the stack technique is
	   a natural extension of sequential reduction machines.