acm-header
Sign In

Communications of the ACM

Latest Research



From Communications of the ACM

Technical Perspective: How Economic Theories Can Help Computers Beat the Heat

The authors of "Distributed Strategies for Computational Sprints" bring the rich theory of allocating scarce resources to the challenge of managing computational...

Distributed Strategies for Computational Sprints
From Communications of the ACM

Distributed Strategies for Computational Sprints

We describe a computational sprinting architecture in which many, independent chip multiprocessors share a power supply and sprints are constrained by the chips'...

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: Breaking the Mold of Machine Learning

"Never-Ending Learning" is the latest and one of the most compelling incarnations of Tom Mitchell and his collaborators' research investigating how to broaden the...

Never-Ending Learning
From Communications of the ACM

Never-Ending Learning

In this paper we define more precisely the never-ending learning paradigm for machine learning, and present one case study: the Never-Ending Language Learner (NELL)...

From Communications of the ACM

Technical Perspective: Expressive Probabilistic Models and Scalable Method of Moments

The authors of "Learning Topic Models—Provably and Efficiently," developed a new method for fitting topic models and at large scale.

Learning Topic Models - Provably and Efficiently
From Communications of the ACM

Learning Topic Models - Provably and Efficiently

This article shows that some new theoretical algorithms that have provable guarantees can be adapted to yield highly practical tools for topic modeling.

From Communications of the ACM

Technical Perspective: Designing Algorithms and the Fairness Criteria They Should Satisfy

"Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a...

Which Is the Fairest (Rent Division) of Them All?
From Communications of the ACM

Which Is the Fairest (Rent Division) of Them All?

What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation...

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...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account