Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huoding Li

dblp:17/3127 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing › heterogeneous architecture
heterogeneous multicore processors
0.012007
High definition H.264 decoding on cell broadband engine · ACM Multimedia 2007

Methods — techniques the papers use, named apart from their topics

h.264 decoding · 0.1
YearPublicationVenuePosition
2011 Automatic Loop Tiling for Direct Memory Access
abstract
In heterogeneous multi-core systems, such as the Cell BE processor, each accelerator core has its own fast local memory without hardware supported coherence and the software is responsible to dynamically transfer data between the fast local and slow global memory. The data can be transferred through either a software controlled cache or a direct buffer. The software controlled cache maintains correctness for arbitrary access patterns, but introduces the extra overhead of cache lookup. Direct buffer is efficient for regular accesses, while requiring precise analysis, detailed modeling of execution, and significant code generation. In this paper we present the design and implementation of {\em DMATiler} which combines compiler analysis and runtime management to optimize local memory performance via automatic loop tiling and buffer optimization techniques. The DMATiler chooses a data transfer friendly loop order and using a empirically validated DMA performance model, it formulates and solves a convex optimization problem to determine globally optimal tile sizes. Further, the DMATiler applies optimization techniques such compressed data transfers and DMA commands to achieve the best DMA performance for a given loop nest. We have implemented the DMATiler in the IBM XL Single Source Compiler (SSC), and have conducted experiments with a set of loop nest benchmarks. The results show that the DMATiler is much more efficient than software controlled cache (average speedup of 9.8x) and single level loop blocking (average speedup of 6.2x) on the Cell BE processor.
Lakshminarayanan Renganarayanan, Huoding Li, Tong Chen 0001, Kevin O'Brien, Ling Shao 0002
IPDPS4
2010 DMATiler: revisiting loop tiling for direct memory access
abstract
In this paper we present the design and implementation of a DMATiler which combines compiler analysis and runtime management to optimize local memory performance. In traditional cache model based loop tiling optimizations, the compiler approximates runtime cache misses as the number of distinct cache lines touched by a loop nest. In contrast, the DMATiler has the full control of the addresses, sizes, and sequences of data transfers. DMATiler uses a simplified DMA performance model to formulate the cost model for DMA-tiled loop nests, then solves it using a custom gradient descent algorithm with heuristics guided by DMA characteristics. Given a loop nest, DMATiler uses loop interchange to make the loop order more friendlier for data movements. Moreover, DMATiler applies compressed data buffer and advanced DMA command to further optimize data transfers. We have implemented the DMATiler in the IBM XL C/C++ for Multi-core Acceleration for Linux, and have conducted experiments with a set of loop nest benchmarks. The results show DMATiler is much more efficient than software controlled cache (average speedup of 9.8x) and single level loop blocking (average speedup of 6.2x) on the Cell BE processor.
Huoding Li, Tong Chen 0001, Lakshminarayanan Renganarayanan, Kevin O'Brien, Ling Shao 0002
PACT3
2009 Vectorized deblocking filter for HD H.264 decoding on Cell/B.E
abstract
For high definition (HD) H.264 decoding, deblocking filter is one of the most time-consuming modules. This paper proposes several vectorization approaches to speed up it on a single synergistic processor element (SPE) of IBM cell broadband engine (Cell/B.E.) processor, by which great performance improvements are achieved. The average deblocking speed is 42.4 frames per second (fps) for 141 1080 p H.264 video streams. The steady-going performance is obtained for different streams of various contents and bitrates. With the vectorized deblocking filter, the new HD H.264 decoder is able to decode two 1080 p H.264 video streams simultaneously on PlayStationreg3 (PS3) in real-time. The proposed approaches are practical on many other vector processor platforms, but not limited to Cell/B.E. processor.
Huoding Li
ICASSP1
2007 High definition H.264 decoding on cell broadband engine
abstract
This demo showcases high definition H.264 decoding capability of Cell Broadband Engine processor.
Huoding Li
ACM Multimedia3