This paper proposes a new family of models for in-place parallel and distributed computation that ensures efficiency and in-place guarantees at all processor counts.

This paper surveys the evolution of massively parallel systems over the past four decades, focusing on hardware architectures, interconnection networks, and synchronization primitives.

Proposed PEERS, a parallel and exact effective resistance solver using implicit inverse computing model of Cholesky factor, achieving optimal parallel span and memory complexity, and demonstrating sig…

First implementation of a 3D Gaussian renderer on an Intelligence Processing Unit (IPU) with 1,472 independent tiles using only on-chip SRAM.

The paper introduces parRSB, a parallel graph partitioner for spectral element meshes that produces high-quality partitions.

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

This paper introduces the Scatter-Gather parallel-programming and parallel-execution model in the form of a simple imperative language.

This paper compares the performance of four parallelization variants of the tiled Cholesky decomposition using OpenMP and HPX runtimes.

This paper presents a local computation algorithm to approximate the top eigenvector of a symmetric matrix with entries between -1 and 1, building on Swartworth and Woodruff's work.

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

This paper proposes a neighbor-only work stealing strategy for Asynchronous Many-Task runtimes in Space Edge Computing.

A new solver-free parallel spectral sparsification algorithm for weighted graphs is presented, relying on low-diameter decompositions and independent sampling, eliminating dependence on target approxi…

An R package named rush is introduced, which provides a shared-state coordination layer for asynchronously parallelized iterative algorithms using a Redis database.

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

This paper presents Weave, a system that improves the performance of Mixture-of-Experts (MoE) inference by dynamically scheduling GPU resources.

The paper presents a simulator to evaluate the impact of kernel choices on inter-chiplet traffic in multi-chiplet GPUs and uses it to discover an optimal CTA traversal order.

This paper presents a 7-approximation algorithm for a problem in graph theory.