Browse thread
[Caml-list] looping recursion
[
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: | skaller <skaller@u...> |
| Subject: | Re: [Caml-list] looping recursion |
On Thu, 2004-07-29 at 19:13, Daniel Andor wrote: > Lemme try it out (10^6 elements): > > ocamlc: > rev rev_map version: > 2 WALL ( 1.19 usr + 0.02 sys = 1.21 CPU) > vanilla map: > 7 WALL ( 6.50 usr + 0.09 sys = 6.59 CPU) > > ocamlopt: > rev rev_map version: > 1 WALL ( 0.81 usr + 0.03 sys = 0.84 CPU) > vanilla map: > 2 WALL ( 2.45 usr + 0.02 sys = 2.47 CPU) > > Wow, that was unexpected! The tail-rec version doesn't clobber the cache with growing and shrinking stack -- you have two areas of memory being accessed sequentially instead of three .. (Ocaml allocator is sequential) -- John Skaller, mailto:skaller@users.sf.net voice: 061-2-9660-0850, snail: PO BOX 401 Glebe NSW 2037 Australia Checkout the Felix programming language http://felix.sf.net ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners