Re: Best Ref-counting algorithms?

glen herrmannsfeldt <gah@ugcs.caltech.edu>
Sat, 18 Jul 2009 17:30:54 +0000 (UTC)

          From comp.compilers
Related articles
[24 earlier articles]
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-17)
Re: Best Ref-counting algorithms? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2009-07-17)
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-17)
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-17)
Re: Best Ref-counting algorithms? DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-07-18)
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-18)
Re: Best Ref-counting algorithms? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2009-07-18)
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-18)
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-21)
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-22)
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-25)
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-27)
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-30)
[3 later articles]
| List of all articles for this month |
From: glen herrmannsfeldt <gah@ugcs.caltech.edu>
Newsgroups: comp.compilers
Date: Sat, 18 Jul 2009 17:30:54 +0000 (UTC)
Organization: California Institute of Technology, Pasadena
References: 09-07-018 09-07-032 09-07-038 09-07-040 09-07-058 09-07-063 09-07-068
Keywords: GC
Posted-Date: 19 Jul 2009 16:41:57 EDT

Hans-Peter Diettrich <DrDiettrich1@aol.com> wrote:
(after I wrote)


<> There is an interesting and maybe related feature of many current
<> systems. Many now do not actually allocate pages when requested, but
<> wait until the allocated memory is modified.
(snip)


< What is "short on memory"?


< Short of *physical* memory is the usual state of general purpose


No, they overallocate virtual memory.


I ran the program I posted, and finally killed it when it was
over 2TB virutal. (and 64K real). I don't have anywhere near
2TB of swap space on that machine.


I believe this is true for any somewhat recent Linux version.


I am not sure if run-time library issues should have their own
newsgroup. Memory allocation details are reasonably part of
a run time library discussion, but maybe not compilers.


Anyone working with compilers on current systems, though, should
at least know about this problem.


-- glen


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.