The increasing gap between processor and memory speeds is a well-known problem in modern computer architecture. The Imagine system is designed to address the processor-memory gap through streaming technology. Stream processors are best-suited for computationally intensive applications characterized by high data parallelism and producer-consumer locality with minimal data dependencies. This work examines an efficient streaming implementation of the computationally intensive Transitive Closure (TC) algorithm on the Imagine platform. We develop a tiled TC algorithm specifically for the Imagine environment, which efficiently reuses streams to minimize expensive off-chip data transfers. The implementation requires complex stream programming sinc...
International audienceStreaming applications come from various application fields such as physics, w...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
International audienceStream languages explicitly describe fork-join parallelism and pipelines, offe...
Media applications are characterized by large amounts of available parallelism, little data reuse, a...
Conference paperMedia applications are characterized by large amounts of available parallelism, litt...
This thesis considers how to exploit the specific characteristics of data streaming functions and mu...
Journal PaperThe Power-efficient Imagine stream processor achieves performance densities comparable ...
Embedded streaming applications specified using parallel Models of Computation (MoC) often contain a...
This paper presents a partitioning and allocation algorithm for an iterative stream compiler, target...
The growing disparity between processor and memory speeds has caused memory bandwidth to become the ...
We introduce K-model, a computational model to evaluate the algorithms designed for graphic processo...
Abstract With the increasing miniaturization of transistors, wire delays are becoming a dominant fac...
Streamsurfaces are one of the powerful visualization tools, which are used to gain insight into char...
The StreamIt programming model has been proposed to exploit parallelism in streaming applications ...
The stream processing paradigm is used in several scientific and enterprise applications in order to...
International audienceStreaming applications come from various application fields such as physics, w...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
International audienceStream languages explicitly describe fork-join parallelism and pipelines, offe...
Media applications are characterized by large amounts of available parallelism, little data reuse, a...
Conference paperMedia applications are characterized by large amounts of available parallelism, litt...
This thesis considers how to exploit the specific characteristics of data streaming functions and mu...
Journal PaperThe Power-efficient Imagine stream processor achieves performance densities comparable ...
Embedded streaming applications specified using parallel Models of Computation (MoC) often contain a...
This paper presents a partitioning and allocation algorithm for an iterative stream compiler, target...
The growing disparity between processor and memory speeds has caused memory bandwidth to become the ...
We introduce K-model, a computational model to evaluate the algorithms designed for graphic processo...
Abstract With the increasing miniaturization of transistors, wire delays are becoming a dominant fac...
Streamsurfaces are one of the powerful visualization tools, which are used to gain insight into char...
The StreamIt programming model has been proposed to exploit parallelism in streaming applications ...
The stream processing paradigm is used in several scientific and enterprise applications in order to...
International audienceStreaming applications come from various application fields such as physics, w...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
International audienceStream languages explicitly describe fork-join parallelism and pipelines, offe...