Stream processing

Short description: Computer programming paradigm

In computer science, stream processing (also known as event stream processing, data stream processing, or distributed stream processing) is a programming paradigm that views streams, or sequences of events in time, as the central input and output objects of computation. Stream processing encompasses dataflow programming, reactive programming, and distributed data processing.[1] Stream processing systems use streaming algorithms to trace parallel processing for data streams. The software stack for these systems includes components such as programming models and query languages, for expressing computation; stream management systems for distribution and scheduling; and hardware components for acceleration, including floating-point units, graphics processing units, and field-programmable gate arrays.[2]

The stream processing paradigm simplifies parallel software and hardware by restricting the kinds of parallel computation that can be performed. Given a sequence of data (a stream), a series of operations (kernel functions) is applied to each element in the stream. Kernel functions are usually pipelined, and efficient local on-chip memory reuse is attempted in order to minimize bandwidth loss associated with external memory interaction. Uniform streaming, in which a single kernel function is applied to all elements in the stream, is typical. Because the kernel and stream abstractions expose data dependencies, compiler tools can fully automate and optimize on-chip management tasks. Stream processing hardware can use techniques such as scoreboarding to initiate direct memory access (DMA) when dependencies are resolved. The elimination of manual DMA management reduces software complexity, while the reduced reliance on hardware cached I/O decreases the memory footprint required by specialized computational units such as arithmetic logic units.

During the 1980s stream processing was explored within dataflow programming. One example is the language SISAL.

## Contents

* 1 Applications
* 2 Code examples
* 3 Comparison to prior parallel paradigms
* 3.1 Conventional, sequential paradigm
* 3.2 Parallel SIMD paradigm, packed registers (SWAR)
* 3.3 Parallel stream paradigm (SIMD/MIMD)
* 4 Research
* 4.1 Programming and data layout considerations
* 4.2 Models of computation
* 4.3 Processor architecture comparisons
* 4.4 Hardware-in-the-loop issues
* 5 Historical examples and evolution
* 5.1 Early dedicated architecture
* 5.2 Graphics processing units (GPUs)
* 5.3 Cell broadband engine
* 6 Stream programming libraries and languages
* 6.1 Academic and open-source environments
* 6.2 Commercial and proprietary architectures
* 6.3 Vendor-specific hardware languages
* 6.4 Distributed event and complex event processing (CEP) engines
* 6.5 Distributed and cloud-scale execution ecosystems
* 6.6 Managed cloud streaming services
* 7 See also
* 8 References

## Applications

Stream processing can be viewed as a compromise, driven by a data-centric model that works well for traditional DSP- or GPU-type applications (such as image, video and digital signal processing), but less well for general purpose processing with more randomized data access (such as databases). By sacrificing some flexibility in the model, this approach can enable easier, faster, and more efficient execution. Depending on the context, processor design can be tuned for maximum efficiency or for a trade-off with flexibility.[3]

Stream processing is especially suitable for applications that exhibit three characteristics:

* Compute intensity, defined as the number of arithmetic operations per I/O or global memory reference. In many signal processing applications, this ratio is well over 50:1 and continues to increase with algorithmic complexity.
* Data parallelism, which exists in a kernel when the same function is applied to all records of an input stream, allowing multiple records to be processed simultaneously without waiting for results from previous records.
* Data locality, a form of temporal locality common in signal and media processing applications, in which data is produced once, read once or twice later in the application, and then not used again. Intermediate streams passed between kernels, as well as intermediate data within kernel functions, can capture this locality directly in the stream processing programming model.

Examples of records within streams include:

* In graphics, each record may consist of vertex, normal, and color information for a triangle.
* In image processing, each record may be a single pixel from an image.
* In a video encoder, each record may be 256 pixels, forming a macroblock of data.
* In wireless signal processing, each record could be a sequence of samples received from an antenna.

For each record, processing is typically limited to reading from the input, performing operations on the data, and writing the result to the output. Multiple inputs and outputs are possible, but memory is not both read and written within the same application.[4]

## Code examples

By way of illustration, the following code fragments demonstrate the detection of patterns within event streams. The first example shows the processing of a data stream using a continuous SQL query: an ongoing query that processes incoming data based on timestamps and window duration. This code fragment illustrates a JOIN of two data streams: one representing stock `orders` and the other representing the resulting stock `trades`.[5] The query outputs a stream of all orders matched by a trade within one second of the order being placed. The output stream is sorted by timestamp; in this case, the timestamp originates from the `orders` stream.

SELECT DataStream
Orders.TimeStamp, Orders.orderId, Orders.ticker,
Orders.amount, Trade.amount
FROM Orders
JOIN Trades OVER (RANGE INTERVAL '1' SECOND FOLLOWING)
ON Orders.orderId = Trades.orderId;

Another sample code fragment detects weddings within a stream of external events, such as church bells ringing, the appearance of a man in a tuxedo or morning suit, a woman in a white gown, and rice being thrown. A "complex" or "composite" event is the high-level event inferred from these constituent events: in this case, that a wedding is occurring.[6]

WHEN Person.Gender EQUALS "man" AND Person.Clothes EQUALS "tuxedo"
FOLLOWED-BY
Person.Clothes EQUALS "gown" AND
(Church_Bell OR Rice_Flying)
WITHIN 2 hours
ACTION Wedding

## Comparison to prior parallel paradigms

Early computers were based on a sequential execution paradigm. Traditional CPUs utilize a single instruction, single data (SISD) architecture, meaning they conceptually perform one operation at a time.[7] As computing demands increased, the volume of data to be processed grew rapidly, exposing the limitations of sequential programming models. Various approaches were explored to enable large-scale computation, primarily by exploiting parallel execution.

One major outcome of these efforts was single instruction, multiple data (SIMD), an architecture that allows a single instruction to operate on multiple data elements simultaneously. In general-purpose microprocessors, SIMD is frequently implemented via SIMD within a register (SWAR). By incorporating distinct execution structures for separate instruction streams, multiple instruction, multiple data (MIMD) parallelism can also be achieved.[7][8]

Although these paradigms are effective, physical hardware implementations face strict constraints, including memory alignment requirements, synchronization overhead, and limited scaling. Consequently, relatively few SIMD processors survived as stand-alone components; most have been integrated into general-purpose CPUs.[8][9]

A fundamental example of these paradigms is a program that adds two arrays, each containing 100 four-component vectors (totaling 400 numerical values).

### Conventional, sequential paradigm

In the standard sequential paradigm, the operation is executed iteratively using a single loop:

for (int i = 0; i < 400; i++) {
result[i] = source0[i] + source1[i];

While structural variations exist—such as the use of nested inner loops or array-of-structures data layouts—the underlying computation relies fundamentally on this linear execution model.

### Parallel SIMD paradigm, packed registers (SWAR)

// for each vector
for (int elem = 0; elem < 100; elem++) {
vectorSum(result[elem], source0[elem], source1[elem]);

This model abstractly demonstrates the paradigm by assuming a generic `vector_sum` instruction. While this abstraction reflects how instruction intrinsics operate in practice, it omits underlying hardware implementation details—such as explicit data formats and component bit-widths—for clarity.

By operating on packed data structures, this method reduces the number of individual arithmetic instructions required to process the array components. Loop control and jump overhead are also reduced due to the lower iteration count. These efficiency gains are the direct result of executing multiple arithmetic operations simultaneously within a single instruction execution step.[10]

However, because a packed SIMD register has a fixed bit-width capacity, scalability is inherently bounded by the maximum register size. In this scenario, hardware acceleration is capped by the vector width of four parallel operations, a configuration standard in architectures such as AltiVec and Streaming SIMD Extensions (SSE).[11][1]

### Parallel stream paradigm (SIMD/MIMD)

// This is a fictional language for demonstration purposes.
elements = array streamElement([number, number])[100]
kernel = instance streamKernel("@arg0[@iter]")
result = kernel.invoke(elements)

In the stream processing paradigm, data is treated as an unbounded, continuous sequence of elements rather than a static dataset. Instead of managing iteration explicitly, the program defines a dataflow sequence, allowing the execution environment to apply the compute kernel function automatically as new data elements arrive. Although a 1:1 mapping between input and output data is commonly used for simplicity, it is not an inherent architectural requirement; kernels can perform complex transformations, aggregation windows, or stateful modifications.[12]

Compilers optimized for this paradigm can perform extensive automated code transformations, such as loop unrolling. This abstraction allows throughput to scale transparently with hardware capacity, enabling the utilization of hundreds of arithmetic logic units (ALUs).[13][14] Minimizing complex, unpredictable data access patterns ensures that a higher percentage of the hardware's peak execution capacity is accessible.

While stream processing shares characteristics with broader SIMD and MIMD architectures, the concepts remain distinct.[12] Although SIMD hardware often executes operations in a pipelined or streaming manner, standard SIMD performance characteristics differ; the stream processing model enforces structured dataflow and explicit memory management that permits significantly higher execution efficiency.[15]

When implemented on general-purpose architectures such as standard CPUs, stream processing abstractions frequently yielded limited performance gains, with some historical studies noting an execution speedup of only approximately 1.5x.[16] In contrast, early dedicated stream processors achieved performance increases exceeding 10x, primarily due to specialized hardware-managed register files and higher levels of parallel execution units.[17]

Despite variations in flexibility across implementation models, stream processing hardware generally imposes strict constraints on both kernel complexity and stream dimension sizes. For example, consumer-grade graphics processing hardware historically lacked high-precision arithmetic support, lacked complex pointer indirection capabilities, and enforced strict limits on maximum instruction counts.[18]

## Research

Early research in stream processing emerged in the late 1990s and early 2000s, driven by efforts to scale arithmetic intensity for graphics pipelines and high-performance computing. Academic projects, notably at Stanford University, pioneered early stream processing architectures and compiler designs that proved foundational to modern data-parallel hardware.[3][19] Concurrently, industrial researchers, including groups at AT&T, explored stream-enhanced processors to optimize signal processing and telecommunications workloads as graphics processing units rapidly gained performance and programmability.[1][20]

Following these foundational efforts, the paradigm transitioned from specialized experimental hardware to mainstream software ecosystems, resulting in the development of numerous dedicated stream processing languages and frameworks.[12]

### Programming and data layout considerations

A primary challenge in parallel computing is the complexity of mapping algorithms to hardware architectures while maintaining software development velocity and runtime performance. Early stream hardware, such as the Stanford Imagine prototype, mitigated this by utilizing a single-threaded programming model that abstracted memory allocation, data dependencies, and direct memory access (DMA) scheduling.[21] This task division emerged from research at the Massachusetts Institute of Technology (MIT) and Stanford University, which demonstrated that human programmers are highly effective at high-level algorithmic partitioning, whereas automated compilation tools excel at optimizing complex memory allocation and scheduling routines.[22][23] In contrast, asymmetric multicore architectures, such as the Cell Broadband Engine, shift structural partitioning, process synchronization, and load balancing overhead directly onto the software developer.[24]

Data structure layout significantly impacts the execution efficiency of parallel paradigms, typically requiring a choice between an array-of-structures (AoS) and a structure-of-arrays (SoA). In general-purpose software engineering, developers conventionally represent data entities in memory—for example, the location of a particle in 3D space, the color of a ball, and its size—as below below:[25]

// A particle in a three-dimensional space.
struct Particle {
double x;
double y;
double z;

// 8 bit per channel, say we care about RGB only
unsigned byte color[3];
float size;
// ... and many other attributes may follow...

When multiple entities exist in sequence, they are allocated end-to-end, forming an array of structures (AoS) topology. If an algorithm processes only a single attribute across all elements—such as modifying only the 3D coordinates—the execution engine must skip over the unused attributes in memory. Because conventional cache lines fetch memory in contiguous blocks, loading unneeded attributes results in inefficient cache utilization and wasted memory bandwidth. Furthermore, standard SIMD operations require input elements to be contiguous and properly aligned in memory to fill vector lanes efficiently.[25]

To optimize data streaming and vector execution, attributes can be separated into distinct parallel blocks using a structure of arrays (SoA) layout. An SoA representation isolates identical fields into individual, contiguous arrays, as shown below:

struct Particle {
double* x;
double* y;
double* z;

unsigned byte* colorRed;
unsigned byte* colorBlue;
unsigned byte* colorGreen;

float* size;

While the structure of arrays (SoA) layout optimizes uniform data paths, it introduces distinct architectural trade-offs. If a routine must simultaneously operate on multiple disparate attributes of a single entity, those attributes may reside far apart in virtual memory, resulting in severe cache misses and increased address translation overhead. Furthermore, ensuring that each separate array meets hardware memory alignment boundaries can necessitate data padding, which increases overall memory footprints. Dynamic memory management also becomes highly complex when elements must be added or removed, as modifications require shifting elements synchronously across multiple disconnected arrays.[26]

Conversely, dedicated stream processing architectures heavily utilize structured abstractions to unify these layouts. In contemporary graphics processing units (GPU) vertex pipelines, hardware provides a fixed number of attribute slots—historically standardizing around 16 input lines.[27] The application specifies the component count and data type format for each input stream, though hardware support is typically restricted to primitive numeric data types. These independent attributes are bound to a cohesive memory block via an explicit stride parameter. By adjusting the byte stride between consecutive array elements, developers can format the data stream as either interleaved arrays of structures (AoS) or separate structures of arrays (SoA). At the execution stage, the GPU hardware automatically gathers these disparate attributes into a unified parameter packet—such as an explicit kernel structure or built-in global registers—executes the operations in parallel, and scatters the output results to an output buffer for subsequent processing pipeline stages.[28]

Modern stream processing frameworks introduce first-in, first-out (FIFO) abstractions to represent data execution pipelines as decoupled, directional topologies. This design allows developers to define explicit data-parallel dependencies while enabling the runtime environment to coordinate memory allocation, threading boundaries, and cross-kernel task scheduling transparently.[29]

An implementation of this streaming model in C++ is RaftLib, an open-source template library that enables developers to chain independent computational kernels into a dataflow graph using overloaded C++ stream operators.[30] To demonstrate this paradigm, the following code initializes an asynchronous text-generation stream linked to a standard output kernel:

import <raft>;
import <raftio>;

import std;

using String = std::string;

using RaftKernel = raft::kernel;
using RaftKernelStatus = raft::kstatus;
using RaftMap = raft::map;
using RaftPrint = raft::print;

class HelloWorld : public RaftKernel {
public:
HelloWorld() {
output.addPort<String>("0");

virtual RaftKernelStatus run() {
output["0"].push("Hello World\n");
return raft::stop;

int main(int argc, char* argv[]) {
// instantiate print kernel
RaftPrint<String> p;

// instantiate hello world kernel
HelloWorld hello;

// make a map object
RaftMap m;

// add kernels to map, both hello and p are executed concurrently
m += hello >> p;

// execute the map
m.exe();

return 0;

### Models of computation

Beyond high-level procedural programming languages, stream processing applications are formally structured via distinct models of computation (MoCs). These include structured dataflow models and process-based concurrent frameworks (such as Kahn process networks), which mathematically represent computational dependencies and pipelined execution stages.[31]

### Processor architecture comparisons

Historically, general-purpose central processing units (CPUs) implemented increasingly complex, multi-tiered memory access hierarchies to mitigate the growing performance discrepancy between raw core execution speeds and external memory bandwidth. To mask these memory latencies, a substantial percentage of conventional CPU die area is allocated to automated cache tracking, branch prediction, and speculative execution logic. Consequently, only a minor fraction of the hardware footprint—historically estimated at less than 10%—is dedicated directly to arithmetic logic units (ALUs).[32]

Stream processing hardware structures minimize this management overhead by leveraging explicit dataflow restrictions.[32] Structurally, stream processors typically operate within a co-processing environment; a primary host CPU remains responsible for executing the operating system, orchestrating system resource allocations, and managing application-level thread boundaries, while the stream processor focuses entirely on high-throughput arithmetic acceleration.[33]

To maintain maximum throughput, stream processors utilize wide, dedicated memory buses. Early designs utilized multi-segment crossbars across varying bus widths (such as 128-bit or 256-bit topologies), prioritizing memory bandwidth over latency. This contrasts with historical scalar computing platforms, which traditionally relied on narrower single-channel memory channels. Furthermore, memory access paths within a stream engine remain highly predictable; stream data dimension bounds are fixed explicitly upon kernel invocation, transforming arbitrary multiple-pointer indirections into bounded indirection chains that resolve to explicit stream memory regions.[32]

Because execution units are organized into dense parallel arithmetic clusters managed by convergent VLIW and SIMD control paradigms, read and write operations are processed via bulk streaming transfers. These systems decouple intermediate application data, completing a vast majority of calculation tasks directly on-chip through an explicit three-tiered data bandwidth hierarchy.[33]

### Hardware-in-the-loop issues

Although an order of magnitude speedup can be achieved by parallel streaming architectures, not all workloads benefit from this model. Inter-processor communication latency represents a significant bottleneck. While modern system buses, such as PCI Express, provide high-bandwidth, full-duplex communication pipelines, the latency overhead of transferring data between the host memory and the stream processor's discrete memory space remains substantial. Consequently, utilizing a stream coprocessor for small datasets is frequently inefficient. Because reconfiguring execution state or compiling a new kernel introduces significant latency, the architecture also incurs severe performance penalties when processing small stream dimensions—a phenomenon known as the short stream effect.[34]

Early programmable graphics hardware heavily relied on deep, specialized execution pipelines to maximize throughput. However, frequent state changes—such as switching shader programs or updating memory bindings—disrupted pipeline efficiency and introduced heavy driver validation overhead. To mitigate these penalties in real-time rendering pipelines, developers introduced software-level optimization patterns such as "über-shaders" (large, monolithic kernels that handle multiple material types via conditional branches) and "texture atlases" (consolidating independent texture resources into a single, contiguous memory layout to avoid binding switches). While these techniques originated within real-world video game engines, the underlying principles apply broadly to generic stream processing to maximize kernel execution runtime and prevent hardware stall states.[35]

## Historical examples and evolution

### Early dedicated architecture

* Commodore Amiga Blitter (1985): An early hardware implementation of stream-like data manipulation. The Amiga blitter operated as a dedicated graphics coprocessor, capable of combining up to three distinct memory bitstream sources through bitwise logic operations to generate a single output stream. This pipeline moved data at a peak input bandwidth of 42 megabits per second, bypassing the main CPU to accelerate 2D graphics rendering.[36]

* Stanford Imagine Project (1996–2002): Funded by DARPA, Intel, and Texas Instruments, this academic research project pioneered the modern stream architecture. The project developed a flexible prototype chip that combined an array of arithmetic logic units (ALUs) with a centralized, software-managed Stream Register File (SRF) to maximize energy efficiency and computational throughput.

* Stanford Merrimac (2004): A follow-up academic initiative that extended the Imagine streaming architecture into the supercomputing domain. It utilized specialized interconnection networks to deliver high performance-per-dollar ratios for scientific computing workloads compared to standard cluster computers of its era.[37]

* Stream Processors, Inc. Storm-1 (2007): A commercial spin-off of the Stanford Imagine project. The Storm-1 architecture targeted high-end digital signal processing (DSP) markets, such as video conferencing and digital surveillance. It scaled performance from 30 to 220 billion operations per second (GOPS) by clustering streaming ALUs on a single chip.

### Graphics processing units (GPUs)

Modern graphics processing units (GPUs) represent the most widespread commercial evolution of stream processing. Their architectural progression transitioned hardware from rigid, fixed-function pipelines into general-purpose stream engines:[38]

* Fixed-Function Era (Pre-2001): Early graphics hardware offered no explicit developer access to stream processing. Streaming operations were entirely abstracted inside graphics application programming interfaces (APIs), restricting hardware customization.
* Early Vertex Programmability (2001–2002): Microarchitectures like the ATI R200 and Nvidia NV20 introduced explicit programmer control, but strictly for vertex processing pipelines. Fragment/pixel processing remained bound to older paradigms. A total lack of conditional execution (branching support) limited these early chips to simple, linear mathematical models, such as basic fluid dynamics simulations.
* Dynamic Control Flow (2003–2004): Architectures like the ATI R300 and Nvidia NV40 introduced flexible control flow and branching. While constrained by instruction count ceilings and limited loop nesting depths, these chips allowed data streams to diverge based on runtime calculation states.
* Unified Stream Architectures (2006–Present): Later generations unified independent vertex and pixel pipelines into homogenous arrays of programmable stream cores. Hardware iterations introduced specialized stream mechanics—such as hardware-level atomic operations and dynamic append/consume buffers—enabling complex, general-purpose GPU computing (GPGPU). This evolution spawned dedicated data-center product lines for High-Performance Computing (HPC), including the Nvidia Tesla and AMD FireStream brands.

### Cell broadband engine

Developed by an alliance of Sony, Toshiba, and IBM (STI), the Cell processor functions as a hybrid streaming architecture when paired with specialized software toolchains. The chip features a primary controlling processor—the Power Processing Element (PPE)—and an array of vector coprocessors called Synergistic Processing Elements (SPEs). Because each SPE possesses an independent instruction memory space and program counter, the chip behaves as a multiple instruction, multiple data (MIMD) environment. However, due to severe local memory constraints, software must utilize explicit direct memory access (DMA) commands to stream data sequentially through the SPEs. When software algorithms are completely restructured to adhere strictly to this stream programming model, the hardware's execution efficiency matches that of dedicated stream processors.[24]

## Stream programming libraries and languages

Most stream processing frameworks build upon established general-purpose languages such as C, C++, or Java. These ecosystems extend baseline language capabilities through dedicated application programming interfaces (APIs), custom compiler pragmas, or custom domain-specific languages (DSLs) to define bounded kernel execution blocks and streaming topologies. Additionally, high-level programmable shading languages function fundamentally as hardware-targeted stream processing languages.[39]

### Academic and open-source environments

* ACOTES Programming Model: A structured programming framework developed by the Polytechnic University of Catalonia, leveraging OpenMP directives to optimize data-parallel streams.
* Ateji PX (Free Edition): An extension for the Java virtual machine (JVM) designed to express stream programming, the actor model, and MapReduce abstractions.

* Auto-Pipe: Developed by the Stream Based Supercomputing (SBS) Lab at Washington University in St. Louis. It provides a heterogeneous development environment coordinating pipelines across CPUs (via C/C++ or Java), FPGAs (via Verilog/VHDL), and GPUs (via CUDA).
* BeepBeep: A lightweight, Java-based event stream processing library engineered by the Formal Computer Science Lab at Université du Québec à Chicoutimi.
* Brook: A foundational data-parallel streaming language extension developed by Stanford University to abstract GPU programming.
* CAL Actor Language: A high-level dataflow programming language designed to author stateful operators (actors) that transform incoming token streams into deterministic output streams.
* Cal2Many: A compiler framework from Halmstad University that translates high-level CAL actor code into target-specific low-level source, including parallel C and hardware description models.
* DUP programming language: A stream programming language developed concurrently by the Technical University of Munich and the University of Denver.
* HSTREAM: A directive-based source-to-source compiler extension designed to facilitate stream processing across heterogeneous CPU and GPU execution resources similar to OpenMP compilation patterns.
* RaftLib: An open-source C++ template library that utilizes native C++ stream operators (>>) to assemble concurrent computational kernels into unified dataflow topologies.[30]
* Sh: A foundational meta programming library developed at the University of Waterloo for running stream programs on GPUs, which served as the codebase for RapidMind.
* S-Net: A coordination language engineered at the University of Hertfordshire that completely decouples stream orchestration logic from structural algorithms.
* SPar: A C++ domain-specific language designed by the Application Modelling Group (GMAP) at the Pontifical Catholic University of Rio Grande do Sul to express stream parallelism via attribute annotations.
* StreamIt: A specialized language and compiler infrastructure developed at MIT designed specifically to optimize stream-parallel pipelines.
* WaveScript: A functional stream processing language developed at MIT and optimized for handling high-rate sensor streams and distributed signal networks.

### Commercial and proprietary architectures

* Embiot (Telchemy): A lightweight embedded streaming analytics agent designed to process sensor streams directly within resource-constrained edge computing environments.
* Floodgate: A stream-processing engine bundled historically with the Gamebryo engine to manage multi-core task distributions on consumer video game consoles.
* Jacket (AccelerEyes): A commercial engine designed to compile and accelerate MATLAB computing structures directly over GPU stream units.
* OpenHMPP: A directive-based programming model designed to simplify the deployment of streaming kernels onto heterogeneous many-core accelerators.
* PeakStream: A commercial spin-out of the Stanford Brook project, subsequently acquired by Google in 2007.
* RapidMind: A commercial software platform that evolved from the University of Waterloo's Sh library, subsequently acquired by Intel in 2009.
* SPADE (IBM): The Stream Processing Application Declarative Engine, which serves as the foundational declarative streaming language for IBM's enterprise System S platform.[40]
* TStreams: A declarative task-streaming runtime developed at the Hewlett-Packard Cambridge Research Laboratory to exploit multi-core concurrency.

### Vendor-specific hardware languages

* Brook+: An AMD-optimized, hardware-accelerated commercial implementation of the Stanford Brook language framework.
* CUDA (Compute Unified Device Architecture): Nvidia's proprietary parallel computing platform and API model for executing streaming kernels on graphics hardware.
* Intel Ct: Intel's historical C/C++ language extension designed to automatically vectorize and stream data loops across multi-core processors.
* StreamC: A streaming language developed by Stream Processors, Inc., based directly on the Stanford Imagine processor microarchitecture.

### Distributed event and complex event processing (CEP) engines

* Apache NiFi: An integrated data logistics system designed to automate and manage the continuous directed graph flow of data between software systems.
* Apama: A high-throughput, low-latency complex event processing and streaming analytics engine developed by Software AG.
* Wallaroo: An open-source, distributed elastic stream processing framework designed for low-latency metrics handling.
* WSO2 Stream Processor / Siddhi: An open-source, cloud-native streaming and complex event processing engine that ingests, analyzes, and reacts to real-time streams via SQL-like queries.

### Distributed and cloud-scale execution ecosystems

Modern cluster-scale data infrastructure categorizes stream architectures based on their execution models:

* Native Continuous Stream Processing: Frameworks that process elements individually as they arrive, optimizing for sub-second, real-time latencies:
* Apache Storm: A native, low-latency distributed real-time computation system.
* Apache Flink: A true streaming execution engine that treats batch computing strictly as a specialized subset of continuous streaming.
* Apache Samza: A stateful distributed stream processing engine built over Apache Kafka.
* Micro-Batch Stream Processing: Frameworks that achieve high-throughput stream semantics by automatically collecting incoming elements into tightly constrained time windows or miniature batches:
* Apache Spark Streaming: An extension of the core Apache Spark API that ingests live data streams and processes them in small discrete chunks (micro-batches).
* Distributed Logging Fabrics: Infrastructure that serves as the persistent, append-only transport layer for continuous stream architectures:
* Apache Kafka: A highly scalable, distributed event streaming platform used to ingest and store fault-tolerant streams of records.

### Managed cloud streaming services

* Amazon Web Services (AWS) Kinesis: A managed cloud service for real-time processing of large-scale, distributed data streams.
* Google Cloud Dataflow: A fully managed cloud service executing unified stream and batch processing pipelines based on the Apache Beam architecture.
* IBM Streams / Streaming Analytics: Cloud and on-premises execution environments for low-latency streaming applications written in SPL.
* Microsoft Azure Stream Analytics: A managed real-time complex event processing engine designed to evaluate data streams from applications and IoT devices.
* MongoDB Atlas Stream Processing: A managed database stream routing engine designed to continuously process and aggregate active document changes.
* SQLStreamBuilder (Eventador): A managed interface enabling continuous complex pattern detection over Kafka structures via standard declarative SQL queries.

## See also

* Data stream mining
* Data Stream Management System
* Dimension reduction
* Flow-based programming
* Hardware acceleration
* Molecular modeling on GPU
* Parallel computing
* Partitioned global address space
* Real-time computing
* Real Time Streaming Protocol
* SIMT
* Streaming algorithm
* Vector processor

## References

1. ↑ 1.0 1.1 A Short Intro to Stream Processing
2. ↑ FCUDA: Enabling Efficient Compilation of CUDA Kernels onto FPGAs
3. ↑ 3.0 3.1 Rixner, Scott; Dally, William J.; Kapasi, Ujval J.; Khailany, Brucek; López-Lagunas, Abelardo; Mattson, Peter R.; Owens, John D. (1998). "A Bandwidth-Efficient Architecture for Media Processing". Micro 31. https://swh.princeton.edu/~rblee/ELE572Papers/imagineforMediaProc_daly.pdf.
4. ↑ "The Imagine Stream Processor". 2002. pp. 141–146. doi:10.1109/ICCD.2002.1106783. https://ieeexplore.ieee.org/document/1106783/.
5. ↑ AliciaLiMicrosoft. "JOIN - Stream Analytics Query" (in en-us). https://learn.microsoft.com/en-us/stream-analytics-query/join-azure-stream-analytics.
6. ↑ Luckham, David C. (2002). The power of events: an introduction to complex event processing in distributed enterprise systems. Boston: Addison-Wesley. ISBN 978-0-201-72789-0.
7. ↑ 7.0 7.1 Flynn, Michael J. (September 1972). "Some Computer Organizations and Their Effectiveness". IEEE Transactions on Computers C-21 (9): 948–960. doi:10.1109/TC.1972.5009071. ISSN 1557-9956. https://ieeexplore.ieee.org/document/5009071.
8. ↑ 8.0 8.1 Hennessy, John L.; Patterson, David A.; Kozyrakis, Christos (2026). Computer architecture: a quantitative approach (Seventh ed.). San Francisco: Morgan Kaufmann Publischers an imprint of Elsevier. ISBN 978-0-443-15407-2.
9. ↑ "PhD Thesis "Vector Microprocessors" by Krste Asanović". https://people.eecs.berkeley.edu/~krste/thesis.html.
10. ↑ Fisher, Randall J.; Dietz, Henry G. (1999). Chatterjee, Siddhartha; Prins, Jan F.; Carter, Larry et al.. eds. "Compiling for SIMD Within a Register" (in en). Languages and Compilers for Parallel Computing (Berlin, Heidelberg: Springer): 290–305. doi:10.1007/3-540-48319-5_19. ISBN 978-3-540-48319-9. https://link.springer.com/chapter/10.1007/3-540-48319-5_19.
11. ↑ "Intel® 64 and IA-32 Architectures Optimization Reference Manual Volume 1". https://www.intel.com/content/www/us/en/content-details/821612/intel-64-and-ia-32-architectures-optimization-reference-manual-volume-1.html.
12. ↑ 12.0 12.1 12.2 Stephens, Robert (1997-07-01). "A survey of stream processing" (in en). Acta Informatica 34 (7): 491–541. doi:10.1007/s002360050095. ISSN 1432-0525. https://doi.org/10.1007/s002360050095.
13. ↑ IEEE Journal of Solid-State Circuits:"A Programmable 512 GOPS Stream Processor for Signal, Image, and Video Processing", Stanford University and Stream Processors, Inc.
14. ↑ Khailany, Dally, Rixner, Kapasi, Owens and Towles: "Exploring VLSI Scalability of Stream Processors", Stanford and Rice University.
15. ↑ Kapasi, U.J.; Dally, W.J.; Ahn, J.H.; Mattson, P.; Owens, J.D. (2003). "Programmable Stream Processors". IEEE Computer 36 (8). http://dx.doi.org/10.1109/MC.2003.1220582.
16. ↑ Gummaraju and Rosenblum, "Stream processing in General-Purpose Processors", Stanford University.
17. ↑ Kapasi, Dally, Rixner, Khailany, Owens, Ahn and Mattson, "Programmable Stream Processors", Universities of Stanford, Rice, California (Davis) and Reservoir Labs.
18. ↑ Owens, John D.; Luebke, David; Govindaraju, Naga; Harris, Mark; Krüger, Jens; Lefohn, Aaron E.; Purcell, Timothy J. (2005). "A Survey of General-Purpose Computation on Graphics Hardware". Eurographics. https://research.nvidia.com/sites/default/files/pubs/2005-08_A-Survey-of/ASurveyofGeneralPurposeComputationonGraphicsHardware.pdf.
19. ↑ "A Real-Time Procedural Shading System for Programmable Graphics Hardware". https://graphics.stanford.edu/~kekoa/talks/sigpaper-20010815/.
20. ↑ "Merrimac - Stanford Streaming Supercomputer Project". Group web site. http://merrimac.stanford.edu/.
21. ↑ "Stream Architecture". http://cva.stanford.edu/projects/imagine/project/im_arch.html.
22. ↑ "StreamIt". https://groups.csail.mit.edu/cag/streamit/.
23. ↑ Thies, William; Karczmarek, Michał; Amarasinghe, Saman (2002). "StreamIt: A Language for Streaming Applications". CC '02: Proceedings of the 11th International Conference on Compiler Construction. https://groups.csail.mit.edu/cag/streamit/papers/streamit-cc.pdf.
24. ↑ 24.0 24.1 Johns, C. R.; Brokenshire, D. A. (2007-09-01). "Introduction to the cell broadband engine architecture". IBM Journal of Research and Development 51 (5): 503–519. doi:10.1147/rd.515.0503. ISSN 0018-8646. https://doi.org/10.1147/rd.515.0503.
25. ↑ 25.0 25.1 Homann, Holger; Laenen, Francois (2017-10-10). "SoAx: A generic C++ Structure of Arrays for handling Particles in HPC Codes" (in en). https://arxiv.org/abs/1710.03462v1.
26. ↑ Sharp, Amanda K.. "Memory Layout Transformations" (in en). https://www.intel.com/content/www/us/en/developer/articles/technical/memory-layout-transformations.html.
27. ↑ "Vertex Specification - OpenGL Wiki" (in en). https://wikis.khronos.org/opengl/Vertex_Specification.
28. ↑ "Attributes | luma.gl" (in en). https://luma.gl/docs/api-guide/gpu/gpu-attributes/.
29. ↑ Beard, J. C.; Li, P.; Chamberlain, R. D. (2015). "RaftLib: A C++ Template Library for High Performance Stream Parallel Processing". International Conference on Parallel Programming. doi:10.1145/2712386.2712400. https://www.ccrc.wustl.edu/~roger/papers/blc15.pdf.
30. ↑ 30.0 30.1 RaftLib/RaftLib, RaftLib, 2026-07-08, https://github.com/RaftLib/RaftLib, retrieved 2026-07-09
31. ↑ Lee, E. A.; Parks, T. M. (1995). "Dataflow Process Networks". Proceedings of the IEEE 83 (5): 773–801. https://bears.ece.ucsb.edu/class/ece253/papers/lee_parks_ieee95.pdf.
32. ↑ 32.0 32.1 32.2 Dally, W. J.; Kapasi, U. J.; Khailany, B.; Ahn, J. H. (2004). Stream Processing on Imagine. Stanford University Computer Systems Laboratory. http://cva.stanford.edu/classes/cs99s/papers/imagine-ieeemicro.pdf.
33. ↑ 33.0 33.1 Rixner, S. (2001). Stream Processor Architecture (Ph.D.). Stanford University.
34. ↑ Dally, Bill (May 28, 2002). "Overview of Stream Processing". http://cva.stanford.edu/classes/ee482s/scribed/lect16.pdf.
35. ↑ Trapp, Matthias; Döllner, Jürgen (2007-07-03). "Automated Combination of Real-Time Shader Programs". Eurographics 2007 Shortpaper: 53–56. https://www.researchgate.net/publication/225091327_Automated_Combination_of_Real-Time_Shader_Programs.
36. ↑ Commodore-Amiga, Inc, ed (1989). Amiga hardware reference manual. Amiga technical reference series (Rev. & updated ed.). Reading, Mass: Addison-Wesley. ISBN 978-0-201-18157-9.
37. ↑ Dally, William J.; Labonte, Francois; Das, Abhishek; Hanrahan, Patrick; Ahn, Jung-Ho; Gummaraju, Jayanth; Erez, Mattan; Jayasena, Nuwan et al. (2003-11-15). "Merrimac: Supercomputing with Streams" (in en). SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (ACM): 35. doi:10.1145/1048935.1050187. ISBN 978-1-58113-695-1. https://dl.acm.org/doi/10.1145/1048935.1050187.
38. ↑ "CSDL | IEEE Computer Society". https://www.computer.org/csdl/magazine/mi/2021/06/09623445/1yJTrTqFnVu.
39. ↑ Memeti, Suejb; Pllana, Sabri (October 2018). "HSTREAM: A directive-based language extension for heterogeneous stream computing". 2018 IEEE International Conference on Computational Science and Engineering (CSE): 138–145. doi:10.1109/CSE.2018.00026. http://arxiv.org/abs/1809.09387.
40. ↑ Gedik, Bugra; Andrade, Henrique; Wu, Kun-Lung; Yu, Philip S.; Doo, Myungcheol (2008-06-09). "SPADE: the system s declarative stream processing engine". Proceedings of the 2008 ACM SIGMOD international conference on Management of data. SIGMOD '08 (New York, NY, USA: Association for Computing Machinery): 1123–1134. doi:10.1145/1376616.1376729. ISBN 978-1-60558-102-6. https://dl.acm.org/doi/10.1145/1376616.1376729.

* v
* t
* e

Parallel computing

General|

* Distributed computing
* Parallel computing
* Massively parallel
* Cloud computing
* High-performance computing
* Multiprocessing
* Manycore processor
* GPGPU
* Computer network
* Systolic array

Levels|

* Bit
* Instruction
* Thread
* Task
* Data
* Memory
* Loop
* Pipeline

Multithreading|

* Temporal
* Simultaneous (SMT)
* Speculative (SpMT)
* Preemptive
* Cooperative
* Clustered Multi-Thread (CMT)
* Hardware scout

Theory|

* PRAM model
* PEM Model
* Analysis of parallel algorithms
* Amdahl's law
* Gustafson's law
* Cost efficiency
* Karp–Flatt metric
* Slowdown
* Speedup

Elements|

* Process
* Thread
* Fiber
* Instruction window
* Array data structure

Coordination|

* Multiprocessing
* Memory coherency
* Cache coherency
* Cache invalidation
* Barrier
* Synchronization
* Application checkpointing

Programming|

* Stream processing
* Dataflow programming
* Models
* Implicit parallelism
* Explicit parallelism
* Concurrency
* Non-blocking algorithm

Hardware|

* Flynn's taxonomy
* SISD
* SIMD
* SIMT
* MISD
* MIMD
* Dataflow architecture
* Pipelined processor
* Superscalar processor
* Vector processor
* Multiprocessor
* symmetric
* asymmetric
* Memory
* shared
* distributed
* distributed shared
* UMA
* NUMA
* COMA
* Massively parallel computer
* Computer cluster
* Grid computer
* Hardware acceleration

APIs|

* Ateji PX
* Boost.Thread
* Chapel
* HPX
* Charm++
* Cilk
* Coarray Fortran
* CUDA
* HIP
* Dryad
* C++ AMP
* Global Arrays
* MPI
* OpenMP
* OpenCL
* OpenHMPP
* OpenACC
* TPL
* PLINQ
* PVM
* POSIX Threads
* RaftLib
* UPC
* TBB
* ZPL

Problems|

* Automatic parallelization
* Deadlock
* Livelock
* Deterministic algorithm
* Embarrassingly parallel
* Parallel slowdown
* Race condition
* Software lockout
* Scalability
* Starvation

* Category: parallel computing
* Media related to Parallel computing at Wikimedia Commons

* v
* t
* e

Programming paradigms

Imperative|

| Structured|

* Jackson structures
* Block-structured
* Modular
* Non-structured
* Procedural
* Programming in the large and in the small
* Design by contract
* Invariant-based
* Nested function

|

Object-oriented|

* Class-based, Prototype-based, Object-based
* Agent
* Immutable object
* Persistent
* Uniform function call syntax

Declarative|

| Functional|

* Recursive
* Anonymous function (Partial application)
* Higher-order
* Purely functional
* Total
* Strict
* GADTs
* Dependent types
* Functional logic
* Point-free style
* Expression-oriented
* Applicative, Concatenative
* Function-level, Value-level
* Monad

|

Dataflow|

* Flow-based
* Reactive (Functional reactive)
* Signals
* Streams
* Synchronous

Logic|

* Abductive logic
* Answer set
* Constraint (Constraint logic)
* Inductive logic
* Nondeterministic
* Ontology
* Probabilistic logic
* Query

Domain-
specific
language
(DSL)|

* Algebraic modeling
* Array
* Automata-based (Action)
* Command (Spacecraft)
* Differentiable
* End-user
* Grammar-oriented
* Interface description
* Language-oriented
* List comprehension
* Low-code
* Modeling
* Natural language
* Non-English-based
* Page description
* Pipes and filters
* Probabilistic
* Quantum
* Scientific
* Scripting
* Set-theoretic
* Simulation
* Stack-based
* System
* Tactile
* Templating
* Transformation (Graph rewriting, Production, Pattern)
* Visual

Concurrent,
parallel|

* Actor-based
* Automatic mutual exclusion
* Choreographic programming
* Concurrent logic (Concurrent constraint logic)
* Concurrent OO
* Macroprogramming
* Multitier programming
* Organic computing
* Parallel programming models
* Partitioned global address space
* Process-oriented
* Relativistic programming
* Service-oriented
* Structured concurrency

Metaprogramming|

* Attribute-oriented
* Automatic (Inductive)
* Dynamic
* Extensible
* Generic
* Homoiconicity
* Interactive
* Macro (Hygienic)
* Metalinguistic abstraction
* Multi-stage
* Program synthesis (Bayesian, by demonstration, by example, vibe coding)
* Reflective
* Self-modifying code
* Symbolic
* Template

Separation
of concerns|

* Aspects
* Components
* Data-driven
* Data-oriented
* Event-driven
* Features
* Literate
* Roles
* Subjects

Comparisons/Lists|

Comparison (multi-paradigm, object-oriented, functional), List (OO, by type)

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Stream processing. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Stream_processing&oldid=4568637"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template