paper-with-me

Papers

A Simple Packing Algorithm for Optimized Mapping of Artificial Neural Networks onto Non-Volatile Memory Cross-Bar Arrays

2024-11-07 · W. Haensch

Neuromorphic computing with crossbar arrays has emerged as a promising alternative to improve computing efficiency for machine learning. Previous work has focused on implementing crossbar arrays to perform basic mathematical operations. However, in this paper, we explore the impact of mapping the layers of an artificial neural network onto physical cross-bar arrays arranged in tiles across a chip. We have developed a simplified mapping algorithm to determine the number of physical tiles, with fixed optimal array dimensions, and to estimate the minimum area occupied by these tiles for a given design objective. This simplified algorithm is compared with conventional binary linear optimization, which solves the equivalent bin-packing problem. We have found that the optimum solution is not necessarily related to the minimum number of tiles; rather, it is shown to be an interaction between tile array capacity and the scaling properties of its peripheral circuits. Additionally, we have discovered that square arrays are not always the best choice for optimal mapping, and that performance optimization comes at the cost of total tile area

📄 PDF Abstract BibTeX arXiv:2411.04814

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Evolutionary Bin Packing for Memory-Efficient Dataflow Inference Acceleration on FPGA

2020-03-24 · Mairin Kroes, Lucian Petrica, Sorin Cotofana, Michaela Blott

Convolutional neural network (CNN) dataflow inference accelerators implemented in Field Programmable Gate Arrays (FPGAs) have demonstrated increased energy efficiency and lower latency compared to CNN execution on CPUs o…

Heuristics based on Adjacency Graph Packing for DCJ Distance Considering Intergenic Regions

2025-01-11 · Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Zanoni Dias

In this work, we explore heuristics for the Adjacency Graph Packing problem, which can be applied to the Double Cut and Join (DCJ) Distance Problem. The DCJ is a rearrangement operation and the distance problem consideri…

Falcon: Accelerating Homomorphically Encrypted Convolutions for Efficient Private Mobile Network Inference

2023-08-25 · Tianshi Xu, Meng Li, Runsheng Wang, Ru Huang

Efficient networks, e.g., MobileNetV2, EfficientNet, etc, achieves state-of-the-art (SOTA) accuracy with lightweight computation. However, existing homomorphic encryption (HE)-based two-party computation (2PC) frameworks…

Contrastive Self-Supervised Learning As Neural Manifold Packing

2025-06-16 · Guanming Zhang, David J. Heeger, Stefano Martiniani

Contrastive self-supervised learning based on point-wise comparisons has been widely studied for vision tasks. In the visual cortex of the brain, neuronal responses to distinct stimulus classes are organized into geometr…

Contrastive LearningLinear evaluationRepresentation LearningSelf-Supervised Learning

Performance Evaluation of Two-layer lossless HDR Coding using Histogram Packing Technique under Various Tone-mapping Operators

2019-07-25 · Hiroyuki Kobayashi, Hitoshi Kiya

We proposed a lossless two-layer HDR coding method using a histogram packing technique. The proposed method was demonstrated to outperform the normative JPEG XT encoder, under the use of the default tone-mapping operator…

Tone Mapping