Results 1 - 10 of 84

Detecting Coarse-Grain Parallelism Using an Interprocedural Parallelizing Compiler

by Mary W. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-wei Liao, Monica S. Lam , 1995
"... This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates a comprehensive and integrated collection of analyses, including privatization and reduction recognition for both array ..."
Abstract - Cited by 103 (23 self) - Add to MetaCart
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates a comprehensive and integrated collection of analyses, including privatization and reduction recognition for both array

Compiler support for exploiting coarse-grained pipelined parallelism

by Wei Du - In Supercomputing , 2003
"... The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This paper reports on a compilation system developed to exploit this form of parallelism. We use a dialect of Java that exposes ..."
Abstract - Cited by 16 (2 self) - Add to MetaCart
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This paper reports on a compilation system developed to exploit this form of parallelism. We use a dialect of Java that exposes

Exploiting Coarse-Grain Parallelism in the MPEG-2 Algorithm

by Eiji Iwata, Kunle Olukotun , 1998
"... As the demand for multimedia applications increases, the performance of algorithms such as MPEG-2 video compression on general-purpose microprocessors is becoming more important. In this paper, we propose a number of coarse-grained parallel implementations of MPEG-2 decoding and encoding. We evaluat ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
As the demand for multimedia applications increases, the performance of algorithms such as MPEG-2 video compression on general-purpose microprocessors is becoming more important. In this paper, we propose a number of coarse-grained parallel implementations of MPEG-2 decoding and encoding. We

Gop-Interlaced Coding Scheme For Enhancing Coarse-Grain Parallelism And Error Concealment

by Yen-Kuang Chen , Min-Tsong Chang, S. Y. Kung , 1998
"... The main novelty of this work is redefining the structure of the group-of-picture (GOP). More specifically, in the current MPEG and H.263 video coding standards, the GOP is a group of consecutive frames and two GOPs have no overlaps in time. In our scheme, the GOP is a group of nonconsecutive frame ..."
Abstract - Add to MetaCart
frames and the frames in two GOPs interleave with each other. There are many advantages of using the proposed encoding scheme, which interlaces the group-ofpicture (GOP). First, the encoding scheme is easily paralleled in coarse-grain. So far, no state-of-the-art microprocessors can provide enough

Automatic coarse grain task parallel processing on smp using openmp

by Hironori Kasahara, Motoki Obata, Kazuhisa Ishizaka - Proc. of 13 th International Workshop on Languages and Compilers for Parallel Computing , 2001
"... This paper proposes a simple and efficient implementation method for a hierarchical coarse grain task parallel processing scheme on a SMP machine. OSCAR multigrain parallelizing compiler automatically generates parallelized code including OpenMP directives and its performance is evaluated on a comme ..."
Abstract - Cited by 10 (7 self) - Add to MetaCart
This paper proposes a simple and efficient implementation method for a hierarchical coarse grain task parallel processing scheme on a SMP machine. OSCAR multigrain parallelizing compiler automatically generates parallelized code including OpenMP directives and its performance is evaluated on a

Abstract Exploiting Coarse-Grain Parallelism in the MPEG-2 Algorithm

by Eiji Iwata, Kunle Olukotun
"... As the demand for multimedia applications increases, the performance of algorithms such as MPEG-2 video compression on general-purpose microprocessors is becoming more important. In this paper, we propose a number of coarse-grained parallel implementations of MPEG-2 decoding and encoding. We evaluat ..."
Abstract - Add to MetaCart
As the demand for multimedia applications increases, the performance of algorithms such as MPEG-2 video compression on general-purpose microprocessors is becoming more important. In this paper, we propose a number of coarse-grained parallel implementations of MPEG-2 decoding and encoding. We

Toward Thread-Level Speculation for Coarse-Grained Parallelism with Regular Access Patterns ⋆

by Ravi Ramaseshan, Frank Mueller
"... Abstract. Recent work on transactional memory (TM) bears promise to exploit multicore capabilities. TM extensions for thread-level speculative parallelism (TLS) have predominantly focused on integer benchmarks with short critical sections and exploit limited on-chip buffering space to store shadow v ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
values needed to potentially abort transactions. In contrast, scientific codes generally provide coarse-grained parallel regions with potentially shared memory accesses, which do not fit into size-limited shadow buffers. Hence, such codes represent a mismatch for TM-TLS. This work contributes mechanisms

Design Evaluation of OpenCL Compiler Framework for Coarse-Grained Reconfigurable Arrays

by Hee-seok Kim, Minwook Ahn, John A. Stratton, Wen-mei W. Hwu
"... Abstract—OpenCL is undoubtedly becoming one of the most popular parallel programming languages as it provides a stan-dardized and portable programming model. However, adopting OpenCL for Coarse-Grained Reconfigurable Arrays (CGRA) is challenging due to divergent architecture capability compared to G ..."
Abstract - Add to MetaCart
Abstract—OpenCL is undoubtedly becoming one of the most popular parallel programming languages as it provides a stan-dardized and portable programming model. However, adopting OpenCL for Coarse-Grained Reconfigurable Arrays (CGRA) is challenging due to divergent architecture capability compared

H.264 Coarse Grain Scalable (CGS) and Medium Grain Scalable (MGS) Encoded Video: A Trace Based Traffic and Quality Evaluation

by Rohan Gupta, Akshay Pulipaka, Patrick Seeling, Lina J. Karam, Martin Reisslein
"... Abstract—The scalable video coding (SVC) extension of the H.264/AVC video coding standard provides two mechanisms, namely coarse grain scalability (CGS) and medium grain scalability (MGS), for quality scalable video encoding, which varies the fidelity (signal-to-noise ratio) of the encoded video str ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract—The scalable video coding (SVC) extension of the H.264/AVC video coding standard provides two mechanisms, namely coarse grain scalability (CGS) and medium grain scalability (MGS), for quality scalable video encoding, which varies the fidelity (signal-to-noise ratio) of the encoded video

Mapping control-intensive video kernels onto a coarse-grain reconfigurable architecture

by C. Arbelo, A. Kanstein, S. López, J. F. López, M. Berekovic, R. Sarmiento, J. -y. Mignolet - the H.264/ AVC deblocking filter. Design, Automation, and Test in Europe (DATE , 2007
"... Deblocking filtering represents one of the most compute intensive tasks in an H.264/AVC standard video decoder due to its demanding memory accesses and irregular data flow. For these reasons, an efficient implementation poses big challenges, especially for programmable platforms. In this sense, the ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
, the mapping of this decoder’s functionality onto a C-programmable coarse-grained reconfigurable architecture named ADRES (Architecture for Dynamically Reconfigurable Embedded Systems) is presented in this paper, including results from the evaluation of different topologies. The results obtained show a
Results 1 - 10 of 84