Re: GC performance - GC fragility

Andre Kaufmann wrote:
Also I don't think that the native heap has a much better cache
locality. Think of a native heap which has

1000 entries of the type:

[60 bytes free] [40 bytes allocated] [60 bytes free] [40 bytes.....]

{ it's called heap fragmentation }

What will happen if the applications now wants to allocate 80 bytes ?
Every entry has to be checked and touched. Not quite local (for this
example).

What a load of nonsense. Why must a heap have this kind of structure? It
doesn't. E.g. just read the top part of FastMM source code. Please try
to have at least a bit of clue about a subject before drawing any
conclusions on it.

Micha
.

Relevant Pages

  • Garbage Collection Experts?
    ... I concluded this by plotting cumulative amount of data reclaimed ... Do they indicate heap ... I don't see any entries in the log which indicate ... any kind of compaction going on. ...
    (comp.lang.java.help)
  • Re: Find second minimum number
    ... Richard Heathfield wrote: ... Using a heap is fast, ... that would be for heapsort. ... that you don't need to keep all the entries. ...
    (comp.programming)
  • Re: a proposed callout API
    ... time used for pointlessly ordering the heap. ... frequency of insertion/removals, which i don't know. ... is the cost of each insert/remove). ... Sure if you make sure the short-term list has very few entries ...
    (freebsd-arch)
  • Re: GC performance - GC fragility
    ... Think of a native heap which has ... I haven't tested FMM regarding heap fragmentation. ... You seem to have more clue than I have and since I haven't studied FastMM source code could you shed some light on the problem how a native heap can prevent fragmentation, ...
    (borland.public.delphi.non-technical)
  • Re: merge sort
    ... > using a heap to sort the k lists. ... > Here's an example of a multi-way merge sort with 6 sorted input lists. ... To make the logic a little easier, you can follow the normal entries ... > with N+1 entries of a sentinel that exceeds all possible values. ...
    (comp.programming)