Venkatesh Akella
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Venkatesh Akella has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Jason Lowe-Power
University of California Davis Davis USA
6 shared publications - Sung Joo Ben Yoo
University of California, Davis
4 shared publications - Marjan Fariborz
University of California Davis
3 shared publications - Roberto Proietti
Politecnico di Torino
3 shared publications - Frank Maker
Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
2 shared publications - Mahyar Samani
University of California Davis Davis USA
2 shared publications
Latest Publications
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1643-1649
TEGRA - Scaling Up Graph Processing with Disaggregated Computing
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1643-1649
Open AccessTEGRA - Scaling Up Graph Processing with Disaggregated Computing
- Open Access
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 94-98
Precision Aware Bank Separated Data Placement
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 94-98
Open AccessPrecision Aware Bank Separated Data Placement
- 10 May 2023
- Published by Springer Nature
- p. 42-61
Efficient Large Scale DLRM Implementation on Heterogeneous Memory Systems
- 10 May 2023
- Published by Springer Nature
- p. 42-61
Efficient Large Scale DLRM Implementation on Heterogeneous Memory Systems
- 25 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 21 (2) , 149-152
A Model for Scalable and Balanced Accelerators for Graph Processing
Designing a graph processing system that can scale to graph sizes that are orders of magnitude larger than what is possible on a single accelerator requires a careful codesign of accelerator memory bandwidth and capacity, the interconnect bandwidth between accelerators, and the overall system architecture. We present a high-level bottleneck-analysis model for design and evaluation of scalable and balanced accelerators for graph processing. We show several applications of this model including how to choose the right mix of different memory types, network topology, network bisection bandwidth, and system-level architecture to match the access patterns and capacity requirements of different data structures for a given graph and a performance target.
- 25 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 21 (2) , 149-152
A Model for Scalable and Balanced Accelerators for Graph Processing
Designing a graph processing system that can scale to graph sizes that are orders of magnitude larger than what is possible on a single accelerator requires a careful codesign of accelerator memory bandwidth and capacity, the interconnect bandwidth between accelerators, and the overall system architecture. We present a high-level bottleneck-analysis model for design and evaluation of scalable and balanced accelerators for graph processing. We show several applications of this model including how to choose the right mix of different memory types, network topology, network bisection bandwidth, and system-level architecture to match the access patterns and capacity requirements of different data structures for a given graph and a performance target.
- 29 May 2022
- Published by Springer Nature
- p. 44-64
LLM: Realizing Low-Latency Memory by Exploiting Embedded Silicon Photonics for Irregular Workloads
- 29 May 2022
- Published by Springer Nature
- p. 44-64
LLM: Realizing Low-Latency Memory by Exploiting Embedded Silicon Photonics for Irregular Workloads
- 17 June 2021
- Published by Springer Nature
- p. 176-194
HTA: A Scalable High-Throughput Accelerator for Irregular HPC Workloads
- 17 June 2021
- Published by Springer Nature
- p. 176-194
HTA: A Scalable High-Throughput Accelerator for Irregular HPC Workloads
- Open Access
Performance Analysis of Scientific Computing Workloads on Trusted Execution Environments
Scientific computing sometimes involves computation on sensitive data. Depending on the data and the execution environment, the HPC (high-performance computing) user or data provider may require confidentiality and/or integrity guarantees. To study the applicability of hardware-based trusted execution environments (TEEs) to enable secure scientific computing, we deeply analyze the performance impact of AMD SEV and Intel SGX for diverse HPC benchmarks including traditional scientific computing, machine learning, graph analytics, and emerging scientific computing workloads. We observe three main findings: 1) SEV requires careful memory placement on large scale NUMA machines (1$\times$$-$3.4$\times$ slowdown without and 1$\times$$-$1.15$\times$ slowdown with NUMA aware placement), 2) virtualization$-$a prerequisite for SEV$-$results in performance degradation for workloads with irregular memory accesses and large working sets (1$\times$$-$4$\times$ slowdown compared to native execution for graph applications) and 3) SGX is inappropriate for HPC given its limited secure memory size and inflexible programming model (1.2$\times$$-$126$\times$ slowdown over unsecure execution). Finally, we discuss forthcoming new TEE designs and their potential impact on scientific computing.Open AccessPerformance Analysis of Scientific Computing Workloads on Trusted Execution Environments
Scientific computing sometimes involves computation on sensitive data. Depending on the data and the execution environment, the HPC (high-performance computing) user or data provider may require confidentiality and/or integrity guarantees. To study the applicability of hardware-based trusted execution environments (TEEs) to enable secure scientific computing, we deeply analyze the performance impact of AMD SEV and Intel SGX for diverse HPC benchmarks including traditional scientific computing, machine learning, graph analytics, and emerging scientific computing workloads. We observe three main findings: 1) SEV requires careful memory placement on large scale NUMA machines (1$\times$$-$3.4$\times$ slowdown without and 1$\times$$-$1.15$\times$ slowdown with NUMA aware placement), 2) virtualization$-$a prerequisite for SEV$-$results in performance degradation for workloads with irregular memory accesses and large working sets (1$\times$$-$4$\times$ slowdown compared to native execution for graph applications) and 3) SGX is inappropriate for HPC given its limited secure memory size and inflexible programming model (1.2$\times$$-$126$\times$ slowdown over unsecure execution). Finally, we discuss forthcoming new TEE designs and their potential impact on scientific computing. - 21 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 66 (11) , 1815-1819
Multiplier-Free Implementation of Galois Field Fourier Transform on a FPGA
A novel approach to implementing Galois Field Fourier Transform (GFT) is proposed that completely eliminates the need for any finite field multipliers by transforming the symbols from a vector representation to a power representation. The proposed method is suitable for implementing GFTs of prime and nonprime lengths on modern FPGAs that have a large amount of on-chip distributed embedded memory. For GFT of length 255 that is widely used in many applications, the proposed memory based implementation exhibits 25% improvement in latency, 27% improvement in throughput, and 56% reduction in power consumption compared to a finite field multiplier based implementation.
- 21 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 66 (11) , 1815-1819
Multiplier-Free Implementation of Galois Field Fourier Transform on a FPGA
A novel approach to implementing Galois Field Fourier Transform (GFT) is proposed that completely eliminates the need for any finite field multipliers by transforming the symbols from a vector representation to a power representation. The proposed method is suitable for implementing GFTs of prime and nonprime lengths on modern FPGAs that have a large amount of on-chip distributed embedded memory. For GFT of length 255 that is widely used in many applications, the proposed memory based implementation exhibits 25% improvement in latency, 27% improvement in throughput, and 56% reduction in power consumption compared to a finite field multiplier based implementation.
- 1 September 2013
- Published by Elsevier in Journal of Systems Architecture
- Vol. 59 (8) , 643-655
MELOADES: Methodology for long-term online adaptation of embedded software for heterogeneous devices
- 1 September 2013
- Published by Elsevier in Journal of Systems Architecture
- Vol. 59 (8) , 643-655
MELOADES: Methodology for long-term online adaptation of embedded software for heterogeneous devices
- 12 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 59 (1) , 188-197
Efficient Configurable Decoder Architecture for Nonbinary Quasi-Cyclic LDPC Codes
Nonbinary LDPC codes are effective in combating burst errors. This paper presents an efficient architecture for implementing nonbinary LDPC decoders. The Galois field power representation is used to organize the a priori, a posteriori, and extrinsic messages involved in decoding. The power representation in conjunction with the barrel shifter and multithreaded pipelining yields an efficient implementation. The proposed decoder is configurable, in the sense that a single decoder can be used to decode any code of a given field size. The decoder supports both regular and irregular nonbinary QC-LDPC codes. Using a practical metric of throughput per unit area, the proposed implementation outperforms the best implementations published in research literature to date.
- 12 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 59 (1) , 188-197
Efficient Configurable Decoder Architecture for Nonbinary Quasi-Cyclic LDPC Codes
Nonbinary LDPC codes are effective in combating burst errors. This paper presents an efficient architecture for implementing nonbinary LDPC decoders. The Galois field power representation is used to organize the a priori, a posteriori, and extrinsic messages involved in decoding. The power representation in conjunction with the barrel shifter and multithreaded pipelining yields an efficient implementation. The proposed decoder is configurable, in the sense that a single decoder can be used to decode any code of a given field size. The decoder supports both regular and irregular nonbinary QC-LDPC codes. Using a practical metric of throughput per unit area, the proposed implementation outperforms the best implementations published in research literature to date.