Sign In

Communications of the ACM

Latest Research



From Communications of the ACM

Technical Perspective: Borrowing Big Code to Automate Programming Activities

"Predicting Program Properties from 'Big Code'" presents new techniques for leveraging big code to automate two programming activities: selecting understandable...

Predicting Program Properties from 'Big Code'
From Communications of the ACM

Predicting Program Properties from 'Big Code'

We present a new approach for predicting program properties from large codebases (aka "Big Code").

From Communications of the ACM

Technical Perspective: To Do or Not To Do: Extending SQL with Integer Linear Programming?

"Scalable Computation of High-Order Optimization Queries," by Brucato et al., makes a case for marrying the well-established paradigms of constrained optimization...

Scalable Computation of High-Order Optimization Queries
From Communications of the ACM

Scalable Computation of High-Order Optimization Queries

We present a complete system that supports package queries, a new query model that extends traditional database queries to handle complex constraints and preferences...

From Communications of the ACM

Technical Perspective: WebAssembly: A Quiet Revolution of the Web

"Bringing the Web Up to Speed with WebAssembly," by Rossberg et al., gives an overview of the initial design of WebAssembly, a new low-level programming language...

Bringing the Web ­Up to Speed with WebAssembly
From Communications of the ACM

Bringing the Web ­Up to Speed with WebAssembly

WebAssembly is the first mainstream language designed from the start with a formal semantics. It not only demonstrates the feasibility of applying formal techniques...

From Communications of the ACM

Technical Perspective: Node Replication Divides to Conquer

In "How to Implement Any Concurrent Data Structure," Calciu et al. show that a concurrent data structure can be built automatically and that its performance is...

How to Implement Any Concurrent Data Structure
From Communications of the ACM

How to Implement Any Concurrent Data Structure

We propose a method called Node Replication (NR) to implement any concurrent data structure.

From Communications of the ACM

Technical Perspective: The Future of MPI

"Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided" convincingly shows that the potential of MPI one-sided communication can be realized...

Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided
From Communications of the ACM

Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided

In this work, we design and develop bufferless protocols that demonstrate how to implement the MPI-3 RMA interface and support scaling to millions of cores.

From Communications of the ACM

Technical Perspective: Measuring Optimization Potential with Coz

In "Coz: Finding Code that Counts with Causal Profiling," Curtsinger and Berger describe causal profiling, which tell programmers exactly how much speed-up bang...

Coz
From Communications of the ACM

Coz: Finding Code that Counts with Causal Profiling

This paper introduces causal profiling. Unlike past profiling approaches, causal profiling indicates exactly where programmers should focus their optimization efforts...

From Communications of the ACM

Technical Perspective: Building Bug-Free Compilers

What to do about buggy compilers? The authors of "Practical Verification of Peephole Optimizations with Alive" give us a compelling and practical answer.

Practical Verification of Peephole Optimizations with Alive
From Communications of the ACM

Practical Verification of Peephole Optimizations with Alive

We created Alive, a domain-specific language for writing correct peephole optimizations and for automatically either proving them correct or else generating counterexamples...

From Communications of the ACM

Technical Perspective: Moving Spectrum

The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...

Deep Optimization For Spectrum Repacking
From Communications of the ACM

Deep Optimization For Spectrum Repacking

This paper describes the process by which we built the SAT-based Feasibility Checker, a crucial element of the 2016-17 U.S. FCC "incentive auction" design.

From Communications of the ACM

Technical Perspective: A Simple, Elegant Approach to Non-Numeric Parallelization

"Automatically Accelerating Non-Numerical Programs by Architecture-Compiler Co-Design," by Simone Campanoni, et al., proposes a modest hardware extension to support...

Automatically Accelerating Non-Numerical Programs By Architecture-Compiler Co-Design
From Communications of the ACM

Automatically Accelerating Non-Numerical Programs By Architecture-Compiler Co-Design

HELIX-RC is a compiler/microprocessor co-design that opens loops to parallelization by decoupling communication from thread execution in conventional multicore...

From Communications of the ACM

Technical Perspective: Pricing Information (and Its Implications)

"A Theory of Pricing Private Data," by Chao Li, et al., introduces a fascinating and complicated issue that arises on the buy-side of the market when buyers are...

A Theory Of Pricing Private Data
From Communications of the ACM

A Theory Of Pricing Private Data

We describe the foundations of a market in which those seeking access to data must pay for it and individuals are compensated for the loss of privacy they may suffer...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account