1. Lecture Notes in Computer Science;C Augonnet,2010
2. Mattias Eriksson, Christoph Kessler, and Mikhail Chalabine. Load Balancing of Irregular Parallel Divide-and-Conquer Algorithms in Group-SPMD Programming Environments. In Proc. 8th Workshop on Parallel Systems and Algorithms (PASA 2006), Frankfurt am Main, Germany, GI Lecture Notes in Informatics (LNI), vol. P-81, pages 313–322, March 2006.
3. M. Forsell. Designing NOCs with a parallel extension of C. In FDL’04, pages 463–475, 2004.
4. M. Forsell. TOTAL ECLIPSE — An Efficient Architectural Realization of The Parallel Random Access Machine. Parallel and Distributed Comput., Ed. A. Ros, IN-TECH, Wien, pages 39–64, 2010.
5. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proc. 10th Symposium on the Theory of Computation (STOC), pages 114–118, 1978.