Suchergebnisse - Theory of computation Models of computation Concurrency Parallel computing models*

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

“… This is the first paper to propose a pure event structures model of relaxed memory …”
Volltext

Managing GPU Concurrency in Heterogeneous Architectures von 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 classes of applications …”
Volltext

In search of lost time: Axiomatising parallel composition in process algebras von 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 …”
Volltext

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

“… Parallel applications that are bound by memory bandwidth fail to scale, while applications bound by memory latency draw a small fraction of much-needed bandwidth …”
Volltext

Reverse-Mode Automatic Differentiation and Optimization of GPU Kernels via Enzyme von 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 analysis …”
Volltext

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

“… If the transactional model is to gain wide acceptance, hardware support for transactions must be virtualized to hide these limitations in much the same …”
Volltext

Flexible Decoupled Transactional Memory Support von 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 …”
Volltext

Bandwidth Bandit: Quantitative characterization of memory contention von 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 …”
Volltext

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

“… or a profiling tool mark fast-track code regions and uses a run-time system to manage the parallel execution of the speculative process and its checking processes and ensures the correct display of program outputs …”
Volltext

Quantitative Reasoning for Proving Lock-Freedom von 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 …”
Volltext

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

“… This paper addresses important aspects of this issue by proposing a novel profiling technique to automatically detect available concurrency in C programs …”
Volltext

Parallel random numbers: as easy as 1, 2, 3 von 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 state transformations …”
Volltext

ILP and TLP in shared memory applications: A limit study von 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 …”
Volltext

Using Hardware Memory Protection to Build a High-Performance, Strongly-Atomic Hybrid Transactional Memory von 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 …”
Volltext

Decidability and Complexity for Quiescent Consistency von 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 …”
Volltext

Communication-Sensitive Static Dataflow for Parallel Message Passing Applications von 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 and PVM …”
Volltext

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

“… Shadow profiling is a novel method for sampling long traces of instrumented code in parallel with normal execution, taking advantage of the trend of increasing numbers of cores …”
Volltext

Complexity-effective superscalar processors von 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 …”
Volltext

PGX.D: a fast distributed graph processing engine von 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 …”
Volltext

A high-level synthesis flow for the implementation of iterative stencil loop algorithms on FPGA devices von 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 …”
Volltext