I'm contemplating how Chicken Scheme might be used on the Cell Broadband
Engine architecture. The Cell BE is the CPU of the Sony Playstation3.
I'm reading an article about various programming "gotchas" on the Cell BE:
http://www.cs.utk.edu/~dongarra/cell2006/cell-slides/18-Michael-Perrone.pdf
Let's Try Recursion
* Write recursive SPE code that uses lots of stack variables
* No problem, the compiler will handle the stack for me...
* Gotcha!
--> No stack overflow protection...
--> Stack variables start over-writing data and eventually code!
So the general question, quite apart from the Cell BE, is how does
Chicken handle a fixed stack size, and / or a fixed amount of memory for
both instructions and data? I think each SPE (Synergistic Processing
Element) on the Cell BE has 512K of memory IIRC.
Cheers,
Brandon Van Every
_______________________________________________
Chicken-users mailing list
Chicken-users@nongnu.org
http://lists.nongnu.org/mailman/listinfo/chicken-users
