The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
MULTILISP: a language for concurrent symbolic computation
Open accessAbstract
Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing parallelism. The potential complexity of dealing with side effects in a parallel context is mitigated by the nature of the parallelism constructs and by support for abstract data types: a recommended Multilisp programming style is presented which, if followed, should lead to highly parallel, easily understandable programs. Multilisp is being implemented on the 32-processor Concert multiprocessor; however, it is ultimately intended for use on larger multiprocessors. The current implementation, called Concert Multilisp , is complete enough to run the Multilisp compiler itself and has been run on Concert prototypes including up to eight processors. Concert Multilisp uses novel techniques for task scheduling and garbage collection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy; the garbage collector uses a multiprocessor algorithm based on the incremental garbage collector of Baker.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Smalltalk-80: The Language and its Implementation
Goldberg, A., & Robson, D. J. (1983) · HAL · Cited by 3,866
Brooks, F. P. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808439 · Cited by 3,224
Backus, J. (1978) · Communications of the ACM · doi:10.1145/359576.359579 · Cited by 2,609
The mythical man-month: essays on software engineering
(1996) · Choice Reviews Online · doi:10.5860/choice.33-5142 · Cited by 2,452
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,435
Viewing control structures as patterns of passing messages
Hewitt, C. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90033-9 · Cited by 1,161
The structure of the “THE”-multiprogramming system
Dijkstra, E. W. (1968) · Communications of the ACM · doi:10.1145/363095.363143 · Cited by 1,094
Cited by
The interdisciplinary study of coordination
Malone, T. W., & Crowston, K. (1994) · ACM Computing Surveys · doi:10.1145/174666.174668 · Cited by 3,504
Active messages: a mechanism for integrated communication and computation
von Eicken, T., Culler, D. E., Goldstein, S. C., & Schauser, K. E. (1992) · Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92 · doi:10.1145/139669.140382 · Cited by 1,393
X10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094852 · Cited by 1,268
Cilk: an efficient multithreaded runtime system
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y. (1995) · Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/209936.209958 · Cited by 1,021
Coordination languages and their significance
Gelernter, D., & Carriero, N. (1992) · Communications of the ACM · doi:10.1145/129630.129635 · Cited by 1,008
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Scalable Molecular Dynamics with NAMD
(2016) · Parallel Science and Engineering Applications · doi:10.1201/b16251-15 · Cited by 639
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Scheduler activations: effective kernel support for the user-level management of parallelism
Anderson, T. E., Bershad, B. N., Lazowska, E. D., & Levy, H. M. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146944 · Cited by 431
Programming languages for distributed computing systems
Bal, H. E., Steiner, J. G., & Tanenbaum, A. S. (1989) · ACM Computing Surveys · doi:10.1145/72551.72552 · Cited by 423
How to write parallel programs: a guide to the perplexed
Carriero, N., & Gelernter, D. (1989) · ACM Computing Surveys · doi:10.1145/72551.72553 · Cited by 361
Lazy task creation: a technique for increasing the granularity of parallel programs
Mohr, E., Kranz, D. A., & Halstead, R. H. (1991) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.86103 · Cited by 307
Self-citationX10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · ACM SIGPLAN Notices · doi:10.1145/1103845.1094852 · Cited by 301
On the expressive power of programming languages
Felleisen, M. (1991) · Science of Computer Programming · doi:10.1016/0167-6423(91)90036-w · Cited by 297
The implementation of the Cilk-5 multithreaded language
Frigo, M., Leiserson, C. E., & Randall, K. H. (1998) · ACM SIGPLAN Notices · doi:10.1145/277652.277725 · Cited by 290
Welc, A., Jagannathan, S., & Hosking, A. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094845 · Cited by 181
Automatic Parallelization of Recursive Procedures
Gupta, M., Mukhopadhyay, S., & Sinha, N. (2000) · International Journal of Parallel Programming · doi:10.1023/a:1007560600904 · Cited by 44
Metadata
- Authors
- Halstead, R. H.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1985-10
- Volume
- 7
- Issue
- 4
- Pages
- 501-538
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W1983587324
- Cited by
- 1,073
- References
- 24
- FWCI
- 25.15
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.