Abstract
In this paper, we describe ASPEN, a concurrent stream processing environment. ASPEN is novel in that it provides a programming model in which programmers use simple annotations to exploit varying degrees and types of concurrency. The degree of concurrency to be exploited is not fixed by the program specification or by the underlying system. Increasing or decreasing the degree of concurrency to be exploited during execution does not require rewriting the entire program, but rather, simply re-annotating it.
Examples are given to illustrate the varying types of concurrency inherent in programs written within the stream processing paradigm. We show how programs may be annotated to exploit these varying degrees of concurrency. We briefly describe our implementation of ASPEN.
This work was done within the Tangram project, supported by DARPA contract F29601-87-C-0072.
Brian Livezey is now at the Lockheed Artificial Intelligence Center, 2710 Sand Hill Road, Menlo Park, CA 94025.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Abelson, H. and G. Sussman, The Structure and Analysis of Computer Programs, MIT Press, Boston, MA (1985).
Barth, Paul, Scott Guthery, and David Barstow, “The Stream Machine: A Data Flow Architecture for Real-Time Applications,” pp. 103–110 in Proceedings 8th International Conference on Software Engineering, London, England (August 1985).
Chau, L., “Functional Grammars and Stream Pattern Matching,” Draft, UCLA Computer Science Dept. (March 1988).
Gregory, S., Parallel Logic Programming in PARLOG: The Language and its Implementation, Addison-Wesley, Reading, MA (1987).
Henderson, Peter, Functional Programming: Application and Implementation, Prentice-Hall, Englewood Cliffs, New Jersey (1980).
Kahn, Gilles and David B. MacQueen, “Coroutines and Networks of Parallel Processes,” Proceedings of the IFIP Congress 77, pp.993–998 (1977).
Levy, Jacob and Ehud Shapiro, “CFL — A Concurrent Functional Language Embedded in a Concurrent Logic Programming Environment”, CS86-28, The Weizmann Institute of Science, Rehovot, Israel (December 1986).
Li, P-Y.P. and A.J. Martin, “The Sync Model: A Parallel Execution Method for Logic Programming,” Proc. Symp. on Logic Programming, pp.223–234, IEEE Computer Society (1986).
Livezey, Brian Kevin, “A Stream-Based Language for Concurrent Programming and Distributed Database Access,” M.S. Thesis, UCLA Computer Science Department, Los Angeles, California (1988).
Muntz, R.R. and D.S. Parker, “Tangram: Project Overview,” Technical Report CSD-880032, UCLA Computer Science Dept., Los Angeles, CA 90024-1596 (April 1988).
Narain, S., “Log(F): A New Scheme for Integrating Rewrite Rules, Logic Programming and Lazy Evaluation,” CSD-870027, UCLA Computer Science Dept., Los Angeles, CA (1987).
Narain, S., “LOG(F): An Optimal Combination of Logic Programming, Rewrite Rules and Lazy Evaluation,” Ph.D. Dissertation, UCLA Computer Science Dept., Los Angeles, CA 90024-1596 (1988).
Parker, D.S., R.R. Muntz, and L. Chau, “The Tangram Stream Query Processing System,” Technical Report CSD-880025, UCLA Computer Science Dept., Los Angeles, CA 90024-1596 (March 1988).
Shapiro, E.Y., Concurrent Prolog: Collected Papers, MIT Press, Cambridge, MA (1987).
Sterling, L. and E. Shapiro, The Art of Prolog, MIT Press, Cambridge, MA (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Livezey, B.K., Muntz, R.R. (1989). ASPEN: A stream processing environment. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_53
Download citation
DOI: https://doi.org/10.1007/3-540-51285-3_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51285-1
Online ISBN: 978-3-540-46184-5
eBook Packages: Springer Book Archive