comp.lang.ada
 help / color / mirror / Atom feed
From: Mark Johnson <mark_h_johnson@raytheon.com>
Subject: Re: Memory chunks: are they much speed-up?
Date: Fri, 24 Jan 2003 08:32:05 -0600
Date: 2003-01-24T08:32:05-06:00	[thread overview]
Message-ID: <3E314E65.3D7C163C@raytheon.com> (raw)
In-Reply-To: 3e30f9a1$0$33922$bed64819@news.gradwell.net

Victor Porton wrote:
> 
> Is allocating memory in chunks by several (small) objects at once a
> significant speed-up (compared to standard allocators) in typical Ada
> impl.?

It is hard to say because it depends upon a number of factors:
 - your allocation, deallocation pattern
 - the algorithm used in a specific allocator
 - the relative timing of allocations
and so on.

In general, a special purpose allocator will always be "faster" than a
general purpose one. It may also be "more efficient" (less unused
space). However, in general, I find it better to avoid allocation /
deallocation in my applications - especially in real time and "not have
that problem". There are several ways to do that; ask if you need some
examples.
  --Mark



  reply	other threads:[~2003-01-24 14:32 UTC|newest]

Thread overview: 4+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2003-01-24  8:27 Memory chunks: are they much speed-up? Victor Porton
2003-01-24 14:32 ` Mark Johnson [this message]
2003-01-24 14:37 ` Stephen Leake
2003-01-25  2:06 ` David Marceau
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox