Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3649476acmconferencesBook PagePublication PagesglsvlsiConference Proceedingsconference-collections
GLSVLSI '24: Proceedings of the Great Lakes Symposium on VLSI 2024
ACM2024 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
GLSVLSI '24: Great Lakes Symposium on VLSI 2024 Clearwater FL USA June 12 - 14, 2024
ISBN:
979-8-4007-0605-9
Published:
12 June 2024
Sponsors:

Bibliometrics
SESSION: Poster Session 1 VLSI Circuits and Design:
short-paper
Free
A Low-Latency Polynomial Multiplier Accelerator for CRYSTALS-Dilithium Digital Signature

In the post-quantum signature CRYSTALS-Dilithium algorithm, polynomial multiplication accounts for 32% of the total computation Latency. It is necessary to design a high-performance polynomial multiplication module. In this paper, we have proposed a low-...

short-paper
Open Access
Area-power and Energy Efficient Substitution box (S-box) in Advanced Encryption Standard (AES)

Advanced Encryption Standard (AES) is a widely used Symmetric-key algorithm. A small characteristics improvement of AES circuits can significantly affect the system's characteristics. The Substitution box (S-box) is the only nonlinear transformation of ...

short-paper
Open Access
A Resonant Time-Domain Compute-in-Memory (rTD-CiM) ADC-Less Architecture for MAC Operations

In recent years, Compute-in-memory (CiM) architectures have emerged as a promising solution for deep neural network (NN) accelerators. Multiply-accumulate (MAC) is considered a de facto unit operation in NNs. By leveraging the minimal data movement ...

short-paper
Free
Highly Efficient Load-Balanced Dataflow for SpGEMMs on Systolic Arrays

To enhance the efficiency of sparse neural network models, compression methods are commonly employed to store the non-zero elements in a sparse storage format. Sparse General Matrix Multiplication (SpGEMM) is a critical computation in deep neural ...

short-paper
Open Access
A 9 Transistor SRAM Featuring Array-level XOR Parallelism with Secure Data Toggling Operation

Security, speed, and energy efficiency are critical for computing applications in general and for edge applications in particular. Digital In-Memory Computing (IMC) in SRAM cells has widely been studied to accelerate inference tasks to maximize both ...

short-paper
Free
An Analytical Model for High-Frequency Through Silicon Vias

Through silicon vias (TSVs) play a critical role in three-dimensional (3-D) packaging, facilitating the development of smaller, faster, and more efficient electronic devices crucial across various industries, such as telecommunications and computing. ...

short-paper
Free
Generalizable and Relation Sensitive Netlist Representation for Analog Circuit Design

The problem of transistor sizing is challenging due to the large design space and complex performance trade-offs. Conventional black-box optimization methods, such as Bayesian optimization, cannot leverage past experience. In this paper, we propose a ...

short-paper
Free
Integrated MAC-based Systolic Arrays: Design and Performance Evaluation

In the rapidly advancing landscape of computing, hardware accelerator designs are pivotal for satisfying high performance and low power demands. Systolic array (SA) architectures, tailored for general matrix multiplication (GEMM) operations, are ideal ...

short-paper
Open Access
Improving Block Management in 3D NAND Flash SSDs with Sub-Block First Write Sequencing

Continual vertical scaling in 3D NAND flash solid-state drives (SSDs) results in larger memory blocks, causing performance degradation due to big-block management issues. Pages within a 3D NAND flash block are traditionally written using layer first ...

short-paper
Free
Cost-Effective Value Predictor for ILP processors through Design Space Exploration

Value prediction is a microarchitectural technique that enhances processor performance by speculatively breaking true data dependencies. It has demonstrated improved performance in both single-threaded and multi-threaded workloads, rendering it an ...

short-paper
Open Access
Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs

We present a hardware-accelerated SAT solver targeting processor/Field Programmable Gate Arrays (FPGA) SoCs. Our solution accelerates the most expensive subroutine of the Davis-Putnam-Logemann-Loveland (DPLL) algorithm, Boolean Constraint Propagation (...

Contributors
  • University of Illinois at Chicago
  • University of South Florida, Tampa
  • McGill University
  • The University of Texas at Dallas

Recommendations

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%
YearSubmittedAcceptedRate
GLSVLSI '181974824%
GLSVLSI '171974824%
GLSVLSI '161975025%
GLSVLSI '151484128%
GLSVLSI '141794927%
GLSVLSI '132387632%
Overall1,15631227%