Procs and locks
- 1 July 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 28 (7) , 198-207
- https://doi.org/10.1145/173284.155353
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- A customizable substrate for concurrent languagesACM SIGPLAN Notices, 1992
- Debuggable concurrency extensions for standard MLACM SIGPLAN Notices, 1991
- First-class user-level threadsACM SIGOPS Operating Systems Review, 1991
- Revised 4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers, 1991
- A runtime systemHigher-Order and Symbolic Computation, 1990
- The performance of spin lock alternatives for shared-memory multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- Mul-T: a high-performance parallel LispACM SIGPLAN Notices, 1989
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- Garbage collection can be faster than stack allocationInformation Processing Letters, 1987
- MULTILISP: a language for concurrent symbolic computationACM Transactions on Programming Languages and Systems, 1985