The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
StreamIt: A Language for Streaming Applications
Open accessAbstract
We characterize high-performance streaming applications as a new and distinct domain of programs that is becoming increasingly important. The StreamIt language provides novel high-level representations to improve programmer productivity and program robustness within the streaming domain. At the same time, the StreamIt compiler aims to improve the performance of streaming applications via stream-specific analyses and optimizations. In this paper, we motivate, describe and justify the language features of StreamIt, which include: a structured model of streams, a messaging system for control, a re-initialization mechanism, and a natural textual syntax.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
The Esterel synchronous programming language: design, semantics, implementation
Berry, G., & Gonthier, G. (1992) · Science of Computer Programming · doi:10.1016/0167-6423(92)90005-v · Cited by 1,739
The synchronous data flow programming language LUSTRE
Halbwachs, N., Caspi, P., Raymond, P., & Pilaud, D. (1991) · Proceedings of the IEEE · doi:10.1109/5.97300 · Cited by 1,590
Ho, R., Mai, K. W., & Horowitz, M. A. (2001) · Proceedings of the IEEE · doi:10.1109/5.920580 · Cited by 1,438
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,435
The GSM System for Mobile Communications
Mouly, M., Pautet, M.-B., & Haug, T. (1992) · Cited by 1,213
CACTI: an enhanced cache access and cycle time model
Wilton, S. J. E., & Jouppi, N. P. (1996) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.509850 · Cited by 872
Signal Delay in RC Tree Networks
Rubinstein, J., Penfield, P., & Horowitz, M. (1983) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1983.1270037 · Cited by 848
An overview of the SPHINX speech recognition system
Lee, K.-F., Hon, H.-W., & Reddy, R. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.45616 · Cited by 440
Smart Memories: a modular reconfigurable architecture
Mai, K., Paaske, T., Jayasena, N., Ho, R., Dally, W. J., & Horowitz, M. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339673 · Cited by 371
Stephens, R. (1997) · Acta Informatica · doi:10.1007/s002360050095 · Cited by 322
The optimal logic depth per pipeline stage is 6 to 8 FO4 inverter delays
Hrishikesh, M. S., Burger, D., Jouppi, N. P., Keckler, S. W., Farkas, K. I., & Shivakumar, P. (2002) · ACM SIGARCH Computer Architecture News · doi:10.1145/545214.545218 · Cited by 239
Cited by
(2013) · doi:10.1145/2491956.2462176 · Cited by 885
Combinatorial sketching for finite programs
Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168907 · Cited by 635
Frenetic: a network programming language
Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/2034574.2034812 · Cited by 584
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
Gordon, M. I., Thies, W., & Amarasinghe, S. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168877 · Cited by 512
Self-citationKendo: efficient deterministic multithreading in software
Olszewski, M., Ansel, J., & Amarasinghe, S. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508256 · Cited by 380
Self-citation
Metadata
- Authors
- Thies, W., Karczmarek, M., & Amarasinghe, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 179-196
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1568192366
- Cited by
- 1,104
- References
- 14
- FWCI
- 13.58
- Type
- conference paper
- Language
- en
- Open access
- green
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.