Communications of the ACM
Latest Research
From Communications of the ACM
Communication Costs of Strassen's Matrix Multiplication
Proving lower bounds on the communication of algorithms and finding algorithms that attain these bounds are fundamental goals.
From Communications of the ACM
Technical Perspective: Silicon Stress
Moore's Law has been the mainstay of semiconductor electronics since the invention of the transistor and its application to the integrated circuit. Implicit in...
From Communications of the ACM
TSV Stress-Aware Full-Chip Mechanical Reliability Analysis and Optimization For 3D IC
Three-dimensional integrated circuit (3D IC) with through-silicon-via (TSV) is believed to offer new levels of efficiency, power, performance, and form-factor advantages...
From Communications of the ACM
Technical Perspective: The Cleanest Garbage Collection
In quite a tour de force, the authors of the following paper have built a provably correct real-time garbage collector for reconfigurable hardware (field programmable...
From Communications of the ACM
And Then There Were None: A Stall-Free Real-Time Garbage Collector For Reconfigurable Hardware
We present a garbage collector synthesized directly to hardware, capable of collecting a heap of uniform objects completely concurrently. These heaps are composed...
From Communications of the ACM
Technical Perspective: Centip3De Demonstrates More Than Moore...
Exponentially increasing transistor integration also demands more interconnections, which have started hitting fundamental limits. The Centip3De design demonstrates...
From Communications of the ACM
Centip3De: A Many-Core Prototype Exploring 3D Integration and Near-Threshold Computing
This paper evaluates the use of three-dimensional integration to reduce global interconnect by adding multiple layers of silicon with vertical connections between...
From Communications of the ACM
Technical Perspective: Can We Verify Cyber-Physical Systems?
Developing effective symbolic verification technology for mixed discrete-analog models has proved to be a challenging problem. The following paper by Althoff...
From Communications of the ACM
Formal Verification of Phase-Locked Loops Using Reachability Analysis and Continuization
We present a scalable and formal technique to verify locking time and stability for charge-pump phase-locked loops (PLLs).
From Communications of the ACM
Technical Perspective: Progress in Visual Categorization
Our visual system helps us carry out our daily business. Our eyes and brain help us by measuring shapes, trajectories, and distances in world around us, and by...
From Communications of the ACM
Visual Object Detection with Deformable Part Models
We describe a state-of-the-art system for finding objects in cluttered images. Our system is based on deformable models that represent objects using local part...
From Communications of the ACM
Technical Perspective: Every Graph Is Essentially Sparse
The following paper by Batson, Spielman, Srivastava, and Teng surveys one of the most important recent intellectual achievements of theoretical computer science...
From Communications of the ACM
Spectral Sparsification of Graphs: Theory and Algorithms
Graph sparsification is the approximation of an arbitrary graph by a sparse graph. We explain what it means for one graph to be a spectral approximation of another...
From Communications of the ACM
Technical Perspective: A Fresh Approach to Vector Graphics
The following paper makes a fundamental contribution to the world of vector graphics by introducing a new primitive called diffusion curve.
From Communications of the ACM
Diffusion Curves: A Vector Representation For Smooth-Shaded Images
We describe a new vector-based primitive for creating smooth-shaded images, called the diffusion curve.
From Communications of the ACM
Technical Perspective: Circuit Placement Challenges
For a semiconductor circuit with billions of transistors, finding desired locations of circuit components is a challenging task that substantially impacts circuit...
From Communications of the ACM
SimPL: An Algorithm For Placing VLSI Circuits
VLSI placement optimizes locations of circuit components so as to reduce interconnect. We propose an algorithm for large-scale placement that outperforms prior...
From Communications of the ACM
Technical Perspective: The Ray-Tracing Engine That Could
It has been an open question whether it is possible to build GPU-targeted high-performance software systems that are themselves programmable. "GPU Ray Tracing" shows...
From Communications of the ACM
GPU Ray Tracing
The NVIDIA OptiX ray tracing engine builds on the key observation that most ray tracing algorithms can be implemented using a small set of programmable operations...
From Communications of the ACM