Demo Data from SIGIR 2026 / reviewers in the wild / expert
Deependra Talla
dblp:76/5527
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 4 first-authorSoftware engineering, systems software and programming languages · 1
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.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Processor architecture and microarchitecture · 95% Embedded and real-time systems · 5% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
instruction-level parallelism |
0.1 | 2 | 2003 | Bottlenecks in Multimedia Processing with SIMD Style Extensions and Architectural Enhancements · IEEE Trans. Computers 2003 Allowing for ILP in an embedded Java processor · ISCA 2000 |
Processor architecture and microarchitecture › SIMD
SIMD extensions |
0.0 | 1 | 2003 | Bottlenecks in Multimedia Processing with SIMD Style Extensions and Architectural Enhancements · IEEE Trans. Computers 2003 |
Processor architecture and microarchitecture › front-end
instruction fetch and decode |
0.0 | 1 | 2000 | Allowing for ILP in an embedded Java processor · ISCA 2000 |
Processor architecture and microarchitecture › instruction set architecture › high-level language architecture
java processor |
0.0 | 1 | 2000 | Allowing for ILP in an embedded Java processor · ISCA 2000 |
Embedded and real-time systems
embedded processor |
0.0 | 1 | 2000 | Allowing for ILP in an embedded Java processor · ISCA 2000 |
Methods — techniques the papers use, named apart from their topics
instruction-level parallelism · 0.0SIMD · 0.0verilog simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Bottlenecks in Multimedia Processing with SIMD Style Extensions and Architectural EnhancementsabstractMultimedia SIMD extensions such as MMX and AltiVec speed up media processing; however, our characterization shows that the attributes of current general-purpose processors enhanced with SIMD extensions do not match very well with the access patterns and loop structures of media programs. We find that 75 to 85 percent of the dynamic instructions in the processor instruction stream are supporting instructions necessary to feed the SIMD execution units rather than true/useful computations, resulting in the underutilization of SIMD execution units (only 1 to 12 percent of the peak SIMD execution units' throughput is achieved). Contrary to focusing on exploiting more data-level parallelism (DLP), we focus on the instructions that support the SIMD computations and exploit both fine and coarse-grained instruction level parallelism (ILP) in the supporting instruction stream. We propose the MediaBreeze architecture that uses hardware support for efficient address generation, looping, and data reorganization (permute, packing/unpacking, transpose, etc.). Our results on multimedia kernels show that a 2-way processor with SIMD extensions enhanced with MediaBreeze provides a better performance than a 16-way processor with current SIMD extensions. In the case of application benchmarks, a 2-/4-way processor with SIMD extensions augmented with MediaBreeze outperforms a 4-/8-way processor with SIMD extensions. A first-order approximation using ASIC synthesis tools and cell-based libraries shows that this acceleration is achieved at a 10 percent increase in area required by MMX and SSE extensions (0.3 percent increase in overall chip area) and 1 percent of total processor power consumption. Deependra Talla, Lizy Kurian John, Doug Burger |
IEEE Trans. Computers | 1 |
| 2001 | Cost-effective Hardware Acceleration of Multimedia ApplicationsabstractGeneral-purpose microprocessors augmented with SIMD execution units enhance multimedia applications by exploiting data level parallelism. However, supporting/overhead related instructions, accounting for 75-85% of the dynamic instructions, leads to an under-utilization of SIMD execution units resulting in a throughput that ranges between 1-12% of the peak throughput. We accelerate multimedia applications by providing explicit hardware support to eliminate or reduce the impact of the supporting/overhead related instructions. Performance evaluation shows that such hardware can significantly improve performance over conventional SIMD enhanced general-purpose processors. We investigate the cost of incorporating hardware, for efficient execution of supporting/overhead related instructions, into a high-speed SIMD enhanced general-purpose processor and perform area, power, and timing tradeoffs. Our results indicate that - the added hardware requires less than 10% SIMD execution units' chip area and 0.3% overall chip area, and power consumption is less than 1% of the total processor power. This is achieved without elongating the critical path of the processor. Deependra Talla, Lizy Kurian John |
ICCD | 1 |
| 2000 | Evaluating Signal Processing and Multimedia Applications on SIMD, VLIW and Superscalar ArchitecturesabstractThis paper aims to provide a quantitative understanding of the performance of DSP and multimedia applications on very long instruction word (VLIW), single instruction multiple data (SIMD), and superscalar processors. We evaluate the performance of the VLIW paradigm using Texas Instruments Inc.'s TMS320C62xx processor and the SIMD paradigm using Intel's Pentium II processor (with MMX) on a set of DSP and media benchmarks. Tradeoffs in superscalar performance are evaluated with a combination of measurements on Pentium II and simulation experiments on the SimpleScalar simulator. Our benchmark suite includes kernels (filtering, autocorrelation, and dot product) and applications (audio effects, G.711 speech coding, and speech compression). Optimized assembly libraries and compiler intrinsics were used to create the SIMD and VLIW code. We used the hardware performance counters on the Pentium II and the stand-alone simulator for the C62xx to obtain the execution cycle counts. In comparison to non-SIMD Pentium II performance, the SIMD version exhibits a speedup ranging from 1.0 to 5.5 while the speedup of the VLIW version ranges from 0.63 to 9.0. The benchmarks are seen to contain large amounts of available parallelism, however, most of it is inter-iteration parallelism. Out-of-order execution and branch prediction are observed to be extremely important to exploit such parallelism in media applications. Deependra Talla, Lizy Kurian John, Viktor S. Lapinskii, Brian L. Evans |
ICCD | 1 |
| 2000 | Allowing for ILP in an embedded Java processorabstractJava processors are ideal for embedded and network computing applications such as Internet TV's, set-top boxes, smart phones, and other consumer electronics applications. In this paper, we investigate cost-effective microarchitectural techniques to exploit parallelism in Java bytecode streams. Firstly, we propose the use of a fill unit that stores decoded bytecodes into a decoded bytecode cache. This mechanism improves the fetch and decode bandwidth of Java processors by 2 to 3 times. These additional hardware units can also be used to perform optimizations such as instruction folding. This is particularly significant because experiments with the Verilog model of Sun Microsystems pico Java-II core demonstrates that instruction folding lies in the critical path. Moving folding logic from the critical path of the processor to the fill unit allows to improve the clock frequency by 25%. Out-of-order ILP exploitation is not investigated due to the prohibitive cost, but in-order dual-issue with a 64-entry decoded bytecode cache is seen to result in 10% to 14% improvement in execution cycles. Another contribution of the paper is a stack disambiguation technique that allows elimination of false dependencies between different types of stack accesses. Stack disambiguation further exposes parallelism and a dual in-order issue microengine with a 64-entry bytecode cache yields an additional 10% reduction in cycles, leading to an aggregate reduction of 17% to 24% in execution cycles. Ramesh Radhakrishnan, Deependra Talla, Lizy Kurian John |
ISCA | 2 |
| 1999 | Performance Evaluation and Benchmarking of Native Signal Processing
Deependra Talla, Lizy Kurian John |
Euro-Par | 1 |