Hi,
I've attempted to write a perhaps naive ODE integration loop in Factor,
http://paste.factorcode.org/paste?id=3428
but it seems quite slow: the `bench1` word reports running time of ~3 s,
which is an order of magnitude off equivalent OCaml & Haskell, so I imagine
due to my lack of Factor experience there's boxing, unboxing and mixing of
types leading to poor performance.
Are there some general principles for writing performant numerical code in
Factor? Do the generic sequence words get optimized or explicit use of
unsafe words are required?
A specific question about `dup` on container types: are the underlying data
duplicated?
If I've missed any potential reading matériels on this, refs would be much
appreciated.
Cheers,
Marmaduke
------------------------------------------------------------------------------
Dive into the World of Parallel Programming. The Go Parallel Website,
sponsored by Intel and developed in partnership with Slashdot Media, is your
hub for all things parallel software development, from weekly thought
leadership blogs to news, videos, case studies, tutorials and more. Take a
look and join the conversation now. http://goparallel.sourceforge.net/
_______________________________________________
Factor-talk mailing list
Factor-talk@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/factor-talk
