The C programming language
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
An efficient algorithm for heap storage allocation
ACM SIGPLAN Notices
A multiprocessor implementation of Joyce
Software—Practice & Experience
The teaching language Pascal-FC
The Computer Journal - Special issue on procedural programming
The programming language SuperPascal
Software—Practice & Experience
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experience with processes and monitors in Mesa
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Studies in Computational Science: Parallel Programming Paradigms
Studies in Computational Science: Parallel Programming Paradigms
Computer system organization: The B5700/B6700 series (ACM monograph series)
Computer system organization: The B5700/B6700 series (ACM monograph series)
Communicating mobile processes
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
A simple mechanism is proposed for dynamic memory allocation of a parallel recursive program with Algol-like scope rules. The method is about as fast as the traditional stack discipline for sequential languages. It has been used to implement the parallel programming language SuperPascal.