Browse thread
practical functional programming
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | John Max Skaller <skaller@o...> |
| Subject: | Re: practical functional programming |
Ken Wakita wrote: > > A circumstance where reference counting outperforms modern trace-based > collectors is where memory access cost is much higher than the > conventional memory system and thus memory access required for tracing > is much higher than the cost for counter maintenance. One such example > is distributed environment. Another maybe systems with very, very slow > memory such as file systems, persistent object systems, and PDAs. I am > curious if there are other circumstances using conventional memory > system where reference counting is faster. I don't know how a trace-based collector works. Can you explain? [Does this have something to do with a write barrier on pointer stores?] -- John (Max) Skaller, mailto:skaller@maxtal.com.au 10/1 Toxteth Rd Glebe NSW 2037 Australia voice: 61-2-9660-0850 checkout Vyper http://Vyper.sourceforge.net download Interscript http://Interscript.sourceforge.net