The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
The Manchester prototype dataflow computer
Open accessAbstract
The Manchester project has developed a powerful dataflow processor based on dynamic tagging. This processor is large enough to tackle realistic applications and exhibits impressive speedup for programs with sufficient parallelism.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
First version of a data flow procedure language
Dennis, J. B. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_145 · Cited by 644
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Karp, R. M., & Miller, R. E. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114108 · Cited by 421
A preliminary architecture for a basic data-flow processor
Dennis, J. B., & Misunas, D. P. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.286058 · Cited by 365
An asynchronous programming language and computing machine
Arvind, A., Gostelow, K. P., & Plouffe, W. (1978) · eScholarship (California Digital Library) · Cited by 207
Computers and the world of the future.
Mumford, E. (1968) · PubMed · Cited by 95
A language design for concurrent processes
Tesler, L. G., & Enea, H. (1968) · doi:10.1145/1468075.1468134 · Cited by 91
A computation model with data flow sequencing
Adams, D. A. (1969) · Cited by 61
Cited by
MULTILISP: a language for concurrent symbolic computation
Halstead, R. H. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/4472.4478 · Cited by 1,073
Speedup versus efficiency in parallel systems
Eager, D. L., Zahorjan, J., & Lazowska, E. D. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21127 · Cited by 437
Executing a program on the MIT tagged-token dataflow architecture
Arvind, & Nikhil, R. S. (1990) · IEEE Transactions on Computers · doi:10.1109/12.48862 · Cited by 401
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
Metadata
- Authors
- Gurd, J. R., Kirkham, C. C., & Watson, I.
- Venue
- Communications of the ACM
- Published
- 1985-01-02
- Volume
- 28
- Issue
- 1
- Pages
- 34-52
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2018885404
- Cited by
- 463
- References
- 8
- FWCI
- 41.13
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Manchester prototype dataflow computer. https://app.cochat.ai/papers/10.1145/2465.2468
- The paper
- Gurd, J. R., Kirkham, C. C., & Watson, I. (1985). The Manchester prototype dataflow computer. Communications of the ACM. https://doi.org/10.1145/2465.2468
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.