Re: the inefficiency of noncontiguous data - why?
- From: Roedy Green <see_website@xxxxxxxxxxxxxxxxxxxx>
- Date: Sat, 29 Sep 2007 22:17:02 GMT
On Sat, 29 Sep 2007 14:44:45 -0400, wittle <w@xxxxx> wrote, quoted or
indirectly quoted someone who said :
I noticed that breaking up a large array into 2 pieces results in a much
higher memory usage for my program.
Normally two smaller pieces would use less ram than one big piece
since two small pieces can be fit into the holes between existing
objects, where one big piece might require allocating extra VR to get
contiguous space.
However 1000 small pieces would probably take more space than one big
piece since each piece has tracking overhead, perhaps in the order of
8-32 bytes.
I would not leap to any great generalisations based on that one
example.
--
Roedy Green Canadian Mind Products
The Java Glossary
http://mindprod.com
.
- References:
- the inefficiency of noncontiguous data - why?
- From: wittle
- the inefficiency of noncontiguous data - why?
- Prev by Date: Re: Great SWT Program
- Next by Date: Re: Great SWT Program
- Previous by thread: Re: the inefficiency of noncontiguous data - why?
- Index(es):
Relevant Pages
|