An analysis of dag-consistent distributed shared-memory algorithms

No abstract is available for this paper.

• Publication year

  1996

• Venue

  ACM Symposium on Parallelism in Algorithms and Architectures

• Publication date

  1996-06-24

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/237502.237574
• 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
• Conference proceedings

  1999cited by this paper
• Retrospective: memory access buffering in multiprocessors

  1998cited by this paper
• Retrospective: memory consistency and event ordering in scalable shared-memory multiprocessors

  1998cited by this paper
• The Cilk system for parallel multithreaded computing

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Programming parallel algorithms

  1996cited by this paper
• DAG-consistent distributed shared memory

  1996influential reference
• Provably efficient scheduling for languages with fine-grained parallelism

  1995cited by this paper
• CRL: high-performance all-software distributed shared memory

  1995cited by this paper
• Executing multithreaded programs efficiently

  1995influential reference
• Cilk: an efficient multithreaded runtime system

  1995cited by this paper
• LCM: memory system support for parallel language implementation

  1994cited by this paper
• Scheduling multithreaded computations by work stealing

  1994influential reference
• Tempest and Typhoon: user-level shared memory

  1994cited by this paper
• The design and evaluation of a shared object system for distributed memory machines

  1994cited by this paper
• TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems

  1994cited by this paper
• The Midway distributed shared memory system

  1993cited by this paper
• Location consistency: stepping beyond the barriers of memory coherence and serializability

  1993cited by this paper
• Parallel Algorithms for Shared-Memory Machines

  1991cited by this paper
• Implementing and programming causal distributed shared memory

  1991cited by this paper
• Cache Consistency and Sequential Consistency

  1991cited by this paper
• Implementation and performance of Munin

  1991cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• Weak ordering-a new definition

  1990cited by this paper
• Memory consistency and event ordering in scalable shared-memory multiprocessors

  1990cited by this paper
• Numerische Mathematik 1

  1989cited by this paper
• The control mechanism for the Myrias parallel computer system

  1988cited by this paper
• The BLAZE language: A parallel language for scientific programming

  1987cited by this paper
• Operating Systems Theory

  1973cited by this paper
• Gaussian elimination is not optimal

  1969cited by this paper

• Quantified Underapproximation via Labeled Bunches

  2025cites this paper
• GFFT: a Task Graph Based Fast Fourier Transform Optimization Framework

  2023cites this paper
• Beyond Static Parallel Loops: Supporting Dynamic Task Parallelism on Manycore Architectures with Software-Managed Scratchpad Memories

  2023cites this paper
• Scalable In-Band Full-Duplex Phased Arrays: Complexity Reduction and Distributed Processing

  2023cites this paper
• Itoyori: Reconciling Global Address Space and Global Fork-Join Task Parallelism

  2023cites this paper
• Improving Cache Utilization of Nested Parallel Programs by Almost Deterministic Work Stealing

  2022cites this paper
• Processor-Aware Cache-Oblivious Algorithms✱

  2021cites this paper
• Empirical Analysis of Cache-Oblivious Matrix Multiplication on Multicore Processor Systems

  2021cites this paper
• Streaming Sparse Graphs using Efficient Dynamic Sets

  2021cites this paper
• Efficiently Supporting Dynamic Task Parallelism on Heterogeneous Cache-Coherent Systems

  2020influential citation
• High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments

  2020cites this paper
• Fine Tuning the Performance of Parallel Codes

  2020cites this paper
• WET: Write Efficient Loop Tiling for Non-Volatile Main Memory

  2020cites this paper
• Improving the Space-Time Efficiency of Matrix Multiplication Algorithms

  2020influential citation
• Balanced Partitioning of Several Cache-Oblivious Algorithms

  2020cites this paper
• Red-Blue Pebbling Revisited: Near Optimal Parallel Matrix-Matrix Multiplication

  2019cites this paper
• Multilevel Approaches to Fine Tune Performance of Linear Algebra Libraries

  2019cites this paper
• Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra

  2018cites this paper
• Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies

  2017cites this paper
• Fast Fourier transform benchmark on X86 Xeon system for multimedia data processing

  2017cites this paper
• Designing Scalable Distributed Memory Models: A Case Study

  2017cites this paper
• Theory and Applications of Parallelism with Futures

  2017cites this paper
• Proposal : Models and Algorithms with Asymmetric Read and Write Costs

  2016cites this paper
• Experimental Analysis of Space-Bounded Schedulers

  2016cites this paper
• Automatic Discovery of Efficient Divide-&-Conquer Algorithms for Dynamic Programming Problems

  2016cites this paper
• Simulation of a Scheduling Algorithm for DAG-based Task Models

  2015cites this paper
• Sorting with Asymmetric Read and Write Costs

  2015cites this paper
• Experimental analysis of space-bounded schedulers

  2014cites this paper
• Well-structured futures and cache locality

  2014cites this paper
• Well-Structured Futures and Cache Locality

  2013cites this paper
• Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout

  2013cites this paper
• Program-Centric Cost Models for Locality and Parallelism

  2013cites this paper
• Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures

  2013cites this paper
• Memory abstractions for parallel programming

  2012cites this paper
• Paging for multi-core shared caches

  2012cites this paper
• On the realizability of hardware microthreading. Revisiting the general-purpose processor interface: consequences and challenges

  2012cites this paper
• CellCilk: Extending Cilk for Heterogeneous Multicore Platforms

  2011cites this paper
• Toward high-performance polynomial system solvers based on triangular decompositions

  2010cites this paper
• Using memory mapping to support cactus stacks in work-stealing runtime systems

  2010cites this paper
• The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation

  2010cites this paper
• Programming Environment, Run-Time System and Simulator for Many-Core Machines. (Environnement de programmation, support à l'exécution et simulateur pour machines à grand nombre de cœurs)

  2010cites this paper
• Interactive Physical Simulation on Multi-core and Multi-GPU Architectures. (Simulations Physiques Interactives sur des Architectures Multi-Core et Multi-GPU)

  2010cites this paper
• TOWARD HIGH-PERFORMANCE POLYNOMIAL SYSTEM SOLVERS BASED

  2009cites this paper
• The Cache Complexity of Multithreaded Cache Oblivious Algorithms

  2009cites this paper
• Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures

  2009cites this paper
• The Verification of the On-Chip COMA Cache Coherence Protocol

  2008cites this paper
• Provably good multicore cache performance for divide-and-conquer algorithms

  2008cites this paper
• Thesis Proposal Compositional Fault-tolerant Distributed Object Systems

  2007cites this paper
• Algorithms and data structures for cache-efficient computation: theory and experimental evaluation

  2007cites this paper
• Multiscale Scheduling: Integrating Competitive and Cooperative Scheduling in Theory and in Practice

  2007cites this paper
• The memory behavior of cache oblivious stencil computations

  2007cites this paper
• Multithreaded parallel implementation of arithmetic operations modulo a triangular set

  2007cites this paper
• Scheduling threads for constructive cache sharing on CMPs

  2007cites this paper
• An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms

  2007cites this paper
• The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation

  2007cites this paper
• The cache complexity of multithreaded cache oblivious algorithms

  2006cites this paper
• The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation

  2006cites this paper
• Brief announcement: The cache-oblivious Gaussian elimination paradigm -Theoretical framework and experimental evaluation

  2006cites this paper
• Lamport Order Revisit: a Study on How to Eeciently Achieve Sequential Consistency on a Modern Multiprocessor-on-a-chip Architecture

  2006cites this paper
• Automated Verication of UPC Memory Consistency

  2006cites this paper
• Cache-oblivious dynamic programming

  2006influential citation
• Consistencia de ejecución: una propuesta no cache coherente

  2005cites this paper
• Distributed Algorithms and Educational Simulation/Visualisation in Collaborative Environments

  2005cites this paper
• Dynamic shared data in structured parallel programming frameworks

  2004cites this paper
• A Framework for Measuring Supercomputer Productivity

  2004cites this paper
• Effectively sharing a cache among threads

  2004cites this paper
• Dynamic adaptation to cpu and memory load in scientific applications

  2004cites this paper
• Escalabilidad en DSM: modelos relajados de consistencia

  2004cites this paper
• 6.895 Theory of Parallel Systems Fast Serial-append File I/o Mode Support for Cilk

  2004cites this paper
• Cache-Oblivious Algorithms and Data Structures

  2003cites this paper
• eskimo : EXPERIMENTING SKELETONS

  2003cites this paper
• eskimo: Experimenting with Skeletons in the Shared Address Model

  2003cites this paper
• The performance model of SilkRoad - a multithreaded DSM system for clusters

  2003influential citation
• Key Message Approach to Optimize Communication of Parallel Applications on Clusters

  2003cites this paper
• The Cost of Cache-Oblivious Searching

  2003cites this paper
• A Unified Formal Specification and Analysis of the New Java Memory Models

  2003cites this paper
• Collaborative environments : aspects in communication and educational visualisation

  2003cites this paper
• Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations

  2002cites this paper
• The Data Locality of Work Stealing

  2002cites this paper
• RICE UNIVERSITY Transforming Complex Loop Nests For Locality

  2002cites this paper
• On the Tamability of the Location Consistency Memory Model

  2002cites this paper
• Exponential Structures for Efficient Cache-Oblivious Algorithms

  2002cites this paper
• Cache-oblivious priority queue and graph algorithm applications

  2002cites this paper
• A locality-preserving cache-oblivious dynamic dictionary

  2002cites this paper
• Ììì Äó Blockin

  2001influential citation
• Supporting Dynamic Data Structures with Olden

  2001cites this paper
• Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

  2001cites this paper
• An Abstract State Machine Specification and Verification of the Location Consistency Memory Model and Cache Protocol

  2001cites this paper
• The Location Consistency Memory Model and Cache Protocol: Specification and Verification

  2001cites this paper
• CILK: A Multi-Threaded Programming System for Meta-Computers

  2001cites this paper
• The data locality of work stealing

  2000cites this paper
• Design and verification of adaptive cache coherence protocols

  2000cites this paper
• Portable high performance programming via architecture-cognizant divide-and-conquer algorithms

  2000cites this paper
• Transforming loops to recursion for multi-level memory hierarchies

  2000cites this paper
• Efficient Scheduling of Strict Multithreaded Computations

  2000cites this paper
• Analyses of Load Stealing Models Based on Families of Differential Equations

  2000cites this paper
• Cache-oblivious B-trees

  2000cites this paper
• Location Consistency-A New Memory Model and Cache Consistency Protocol

  2000cites this paper
• Scheduling Threads for Low Space Requirement and Good Locality

  1999cites this paper
• Space-eecient Scheduling of Nested Parallelism

  1999cites this paper