The DOI matches its Crossref record.
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Abstract
This paper gives a graph-theoretic model for the description and analysis of parallel computations. Within the model, computation steps correspond to nodes of a graph, and dependency between computation steps is represented by branches with which queues of data are associated. First, it is shown that each such computation graphGrepresents a unique computation, determined independently of operation times. Next, methods of determining whether such a computation terminates and of finding the number of performances of each computation step are developed. The maximal strongly connected subgraphs of G and the loops within these subgraphs play aooutnal role in this analysis. For example, use is made of the result that either every computation step within a strongly connected snbgroph of G is performed an infinite number of times, or none is. Finally, necessary and sufficient conditions for the lengths of data queues to remain bounded are derived.
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
Cited by
Petri nets: Properties, analysis and applications
Murata, T. (1989) · Proceedings of the IEEE · doi:10.1109/5.24143 · Cited by 10,606
Lee, E. A., & Messerschmitt, D. G. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13876 · Cited by 1,842
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
Lee, E. A., & Messerschmitt, D. G. (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.5009446 · Cited by 1,318
Peterson, J. L. (1977) · ACM Computing Surveys · doi:10.1145/356698.356702 · Cited by 1,179
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
Dennis (1980) · Computer · doi:10.1109/mc.1980.1653418 · Cited by 580
Advances in dataflow programming languages
Johnston, W. M., Hanna, J. R. P., & Millar, R. J. (2004) · ACM Computing Surveys · doi:10.1145/1013208.1013209 · Cited by 503
Query processing in a system for distributed databases (SDD-1)
Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., & Rothnie, J. B. (1981) · ACM Transactions on Database Systems · doi:10.1145/319628.319650 · Cited by 493
The Manchester prototype dataflow computer
Gurd, J. R., Kirkham, C. C., & Watson, I. (1985) · Communications of the ACM · doi:10.1145/2465.2468 · Cited by 463
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
Davis, & Keller (1982) · Computer · doi:10.1109/mc.1982.1653939 · Cited by 287
A prototype data flow computer with token labelling
WATSON, I., & GURD, J. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817164 · Cited by 35
An order-aware dataflow model for parallel Unix pipelines
Handa, S., Kallas, K., Vasilakis, N., & Rinard, M. C. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3473570 · Cited by 4
“In contrast to standard dataflow models [Kahn 1974; Kahn and MacQueen 1977; Karp and Miller 1966; Lee and Messerschmitt 1987a,b], our dataflow model is order-aware — i.e. , the order in which a node in the dataflow graph consumes inputs from different edges plays a central role in the semantics of…”
BackgroundResult
Metadata
- Authors
- Karp, R. M., & Miller, R. E.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1966-11
- Volume
- 14
- Issue
- 6
- Pages
- 1390-1411
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W2031144446
- Cited by
- 421
- References
- 0
- FWCI
- 5.97
- Type
- journal article
- Language
- en
- Open access
- closed
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.