Results 1 - 10 of 368

A Data Locality Optimizing Algorithm

by Michael E. Wolf, Monica S. Lam , 1991
"... This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation algorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory that unifi ..."
Abstract - Cited by 804 (16 self) - Add to MetaCart
This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation algorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory

IMPROVING THE PARALLELIZATION EFFICIENCY OF HEVC DECODING

by Chi Ching Chi, Mauricio Alvarez-mesa, Ben Juurlink, Valeri George, Thomas Schierl
"... In this paper we present a new parallelization approach for HEVC decoding called Overlapped Wavefront (OWF). It is based on wavefront processing and improves its paral-lelization efficiency by allowing overlapped execution of consecutive pictures. Furthermore, in this strategy of the de-coding steps ..."
Abstract - Add to MetaCart
In this paper we present a new parallelization approach for HEVC decoding called Overlapped Wavefront (OWF). It is based on wavefront processing and improves its paral-lelization efficiency by allowing overlapped execution of consecutive pictures. Furthermore, in this strategy of the de

PARALLEL VIDEO DECODING IN THE EMERGING HEVC STANDARD

by Mauricio Alvarez-mesa, Chi Ching Chi, Ben Juurlink, Valeri George, Thomas Schierl
"... In this paper we propose and evaluate a parallelization strat-egy for the emerging HEVC video coding standard. The pro-posed strategy is based on entropy slices which allows ex-ploiting parallelism in the entropy decoding stage while main-taining high coding efficiency. Our approach requires to en-c ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
In this paper we propose and evaluate a parallelization strat-egy for the emerging HEVC video coding standard. The pro-posed strategy is based on entropy slices which allows ex-ploiting parallelism in the entropy decoding stage while main-taining high coding efficiency. Our approach requires to en

A class of parallel tiled linear algebra algorithms for multicore architectures

by Alfredo Buttari, Julien Langou, Jakub Kurzak, Jack Dongarra
"... Abstract. As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a ..."
Abstract - Cited by 169 (58 self) - Add to MetaCart
Abstract. As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a

HEVC Deblocking Filter

by Andrey Norkin, Gisle Bjøntegaard, Arild Fuldseth, Matthias Narroschke, Masaru Ikeda, Kenneth Andersson, Minhua Zhou, Geert Van Der Auwera
"... Abstract—This paper describes the in-loop deblocking filter used in the upcoming High Efficiency Video Coding (HEVC) standard to reduce visible artifacts at block boundaries. The deblocking filter performs detection of the artifacts at the coded block boundaries and attenuates them by applying a sel ..."
Abstract - Add to MetaCart
selected filter. Compared to the H.264/AVC deblocking filter, the HEVC deblocking filter has lower computational complexity and better parallel processing capabilities while still achieving significant reduction of the visual artifacts. Index Terms—Block-based coding, deblocking, video coding, video

Parallel tiled QR factorization for multicore architectures

by Alfredo Buttari, Julien Langou, Jakub Kurzak, Jack Dongarra , 2007
"... As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a major requ ..."
Abstract - Cited by 81 (41 self) - Add to MetaCart
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a major

PARALLEL AMVP CANDIDATE LIST CONSTRUCTION FOR HEVC

by Liang Zhao, Qin Yu, Liang Zhao, Siwei Ma , 2012
"... Advanced motion vector prediction (AMVP) is one of the most important inter prediction coding tools adopted in the state-of-the-art HEVC coding standard, which does great effect on the coding efficiency. However, the current AMVP design is highly sequential and thus restricts the throughput both on ..."
Abstract - Add to MetaCart
on the encoder and the decoder sides. To facilitate the parallel processing and enlarge the throughput, a parallel AMVP candidate list (AMVPCL) construction solution is proposed. The proposed parallel scheme consists of a three level fine granularity solutions. The first level is a CU-based approach

Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation

by T. Kisuki, P.M.W. Knijnenburg , 2000
"... Loop tiling and unrolling are two important program transformations to exploit locality and expose instruction level parallelism, respectively. However, these transformations are not independent and each can adversely affect the goal of the other. Furthermore, the best combination will vary drama ..."
Abstract - Cited by 108 (9 self) - Add to MetaCart
Loop tiling and unrolling are two important program transformations to exploit locality and expose instruction level parallelism, respectively. However, these transformations are not independent and each can adversely affect the goal of the other. Furthermore, the best combination will vary

MULTICORE BASED HIGHLY PARALLEL AND FLEXIBLE FRAMEWORK FOR HEVC MOTION ESTIMATION

by Yufeng Bai, Yibo Fan, Yanheng Lu, Xiaoyang Zeng
"... In this work, a highly parallel and flexible framework based on a multicore processor which is especially optimized for computation-intensive execution is proposed to accelerate motion estimation for HEVC. Using multilevel on-chip communication mechanism greatly enhances efficiency and flexibility o ..."
Abstract - Add to MetaCart
In this work, a highly parallel and flexible framework based on a multicore processor which is especially optimized for computation-intensive execution is proposed to accelerate motion estimation for HEVC. Using multilevel on-chip communication mechanism greatly enhances efficiency and flexibility

Algorithmic Self-Assembly of DNA

by Erik Winfree , 1998
"... How can molecules compute? In his early studies of reversible computation, Bennett imagined an enzymatic Turing Machine which modified a hetero-polymer (such as DNA) to perform computation with asymptotically low energy expenditures. Adleman's recent experimental demonstration of a DNA computat ..."
Abstract - Cited by 156 (6 self) - Add to MetaCart
computation, using an entirely different approach, has led to a wealth of ideas for how to build DNA-based computers in the laboratory, whose energy efficiency, information density, and parallelism may have potential to surpass conventional electronic computers for some purposes. In this thesis, I examine one
Results 1 - 10 of 368