paper-with-me

홈 › Papers

TransPimLib: A Library for Efficient Transcendental Functions on Processing-in-Memory Systems

2023-04-03 · Maurus Item, Juan Gómez-Luna, Yuxin Guo, Geraldo F. Oliveira, Mohammad Sadrosadati, Onur Mutlu

Processing-in-memory (PIM) promises to alleviate the data movement bottleneck in modern computing systems. However, current real-world PIM systems have the inherent disadvantage that their hardware is more constrained than in conventional processors (CPU, GPU), due to the difficulty and cost of building processing elements near or inside the memory. As a result, general-purpose PIM architectures support fairly limited instruction sets and struggle to execute complex operations such as transcendental functions and other hard-to-calculate operations (e.g., square root). These operations are particularly important for some modern workloads, e.g., activation functions in machine learning applications. In order to provide support for transcendental (and other hard-to-calculate) functions in general-purpose PIM systems, we present \emph{TransPimLib}, a library that provides CORDIC-based and LUT-based methods for trigonometric functions, hyperbolic functions, exponentiation, logarithm, square root, etc. We develop an implementation of TransPimLib for the UPMEM PIM architecture and perform a thorough evaluation of TransPimLib's methods in terms of performance and accuracy, using microbenchmarks and three full workloads (Blackscholes, Sigmoid, Softmax). We open-source all our code and datasets at~\url{https://github.com/CMU-SAFARI/transpimlib}.

📄 PDF Abstract BibTeX arXiv:2304.01951

Code (1)

cmu-safari/transpimlib 공식 구현

Tasks

CPUGPU

Methods 이 논문이 사용한 방법론

Library 설명 없음

Similar Papers 제목 키워드 기반

TranSC: Hardware-Aware Design of Transcendental Functions Using Stochastic Logic

2026-01-12 · Mehran Moghadam, Sercan Aygun, M. Hassan Najafi arxiv

The hardware-friendly implementation of transcendental functions remains a longstanding challenge in design automation. These functions, which cannot be expressed as finite combinations of algebraic operations, pose sign…

Transcendental Regularization of Finite Mixtures:Theoretical Guarantees and Practical Limitations

2026-02-03 · Ernest Fokoué arxiv

Finite mixture models are widely used for unsupervised learning, but maximum likelihood estimation via EM suffers from degeneracy as components collapse. We introduce transcendental regularization, a penalized likelihood…

Gradient-Free Warm-Start Library Recovery: an Amortized-Regret Separation

2026-06-19 · Jianwei Lou arxiv

Continual learning that is gradient-free, local, online, and append-only is attractive for edge and streaming deployment, but its value is usually argued informally. We give a provable account on recurring-regime streams…

Continual Learning

Squareplus: A Softplus-Like Algebraic Rectifier

2021-12-22 · Jonathan T. Barron

We present squareplus, an activation function that resembles softplus, but which can be computed using only algebraic operations: addition, multiplication, and square-root. Because squareplus is ~6x faster to evaluate th…

CPU

AutoNumerics-Zero: Automated Discovery of State-of-the-Art Mathematical Functions

2023-12-13 · Esteban Real, Yao Chen, Mirko Rossini, Connal de Souza 외

Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation …