Re: Allocation speed

[agate!usenet.ins.cwru.edu!magnus.acs.ohio-state.edu!cis.ohio-state.edu!bo unce-bounce@ucbvax.Berkeley.EDU (Bruce Weide)]

In article <70400@mimsy.umd.edu> alex@cs.umd.edu (Alex Blakemore)
writes about the many advantages of a disciplined approach to storage
management, in response to a question about performance of dynamic
memory allocation and deallocation.  His arguments are very
persuasive.  For some specific suggestions about how to encapsulate
Alex's suggestions (and others) in a nice way, see:

  Hollingsworth, J.E., and Weide, B.W., "Engineering 'Unbounded'
  Reusable Ada Generics," Proc. 10th Ann. Natl. Conf. on Ada Technology,
  ANCOST, Inc, Feb. 1992, pp. 82-97.

Related packages designed to facilitate multiple implementations of
low-level storage management details can be found in the first
author's Ph.D. dissertation.  It is available by anonymous FTP from
host ftp.cis.ohio-state.edu in the directory pub/tech-report/TR1-1993.

Cheers,
    -Bruce