Optimistic parallelism requires abstractions

No abstract is available for this paper.

• Publication year

  2007

• Venue

  ACM-SIGPLAN Symposium on Programming Language Design and Implementation

• Publication date

  2007-06-15

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1250734.1250759
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction to Data Mining

  2019influential reference
• How much parallelism is there in irregular applications?

  2009cited by this paper
• Synthesis Lectures on Computer Architecture

  2009cited by this paper
• Optimistic parallelism requires abstractions

  2009cited by this paper
• Scheduling strategies for optimistic parallel execution of irregular programs

  2008cited by this paper
• Transactional boosting: a methodology for highly-concurrent transactional objects

  2008cited by this paper
• Optimistic parallelism benefits from data partitioning

  2008cited by this paper
• Transactional collection classes

  2007cited by this paper
• Transactional Memory (Synthesis Lectures on Computer Architecture)

  2007cited by this paper
• Implicit parallelism with ordered transactions

  2007cited by this paper
• Sparse parallel Delaunay mesh refinement

  2007cited by this paper
• Open nesting in software transactional memory

  2007cited by this paper
• LogTM: log-based transactional memory

  2006cited by this paper
• Unbounded transactional memory

  2005cited by this paper
• Lightcuts: a scalable approach to illumination

  2005influential reference
• Multigrain parallel Delaunay Mesh generation: challenges and opportunities for multithreaded architectures

  2005cited by this paper
• Nested Transactional Memory: Model and Preliminary Architecture Sketches

  2005cited by this paper
• Transactional memory coherence and consistency

  2004cited by this paper
• Language support for lightweight transactions

  2003cited by this paper
• Optimizing Compilers for Modern Architectures: A Dependence-based Approach

  2001cited by this paper
• A scalable approach to thread-level speculation

  2000influential reference
• Interprocedural pointer alias analysis

  1999cited by this paper
• An algorithm for two-dimensional mesh generation for arbitrary regions with cracks

  1999cited by this paper
• Hardware for speculative run-time parallelization in distributed shared-memory multiprocessors

  1998cited by this paper
• Speculative versioning cache

  1998cited by this paper
• 25 Years of the International Symposia on Computer Architecture (Selected Papers)

  1998cited by this paper
• Beyond Arrays - A Container-Centric Approach for Parallelization of Real-World Symbolic Applications

  1998cited by this paper
• Commutativity analysis

  1997cited by this paper
• Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

  1996cited by this paper
• Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

  1996cited by this paper
• Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C

  1996cited by this paper
• Solving shape-analysis problems in languages with destructive updating

  1996cited by this paper
• Software transactional memory

  1995cited by this paper
• Parallelizing while loops for multiprocessor systems

  1995cited by this paper
• An efficient algorithm for exploiting multiple arithmetic units

  1995cited by this paper
• The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization

  1995cited by this paper
• Transactional Memory: Architectural Support For Lock-free Data Structures

  1993cited by this paper
• A new and simple algorithm for quality 2-dimensional mesh generation

  1993cited by this paper
• Runtime compilation techniques for data partitioning and communication schedule reuse

  1993cited by this paper
• Guaranteed-quality mesh generation for curved surfaces

  1993influential reference
• A New Method for Solving Hard Satisfiability Problems

  1992influential reference
• Making asynchronous parallelism safe for the world

  1989cited by this paper
• Commutativity-based concurrency control for abstract data types

  1988cited by this paper
• Hybrid concurrency control for abstract data types

  1988cited by this paper
• Programming with Sets: An Introduction to SETL

  1986influential reference
• Virtual time

  1985cited by this paper
• Very Long Instruction Word architectures and the ELI-512

  1983cited by this paper
• Algorithms + Data Structures = Programs

  1976cited by this paper
• Multidimensional binary search trees used for associative searching

  1975cited by this paper
• Percolation of Code to Enhance Parallel Dispatching and Execution

  1972cited by this paper
• Computer Architecture: A Quantitative Approach

  1969cited by this paper
• Analysis of Programs for Parallel Processing

  1966cited by this paper
• Openmp: a Proposed Industry Standard Api for Shared Memory Programming

  year unknowncited by this paper

• The Parallel-Semantics Program Dependence Graph for Parallel Optimization

  2026cites this paper
• What Every Computer Scientist Needs To Know About Parallelization

  2025influential citation
• Dynamic Mesh Processing on the GPU

  2025influential citation
• Thievory: Graph Processing with Multi-GPU Memory Stealing

  2025cites this paper
• Amortized Cost in Graph Reordering: Why BFS Ordering Deserves More Attention

  2025cites this paper
• Ripple: Asynchronous Programming for Spatial Dataflow Architectures

  2025cites this paper
• Scheduling Language Chronology: Past, Present, and Future

  2025cites this paper
• Scheduling Languages: A Past, Present, and Future Taxonomy

  2024cites this paper
• A new thread-level speculative automatic parallelization model and library based on duplicate code execution

  2024cites this paper
• When Is Parallelism Fearless and Zero-Cost with Rust?

  2024cites this paper
• Parallel shared-memory open-source code for simulations of transient problems using isogeometric analysis, implicit direction splitting and residual minimization (IGA-ADS-RM)

  2024cites this paper
• Multi Bucket Queues: Efficient Concurrent Priority Scheduling

  2024cites this paper
• The Parallel Semantics Program Dependence Graph

  2024cites this paper
• Analysis of Parallel Graph Applications

  2024cites this paper
• A Novel All-Pairs Shortest Path Algorithm ∗

  2023cites this paper
• Hypergraph-based locality-enhancing methods for graph operations in Big Data applications

  2023cites this paper
• ASPEN: Breaking Operator Barriers for Efficient Parallelization of Deep Neural Networks

  2023cites this paper
• Automatic Code Generation for High-Performance Graph Algorithms

  2023cites this paper
• Correct Compilation of Semiring Contractions

  2022cites this paper
• Veracity: declarative multicore programming with commutativity

  2022cites this paper
• Practically Correct, Just-in-Time Shell Script Parallelization

  2022cites this paper
• A scalable architecture for reprioritizing ordered parallelism

  2022cites this paper
• Atos: A Task-Parallel GPU Scheduler for Graph Analytics

  2022cites this paper
• STAMP-Rust: Language and Performance Comparison to C on Transactional Benchmarks

  2022cites this paper
• Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis

  2022cites this paper
• On the choice of the best chunk size for the speculative execution of loops

  2022cites this paper
• Data Locality in High Performance Computing, Big Data, and Converged Systems: An Analysis of the Cutting Edge and a Future System Architecture

  2022cites this paper
• Batched Graph Community Detection on GPUs

  2022cites this paper
• PGAbB: A Block-Based Graph Processing Framework for Heterogeneous Platforms

  2022cites this paper
• PMShifter: enabling persistent memory fluidness in Linux

  2022influential citation
• Accelerating SSSP for Power-Law Graphs

  2022cites this paper
• A fast work-efficient SSSP algorithm for GPUs

  2021influential citation
• NWGraph: A Library of Generic Graph Algorithms and Data Structures in C++20

  2021cites this paper
• Efficient Execution of Graph Algorithms on CPU with SIMD Extensions

  2021cites this paper
• Quantifying the Semantic Gap Between Serial and Parallel Programming

  2021cites this paper
• Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds

  2021cites this paper
• Practical smart contract sharding with ownership and commutativity analysis

  2021cites this paper
• Atos: A Task-Parallel GPU Dynamic Scheduling Framework for Dynamic Irregular Computations

  2021cites this paper
• A Sensible Approach to Speculative Automatic Parallelization

  2021cites this paper
• Loop Parallelization using Dynamic Commutativity Analysis

  2021cites this paper
• Scope States: Guarding Safety of Name Resolution in Parallel Type Checkers

  2021cites this paper
• Gretch

  2021cites this paper
• Provably space-efficient parallel functional programming

  2021cites this paper
• YuenyeungSpTRSV: A Thread-Level and Warp-Level Fusion Synchronization-Free Sparse Triangular Solve

  2021cites this paper
• ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing

  2021cites this paper
• Scheduling of Graph Queries: Controlling Intra- and Inter-query Parallelism for a High System Throughput

  2021cites this paper
• Tasking framework for adaptive speculative parallel mesh generation

  2021cites this paper
• Parallel graph-grammar-based algorithm for the longest-edge refinement of triangular meshes and the pollution simulations in Lesser Poland area

  2021cites this paper
• GraphGuess: Approximate Graph Processing System with Adaptive Correction

  2021cites this paper
• Decomposing Data Structure Commutativity Proofs with $m\!n$-Differencing

  2021cites this paper
• CapelliniSpTRSV: A Thread-Level Synchronization-Free Sparse Triangular Solve on GPUs

  2020cites this paper
• A programming model for semi-implicit parallelization of static analyses

  2020cites this paper
• Ohua as an STM Alternative for Shared State Applications

  2020cites this paper
• PaSh: light-touch data-parallel shell processing

  2020cites this paper
• Reducing Commutativity Verification to Reachability with Differencing Abstractions

  2020cites this paper
• T4: Compiling Sequential Code for Effective Speculative Parallelization in Hardware

  2020cites this paper
• Adapting Persistent Data Structures for Concurrency and Speculation

  2020cites this paper
• Automating the Proof that Data Structure Implementations Commute with mn -Differencing

  2020cites this paper
• Aquila: Adaptive Parallel Computation of Graph Connectivity Queries

  2020influential citation
• Dynamic Graph Operations: A Consistent Non-blocking Approach

  2020cites this paper
• Key issues in exascale computing

  2020cites this paper
• Automatic parallelization of representative-based clustering algorithms for multicore cluster systems

  2020cites this paper
• Parallel Shared-Memory Isogeometric Residual Minimization (iGRM) for Three-Dimensional Advection-Diffusion Problems

  2020cites this paper
• Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

  2020cites this paper
• Perspective: A Sensible Approach to Speculative Automatic Parallelization

  2020cites this paper
• Workload Characterization of Nondeterministic Programs Parallelized by STATS

  2019cites this paper
• A Breadth-First, Ordered Parallel Tree Traversal

  2019influential citation
• Excavating the Potential of GPU for Accelerating Graph Traversal

  2019cites this paper
• Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects

  2019cites this paper
• Disentanglement in nested-parallel programs

  2019cites this paper
• Graphyti: A Semi-External Memory Graph Library for FlashGraph

  2019cites this paper
• Ignis: scaling distribution-oblivious systems with light-touch distribution

  2019cites this paper
• Learning stateful preconditions modulo a test generator

  2019cites this paper
• Optimized Execution of Parallel Loops via User-Defined Scheduling Policies

  2019cites this paper
• Efficient Scheduling and High-Performance Graph Partitioning on Heterogeneous CPU-GPU Systems

  2018cites this paper
• Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

  2018influential citation
• Towards a compiler analysis for parallel algorithmic skeletons

  2018cites this paper
• Reducing the burden of parallel loop schedulers for many‐core processors

  2018cites this paper
• A high-performance connected components implementation for GPUs

  2018cites this paper
• Parallel Implementations of RCM Algorithm for Bandwidth Reduction of Sparse Matrices

  2018cites this paper
• GraphMP: I/O-Efficient Big Graph Analytics on a Single Commodity Machine

  2018influential citation
• MemoDyn: exploiting weakly consistent data structures for dynamic parallel memoization

  2018cites this paper
• Runtime Parallelization of Static and Dynamic Irregular Array of Array References

  2018cites this paper
• Log(graph): a near-optimal high-performance graph representation

  2018cites this paper
• L-PowerGraph: a lightweight distributed graph-parallel communication mechanism

  2018cites this paper
• Scalable and Performant Graph Processing on GPUs Using Approximate Computing

  2018cites this paper
• Unconventional Parallelization of Nondeterministic Applications

  2018cites this paper
• Enabling scalability-sensitive speculative parallelization for FSM computations

  2017cites this paper
• Energy and power considerations of GPUs

  2017cites this paper
• Proust: A Design Space for Highly-Concurrent Transactional Data Structures

  2017cites this paper
• A Generalized Framework for Automatic Scripting Language Parallelization

  2017cites this paper
• Automatic Scalable Atomicity via Semantic Locking

  2017cites this paper
• Using the Xeon Phi Platform to Run Speculatively-Parallelized Codes

  2017cites this paper
• Dynamic Load Balancing Strategies for Graph Applications on GPUs

  2017cites this paper
• Fast Dynamic Graph Algorithms

  2017cites this paper
• Bounded exhaustive test-input generation on GPUs

  2017cites this paper
• Aggressive pipelining of irregular applications on reconfigurable hardware

  2017influential citation
• A non-speculative parallelization of reverse cuthill-McKee algorithm for sparse matrices reordering

  2017cites this paper
• Runtime-adaptive generalized task parallelism

  2017cites this paper
• EPIC: A framework to exploit parallelism in irregular codes

  2017cites this paper