Search Results - "Theory of computation Models of computation Concurrency Parallel computing models"

On Thin Air Reads Towards an Event Structures Model of Relaxed Memory by Jeffrey, Alan, Riely, James

“…This is the first paper to propose a pure event structures model of relaxed memory. We propose confusion-free event structures over an alphabet with a…”
Get full text

Managing GPU Concurrency in Heterogeneous Architectures by Kayiran, Onur, Nachiappan, Nachiappan Chidambaram, Jog, Adwait, Ausavarungnirun, Rachata, Kandemir, Mahmut T., Loh, Gabriel H., Mutlu, Onur, Das, Chita R.

“…Heterogeneous architectures consisting of general-purpose CPUs and throughput-optimized GPUs are projected to be the dominant computing platforms for many…”
Get full text

In search of lost time: Axiomatising parallel composition in process algebras by Aceto, Luca, Anastasiadi, Elli, Castiglioni, Valentina, Ingolfsdottir, Anna, Luttik, Bas

“…This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus…”
Get full text

Optimizing indirect memory references with milk by Kiriansky, Vladimir, Zhang, Yunming, Amarasinghe, Saman

“…Modern applications such as graph and data analytics, when operating on real world data, have working sets much larger than cache capacity and are bottlenecked…”
Get full text

Reverse-Mode Automatic Differentiation and Optimization of GPU Kernels via Enzyme by Moses, William S., Churavy, Valentin, Paehler, Ludger, Huckelheim, Jan, Narayanan, Sri Hari Krishna, Schanen, Michel, Doerfert, Johannes

“…Computing derivatives is key to many algorithms in scientific computing and machine learning such as optimization, uncertainty quantification, and stability…”
Get full text

Virtualizing Transactional Memory by Rajwar, Ravi, Herlihy, Maurice, Lai, Konrad

“…Writing concurrent programs is difficult because of the complexity of ensuring proper synchronization. Conventional lock-based synchronization suffers from…”
Get full text

Flexible Decoupled Transactional Memory Support by Shriraman, Arrvindh, Dwarkadas, Sandhya, Scott, Michael L.

“…A high-concurrency transactional memory (TM) implementation needs to track concurrent accesses, buffer speculative updates, and manage conflicts. We present a…”
Get full text

Bandwidth Bandit: Quantitative characterization of memory contention by Black-Schaffer, David, Nikoleris, Nikos, Hagersten, Erik, Eklov, David

“…On multicore processors, co-executing applications compete for shared resources, such as cache capacity and memory bandwidth. This leads to suboptimal resource…”
Get full text

Fast Track: A Software System for Speculative Program Optimization by Kelsey, Kirk, Bai, Tongxin, Ding, Chen, Zhang, Chengliang

“…Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance…”
Get full text

Quantitative Reasoning for Proving Lock-Freedom by Hoffmann, Jan, Marmar, Michael, Zhong Shao

“…This article describes a novel quantitative proof technique for the modular and local verification of lock-freedom. In contrast to proofs based on temporal…”
Get full text

Alchemist: A Transparent Dependence Distance Profiling Infrastructure by Zhang, Xiangyu, Navabi, Armand, Jagannathan, Suresh

“…Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper…”
Get full text

Parallel random numbers: as easy as 1, 2, 3 by Salmon, John K., Moraes, Mark A., Dror, Ron O., Shaw, David E.

“…Most pseudorandom number generators (PRNGs) scale poorly to massively parallel high-performance computation because they are designed as sequentially dependent…”
Get full text

ILP and TLP in shared memory applications: A limit study by Fatehi, Ehsan, Gratz, Paul V.

“…With the breakdown of Dennard scaling, future processor designs will be at the mercy of power limits as Chip MultiProcessor (CMP) designs scale out to…”
Get full text

Using Hardware Memory Protection to Build a High-Performance, Strongly-Atomic Hybrid Transactional Memory by Baugh, Lee, Neelakantam, Naveen, Zilles, Craig

“…We demonstrate how fine-grained memory protection can be used in support of transactional memory systems: first showing how a software transactional memory…”
Get full text

Decidability and Complexity for Quiescent Consistency by Dongol, Brijesh, Hierons, Robert M.

“…Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the object's behaviours in quiescent states, i.e., states in…”
Get full text

Communication-Sensitive Static Dataflow for Parallel Message Passing Applications by Bronevetsky, Greg

“…Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI…”
Get full text

Shadow Profiling: Hiding Instrumentation Costs with Parallelism by Moseley, Tipp, Shye, Alex, Reddi, Vijay Janapa, Grunwald, Dirk, Peri, Ramesh

“…In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling profilers incur negligible overhead, but the information they…”
Get full text

Complexity-effective superscalar processors by Palacharla, Subbarao, Jouppi, Norman P., Smith, J. E.

“…The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of…”
Get full text

PGX.D: a fast distributed graph processing engine by Hong, Sungpack, Depner, Siegfried, Manhardt, Thomas, Van Der Lugt, Jan, Verstraaten, Merijn, Chafi, Hassan

“…Graph analysis is a powerful method in data analysis. Although several frameworks have been proposed for processing large graph instances in distributed…”
Get full text

A high-level synthesis flow for the implementation of iterative stencil loop algorithms on FPGA devices by Nacci, Alessandro Antonio, Rana, Vincenzo, Bruschi, Francesco, Sciuto, Donatella, Beretta, Ivan, Atienza, David

“…The automatic generation of hardware implementations for a given algorithm is generally a difficult task, especially when data dependencies span across…”
Get full text