Results 1  10
of
33
A Survey Of Stream Processing
, 1995
"... Stream processing is a term that is used widely in the literature to describe a variety of systems. We present an overview of the historical development of stream processing and a detailed discussion of the different languages and techniques for programming with streams that can be found in the lite ..."
Abstract

Cited by 119 (2 self)
 Add to MetaCart
Stream processing is a term that is used widely in the literature to describe a variety of systems. We present an overview of the historical development of stream processing and a detailed discussion of the different languages and techniques for programming with streams that can be found in the literature. This includes an analysis of dataflow, specialized functional and logic programming with streams, reactive systems, signal processing systems, and the use of streams in the design and verification of hardware. The aim of this survey is an analysis of the development of each of these specialized topics to determine if a general theory of stream processing has emerged. As such, we discuss and classify the different classes of stream processing systems found in the literature from the perspective of programming primitives, implementation techniques, and computability issues, including a comparison of the semantic models that are used to formalize stream based computation.
Productivity of Stream Definitions
, 2008
"... We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called ‘productive’ if it can be evaluated continually in such a way that a uniquely determined stream in constructor normal form is obtained as the limit. Whereas prod ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called ‘productive’ if it can be evaluated continually in such a way that a uniquely determined stream in constructor normal form is obtained as the limit. Whereas productivity is undecidable for stream definitions in general, we show that it can be decided for ‘pure’ stream definitions. For every pure stream definition the process of its evaluation can be modelled by the dataflow of abstract stream elements, called ‘pebbles’, in a finite ‘pebbleflow net(work)’. And the production of a pebbleflow net associated with a pure stream definition, that is, the amount of pebbles the net is able to produce at its output port, can be calculated by reducing nets to trivial nets.
A causality interface for deadlock analysis in dataflow
 Proceedings of the 6th ACM and IEEE International conference on Embedded software, EMSOFT
"... In this paper, we consider a concurrent model of computation called dataflow, where components (actors) communicate via streams of data tokens. Dataflow semantics has been adopted by experimental and production languages used to design embedded systems. The execution of a dataflow actor is enabled b ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we consider a concurrent model of computation called dataflow, where components (actors) communicate via streams of data tokens. Dataflow semantics has been adopted by experimental and production languages used to design embedded systems. The execution of a dataflow actor is enabled by the availability of its input data. One important question is whether a dataflow model will deadlock (i.e., actors cannot execute due to a data dependency loop). Deadlock in many cases can be determined, although it is generally not decidable. We develop a causality interface for dataflow actors based on the general framework we introduced in [1] and show how this causality information can be algebraically composed so that composition of components acquire causality interfaces that are inferred from their components and the interconnections. We illustrate the use of these causality interfaces to statically analyze for deadlock. Categories and Subject Descriptors
A Typetheoretic Approach to Deadlockfreedom of Asynchronous Systems
 In Proc. TACS
, 1997
"... We present a typebased technique for the verification of deadlockfreedom in asynchronous concurrent systems. Our approach is to start with an interaction category such as ASProc, where objects are types containing safety specifications and morphisms are processes. We then use a specification st ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
We present a typebased technique for the verification of deadlockfreedom in asynchronous concurrent systems. Our approach is to start with an interaction category such as ASProc, where objects are types containing safety specifications and morphisms are processes. We then use a specification structure to add information to the types so that they specify stronger properties. The extra information in this case concerns deadlockfreedom, and in the resulting category ASProc D , combining welltyped processes preserves deadlockfreedom. It is also possible to accommodate noncompositional methods within the same framework. The systems we consider are asynchronous, hence issues of divergence become significant; our approach incorporates an elegant treatment of both divergence and successful termination. As an example, we use our methods to verify the deadlockfreedom of an implementation of the alternatingbit protocol. Address for Correspondence Dr S. J. Gay Department of ...
An implementation of static functional process networks
 In PARLE'92Parallel Architectures and Languages Europe
, 1992
"... functional programming, process network, declarative annotation, transputer, program transformation To get high performance on a distributedmemory multicomputer at present and for the foreseeable future, some explicit control is needed. This paper describes work aimed at harnessing the power of the ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
functional programming, process network, declarative annotation, transputer, program transformation To get high performance on a distributedmemory multicomputer at present and for the foreseeable future, some explicit control is needed. This paper describes work aimed at harnessing the power of the functional notation in exercising such control. We have developed a declarative annotation scheme which allows explicit control over process placement and communications. The language, called Caliban, has been implemented on a con gurable, looselycoupled commercial multicomputer and we describe the compiler and runtime system.
8 1/2: DataParallelism and DataFlow
, 1996
"... We advocate a dataflow approach to dataparallelism to ensure both parallelism expressiveness and efficient exploitation of dataparallel applications on new massively parallel architectures. The rational of this approach is introduced in the first part of the paper. Then we develop an experimental ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We advocate a dataflow approach to dataparallelism to ensure both parallelism expressiveness and efficient exploitation of dataparallel applications on new massively parallel architectures. The rational of this approach is introduced in the first part of the paper. Then we develop an experimental language following these lines and sketch the techniques used to compile such a dataflow dataparallel language. Its compilation, based upon a static execution model enabling an efficient execution of programs, is introduced.
On upper weightable spaces
 Proc. 11th Summer Conference on General Topology and
, 1996
"... The weightable quasipseudometric spaces have been introduced by Matthews as part of the study of the denotational semantics of dataflow networks (e.g. [Mat92] and [Mat92a]). The study of these spaces has been continued in the context of Nonsymmetric Topology by Kunzi and Vajner ([KV93] and [Kün93] ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
The weightable quasipseudometric spaces have been introduced by Matthews as part of the study of the denotational semantics of dataflow networks (e.g. [Mat92] and [Mat92a]). The study of these spaces has been continued in the context of Nonsymmetric Topology by Kunzi and Vajner ([KV93] and [Kün93]). We introduce and motivate the class of upper weightable quasipseudometric spaces. The relationship with the development of a topological foundation for the complexity analysis of programs ([Sch95]) is discussed, which leads to the study of the weightable optimal (quasipseudometric) join semilattices.
Complexity Spaces Revisited (Extended Abstract)
"... The complexity (quasipseudometric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ([Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [Sch95]. Typic ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
The complexity (quasipseudometric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ([Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [Sch95]. Typically these applications involve fixed point arguments based on the Smyth completion. The notion of Scomplet...