Making asynchronous parallelism safe for the world

No abstract is available for this paper.

• Publication year

  1989

• Venue

  ACM-SIGACT Symposium on Principles of Programming Languages

• Publication date

  1989-12-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/96709.96731
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

  2016cited by this paper
• Common LISP: the language (2nd ed.)

  1990cited by this paper
• Partial order programming (extended abstract)

  1989cited by this paper
• Solving Problems on Concurrent Processors

  1988cited by this paper
• Efficient synchronization of multiprocessors with shared memory

  1988cited by this paper
• Vector Processing on the Alliant FX/8 Multiprocessor

  1986cited by this paper
• Data parallel algorithms

  1986cited by this paper
• Connection Machine Lisp: fine-grained parallel symbolic processing

  1986cited by this paper
• Parallel MIMD computation : the HEP supercomputer and its applications

  1985cited by this paper
• MULTILISP: a language for concurrent symbolic computation

  1985cited by this paper
• The connection machine

  1985cited by this paper
• Structure and interpretation of computer programs

  1985cited by this paper
• The cosmic cube

  1985cited by this paper
• Programming in Modula-2

  1985cited by this paper
• Status of work toward revision of programming language Fortran

  1984cited by this paper
• Implementation of multilisp: Lisp on a multiprocessor

  1984cited by this paper
• The structure of “THE”-multiprogramming system

  1983cited by this paper
• Programming in Modula-2

  1982cited by this paper
• The NON-VON Supercomputer

  1982cited by this paper
• The Revised Report on SCHEME: A Dialect of LISP.

  1978cited by this paper
• Time, clocks, and the ordering of events in a distributed system

  1978cited by this paper
• Proving the Correctness of Multiprocess Programs

  1977cited by this paper
• Lambda: The Ultimate Imperative

  1976cited by this paper
• LAMBDA: The Ultimate Declarative

  1976cited by this paper
• An Interpreter for Extended Lambda Calculus

  1975cited by this paper
• APL, an interactive approach

  1974cited by this paper
• Monitors

  1974cited by this paper
• The Illiac IV system

  1972cited by this paper
• The structure of the “THE”-multiprogramming system

  1967cited by this paper

• Disentanglement with Futures, State, and Interaction

  2024cites this paper
• Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises

  2024cites this paper
• Scalable High-Quality Hypergraph Partitioning

  2023cites this paper
• More Recent Advances in (Hyper)Graph Partitioning

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

  2021cites this paper
• Deterministic Parallel Hypergraph Partitioning

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

  2021cites this paper
• DStore: A Fast, Tailless, and Quiescent-Free Object Store for PMEM

  2021cites this paper
• SymPaths: Symbolic Execution Meets Partial Order Reduction

  2020cites this paper
• Deductive Software Verification: Future Perspectives: Reflections on the Occasion of 20 Years of KeY

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

  2020cites this paper
• Analysis of Commutativity with State-Chart Graph Representation of Concurrent Programs

  2019cites this paper
• SCAC: Weakly-coupled execution model for massively parallel systems

  2019cites this paper
• Tapir

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

  2019cites this paper
• Disentanglement in nested-parallel programs

  2019influential citation
• Disentanglement, Theory and Practice

  2019cites this paper
• Tree Contraction, Connected Components, Min- imum Spanning Trees: a GPU Path to Vertex Fitting

  2018cites this paper
• Analysis of Commutativity with state-chart graph representation of concurrent programs

  2018cites this paper
• Easier Parallel Programming with Provably-Efficient Runtime Schedulers

  2017cites this paper
• Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency

  2017cites this paper
• Shared-Memory Parallelism Can be Simple, Fast, and Scalable

  2017influential citation
• Performance engineering of multicore software: developing a science of fast code for the post-Moore era

  2016cites this paper
• Vertical Composition of Reversible Atomic Objects Timos Antonopoulos

  2016cites this paper
• Parallel algorithms for scheduling data-graph computations

  2016cites this paper
• Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling

  2016cites this paper
• The Scalable Commutativity Rule

  2015cites this paper
• Parallel Data Structures

  2015cites this paper
• Prospects of GPGPU in the Auger Offline Software Framework

  2015cites this paper
• Size Oblivious Programming of Clusters for Irregular Parallelism

  2015cites this paper
• Dynamic Determinism Checking for Structured Parallelism

  2014cites this paper
• Executing dynamic data-graph computations deterministically using chromatic scheduling

  2014cites this paper
• Phase-concurrent hash tables for determinism

  2014cites this paper
• ABC2: Adaptively Balancing Computation and Communication in a DSM Cluster of Multicores for Irregular Applications

  2014cites this paper
• DeSTM: Harnessing determinism in STMs for application development

  2014cites this paper
• Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting

  2014cites this paper
• The scalable commutativity rule: designing scalable software for multicore processors

  2014cites this paper
• Graph Algorithms in a Guaranteed-Deterministic Language

  2014cites this paper
• Programming frameworks for performance driven speculative parallelization

  2014cites this paper
• Ligra: a lightweight graph processing framework for shared memory

  2013cites this paper
• Priority Update as a Parallel Primitive

  2013cites this paper
• Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles

  2013cites this paper
• The scalable commutativity rule: designing scalable software for multicore processors

  2013cites this paper
• Simple , Fast and Scalable Parallel Algorithms for Shared Memory ( Thesis Proposal )

  2013cites this paper
• Reducing contention through priority updates

  2013cites this paper
• Determinacy and Repeatability of Parallel Program Schemata

  2012cites this paper
• Multi-core Computing Lecture 3

  2012cites this paper
• Internally deterministic parallel algorithms can be fast

  2012influential citation
• Techniques for Parallel Memory Hierarchies

  2011cites this paper
• Coarse-grained transactions (extended version)

  2011cites this paper
• Race Detectors for Cilk and Cilk++ Programs

  2011cites this paper
• Coarse-grained transactions

  2010cites this paper
• A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

  2010cites this paper
• Asynchronous sequential processes

  2009cites this paper
• Transactional boosting: a methodology for highly-concurrent transactional objects

  2008cites this paper
• The Galois System: Optimistic Parallelization of Irregular Programs

  2008cites this paper
• Optimistic parallelism requires abstractions

  2007cites this paper
• Concolic Testing of Multithreaded Programs and Its Application to Testing Security Protocols

  2006cites this paper
• A Runtime Framework for Parallel Programs

  2006cites this paper
• Concolic Testing of Sequential and Concurrent Programs

  2006cites this paper
• Automated Testing of Multithreaded Programs Using Race-Detection and Flipping

  2006cites this paper
• Scalable Automated Methods for Dynamic Program Analysis

  2006cites this paper
• Determinate Imperative Programming Determinate Imperative Programming A clocked interpretation of imperative syntax ( Extended Abstract )

  2005cites this paper
• Symbolic bounds analysis of pointers, array indices, and accessed memory regions

  2005cites this paper
• Thread Escape Analysis for a Memory Consistency -Aware Compiler

  2005cites this paper
• Weaves: A Framework for Reconfigurable Programming

  2005cites this paper
• Analyzing Threads for Shared Memory Consistency

  2004cites this paper
• Asynchronous and deterministic objects

  2004cites this paper
• Pointer analysis for structured parallel programs

  2003cites this paper
• Determining Determinacy ∗

  2003cites this paper
• Pointer Analysis for Stru tured Parallel ProgramsRADU

  2003cites this paper
• A Compiler Directed Framework for Parallel Compositional Systems

  2002cites this paper
• Analysis of Multithreaded Programs

  2001cites this paper
• Symbolic bounds analysis of pointers, array indices, and accessed memory regions

  2000cites this paper
• A Data Parallel Java Client-Server Architecture for Data Field Computations over Zn

  1998cites this paper
• Detection of Races and Control-Flow Nondeterminism

  1998cites this paper
• Data Field Computations on a Data ParallelJava Client-Server Distributed Architecture ( Research Report No . 1167 )

  1998cites this paper
• Protocol-based data-race detection

  1998cites this paper
• Commutativity analysis

  1997cites this paper
• Efficient Detection of Determinacy Races in Cilk Programs

  1997cites this paper
• Maintaining Concurrency Information for On-the-fly Data Race Detection

  1997cites this paper
• Memory systems for parallel programming

  1996cites this paper
• Semantic Foundations of Commutativity Analysis

  1996cites this paper
• User-de ned Reductions for E cient Communication inData-Parallel LanguagesGuhan

  1996cites this paper
• On the Complexity of Commutativity Analysis

  1996cites this paper
• The evolution of Lisp

  1996cites this paper
• Design and Implementation of 8_½: A Declarative Data-Parallel Language

  1996cites this paper
• Commutativity analysis: a new analysis framework for parallelizing compilers

  1996cites this paper
• Parallel Computing in Networks of Workstations with Paralex

  1996cites this paper
• Commutativity analysis: a technique for automatically parallelizing pointer-based computations

  1996cites this paper
• Automatically Parallelizing Serial Programs Using Commutativity Analysis

  1995cites this paper
• Franco-british N+n Meeting on Data-parallel Languages and Compilers for Portable Parallel Computing Conference Chairmen Parallel Programming and Memory Management Issues on P3i, a Video Real-time Machine Formal Veriication of Data-parallel Programs: Semantics, Proof System and Wp Calculus a Proof Sy

  1994cites this paper
• Commutativity Analysis: A New Technique for Automatically Parallelizing Serial Programs

  1994cites this paper
• State space reduction in abstract interpretation of parallel programs

  1994cites this paper
• A Discipline of Multiprogramming (preliminary Draft)

  1994cites this paper
• Requirements for DataParallel Programming Environments

  1994cites this paper
• Synchronized MIMD computing

  1994cites this paper
• Requirements for Data-Parallel Programming Environments

  1994cites this paper
• Analyzing stores and references in a parallel symbolic language

  1994cites this paper
• Design and Implementation of a Declarative Data-Parallel Language

  1994cites this paper