Suchergebnisse - Theory of computation - Parallel computing models

Verification of Flat FIFO Systems von Finkel, Alain, Praveen, M.

“… The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail …”
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

Imperative Process Algebra and Models of Parallel Computation von Middelburg, Cornelis A.

“… It is demonstrated that the process algebra is suitable to describe in a mathematically precise way models of computation corresponding to existing models based on sequential, asynchronous parallel …”
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

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

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

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

DISC: Exploiting Data Parallelism of Non-Stencil Computations on CGRAs via Dynamic Iteration Scheduling von Liang, Yue, Mou, Di, Liu, Dajiang

“… ) that can dynamically exploit data parallelism from non-stencil computations. Via dynamic scheduling on loop iterations, DISC can select conflict-free iterations from an iteration buffer for parallel data access, while holding data dependence …”
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

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

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. We present a …”
Volltext

Checkpointing strategies for a fixed-length execution von Benoit, Anne, Perotin, Lucas, Robert, Yves, Vivien, Frederic

“… This work considers checkpointing strategies for a parallel application executing on a large-scale platform whose nodes are subject to failures …”
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

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

Alchemist: A Transparent Dependence Distance Profiling Infrastructure von 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 …”
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

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

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

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

Superword-Level Parallelism in the Presence of Control Flow von Shin, Jaewook, Hall, Mary, Chame, Jacqueline

“… In this paper, we describe how to extend the concept of superword-level parallelization (SLP), used for multimedia extension architectures, so that it can be …”
Volltext