DOCSLIB.ORG

Compiler Optimisations and Relaxed Memory Consistency Models Robin Morisset

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Compiler Optimisations and Relaxed Memory Consistency Models Robin Morisset Compiler optimisations and relaxed memory consistency models Robin Morisset To cite this version: Robin Morisset. Compiler optimisations and relaxed memory consistency models. Other [cs.OH]. Université Paris sciences et lettres, 2017. English. NNT : 2017PSLEE050. tel-01823521 HAL Id: tel-01823521 https://tel.archives-ouvertes.fr/tel-01823521 Submitted on 26 Jun 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THÈSE DE DOCTORAT de l’Université de recherche Paris Sciences Lettres PSL Research University Préparée à l’École normale supérieure Compiler Optimisations and Relaxed Memory Consistency Models ED 386 sciences mathématiques de paris centre Spécialité informatique composition du jury : M. Andrew Appel Princeton University Rapporteur (non membre du jury) M. Doug Lea State University of New York Rapporteur M. Mark Batty University of Kent Examinateur Robin Morisset M. Derek Dreyer Version du 12/07/2017 Max Planck Institute for Software Systems Examinateur M. Marc Pouzet École normale supérieure Dirigée par Francesco Zappa Nardelli Président du jury M. Dmitry Vyukov Google Examinateur M. Francesco Zappa Nardelli Inria Directeur de thèse Acknowledgments First, I would like to thank Francesco for being the best advisor I could have hoped for, leaving me great freedom in what to research while always being available when I needed advice. I hope to have learned some of his riguor and pedagogy through these years. I am also grateful to all the members of my jury for their participation, and in partic- ular to Andrew and Doug for having reviewed very thoroughly this thesis in such a short time. I was supported throughout this work by a fellowship from Google for which I am thankful. Google, and J.F. Bastien in particular also offered me the wonderful opportunity to apply my research in the Clang compiler through a 3 month internship that I greatly appreciated. Throughout the rest of my thesis I frequently interacted with the other members of the Parkas team, who made it a very welcoming place to work. I would especially like to thank Guillaume Baudart, Adrien Guatto and Nhat Minh Lê for the many coffee breaks we shared discussing everything and anything, and for the sleepless nights I spent writing papers with Adrien and Nhat. Obviously, research is frequently a group effort, and I would like to thank now all those I collaborated with over the past few years. Obviously this includes Francesco, Adrien, and Nhat, but also Thibaut Balabonski, Pankaj Pawan, and Viktor Vafeiadis. I also benefited from more informal research collaborations and discussions, in particular with Peter Sewell’s team in Cambridge: Mark Batty, Kayvan Memarian, Jean Pichon, Peter Sewell and others made each of my trips to Cambridge remarkably productive and enjoyable. I am also deeply thankful to Jean-Christophe Filliâtre. He not only made me discover research on compilers through his course in 2009 and his recommendation for my first internship; he also made me a TA in 2015 for his compilation course. This teaching work was a pleasure, with wonderful students, and gave me something to look forward to every week, even when nothing was working on the research side. I would also like to thank my family, for believing in me even when I didn’t and supporting me all these years. I wouldn’t be here without you. Last but not least, I would like to thank all of my friends, who made these years bearable and often even fun. 2 Contents 1 Why study compiler optimisations of shared memory programs? 5 2 A primer on memory models 9 2.1 Examples of non-sequentially consistent behaviors . .9 2.2 Hardware memory models . 10 2.2.1 The x86 architecture . 10 2.2.2 The Power and ARM architectures . 13 2.2.3 Other architectures . 17 2.3 Language memory models . 17 2.3.1 Compiler optimisations in the Power model? . 18 2.3.2 Data-Race Freedom (DRF) . 20 2.3.3 The C11/C++11 model . 20 3 Issues with the C11 model and possible improvements 28 3.0.1 Consume accesses . 28 3.0.2 SC fences . 29 3.1 Sanity properties . 29 3.1.1 Weakness of the SCReads axiom . 29 3.1.2 Relaxed atomics allow causality cycles . 30 3.2 Further simplifications and strengthenings of the model . 34 3.2.1 Simplifying the coherency axioms . 34 3.2.2 The definition of release sequences . 36 3.2.3 Intra-thread synchronisation is needlessly banned . 36 4 Correct optimizations in the C11 model 38 4.1 Optimising accesses around atomics . 39 4.1.1 Eliminations of actions . 39 4.1.2 Reorderings of actions . 43 4.1.3 Introductions of actions . 44 4.2 Optimizing atomic accesses . 44 4.2.1 Basic Metatheory of the Corrected C11 Models . 44 4.2.2 Verifying Instruction Reorderings . 47 4.2.3 Counter-examples for unsound reorderings . 50 4.2.4 Verifying Instruction Eliminations . 57 5 Fuzzy-testing GCC and Clang for compiler concurrency bugs 61 5.1 Compiler concurrency bugs . 61 5.2 Compiler Testing . 64 5.3 Impact on compiler development . 69 3 6 LibKPN: A scheduler for Kahn Process Networks using C11 atomics 72 6.1 Scheduling of Kahn Process Networks . 72 6.1.1 Graphs of dependencies between task activations . 73 6.1.2 Scheduling: why naive approaches fail . 73 6.2 Algorithms for passive waiting . 75 6.2.1 Algorithm F: double-checking in suspend ............... 75 6.2.2 Algorithm S: removing fences on the critical path . 78 6.2.3 Algorithm H: keeping the best of algorithms F and S . 78 6.2.4 Going beyond KPNs: adding select in algorithm H . 79 6.2.5 Implementation details . 81 6.3 Proofs of correctness . 85 6.3.1 Outline of the difficulties and methods . 85 6.3.2 Absence of races . 86 6.3.3 Guarantee of progress . 90 6.4 Remarks on C11 programming . 93 6.5 Applications and experimental evaluation . 94 6.5.1 Micro-benchmarks . 94 6.5.2 Dataflow benchmarks . 95 6.5.3 Linear algebra benchmarks . 97 7 A fence elimination algorithm for compiler backends 102 7.1 A PRE-inspired fence elimination algorithm . 103 7.1.1 Leveraging PRE . 105 7.1.2 The algorithm on a running example . 106 7.1.3 Corner cases . 109 7.1.4 Proof of correctness . 110 7.2 Implementation and extensions to other ISAs . 111 7.3 Experimental evaluation . 113 8 Perspectives 115 8.1 Related work . 116 8.1.1 About optimisations in a concurrent context . 116 8.1.2 About fuzzy-testing of compilers . 116 8.1.3 About LibKPN . 117 8.1.4 About fence elimination . 118 8.2 Future work . 119 8.2.1 About the C11 model . 119 8.2.2 About the fence elimination algorithm . 119 8.2.3 About LibKPN . 121 A Proof of Theorem 4 131 4 Chapter 1 Why study compiler optimisations of shared memory programs? Multicore computers have become ubiquitous, in servers, personal computers and even phones. The lowest abstraction for programming them is the shared-memory, multi- threaded program, in which several sequences of instructions (threads) are executed con- currently, accessing the same data. When these programs are compiled, it is usually done piecemeal: the compiler only see fragments of a thread at any time, unaware of the ex- istence of other threads. This disconnect can lead compilers to break the expectations of the programmers regarding such multi-threaded programs. Consider for example the following program which shows two threads executing side-by-side: Initially, x = y = 0 Thread 1 Thread 2 x:= 1; if (x > 0) { if (y > 0) { x := 0; print x; y := 1; } } It has two global variables, x and y which are initialized at 0, and they are shared by the two threads. We assume both threads are started at the same time. What values can the first thread print? At first glance, 0 is the only value that can be printed: if the conditional in the left thread is taken, it means the store of 1 to y has happened, and so the store of 0 to x has happened too. Since it is also in a conditional, it must have happened after the store of 1 to x. So the value of x is 0 when it is printed. But if the first thread is compiled by an optimising compiler, the compiler will execute the constant propagation optimisation: since there is no visible access to x between its store and its load, the compiler will assume the value has not changed and will replace print x by print 1, introducing a new behaviour. Is this a bug in the compiler? No, the problem was our assumption that all threads have the same view of memory at all times, and that executing a multi-threaded pro- gram is equivalent to repeatedly picking one thread and executing it for one step. These assumptions are called the Sequential Consistency model (SC) and were first formal- ized in [Lam79]. Constant propagation is not the only optimisation that can break the SC model. Common Sub-expression Elimination (CSE), Loop Invariant Code Motion (LICM), Global Value Numbering (GVN) and Partial Redundancy Elimination (PRE) 5 are some other examples.
Load more

Recommended publications
  • Memory Consistency
    Lecture 9: Memory Consistency Parallel Computing Stanford CS149, Winter 2019 Midterm ▪ Feb 12 ▪ Open notes ▪ Practice midterm Stanford CS149, Winter 2019 Shared Memory Behavior ▪ Intuition says loads should return latest value written - What is latest? - Coherence: only one memory location - Consistency: apparent ordering for all locations - Order in which memory operations performed by one thread become visible to other threads ▪ Affects - Programmability: how programmers reason about program behavior - Allowed behavior of multithreaded programs executing with shared memory - Performance: limits HW/SW optimizations that can be used - Reordering memory operations to hide latency Stanford CS149, Winter 2019 Today: what you should know ▪ Understand the motivation for relaxed consistency models ▪ Understand the implications of relaxing W→R ordering Stanford CS149, Winter 2019 Today: who should care ▪ Anyone who: - Wants to implement a synchronization library - Will ever work a job in kernel (or driver) development - Seeks to implement lock-free data structures * - Does any of the above on ARM processors ** * Topic of a later lecture ** For reasons to be described later Stanford CS149, Winter 2019 Memory coherence vs. memory consistency ▪ Memory coherence defines requirements for the observed Observed chronology of operations on address X behavior of reads and writes to the same memory location - All processors must agree on the order of reads/writes to X P0 write: 5 - In other words: it is possible to put all operations involving X on a timeline such P1 read (5) that the observations of all processors are consistent with that timeline P2 write: 10 ▪ Memory consistency defines the behavior of reads and writes to different locations (as observed by other processors) P2 write: 11 - Coherence only guarantees that writes to address X will eventually propagate to other processors P1 read (11) - Consistency deals with when writes to X propagate to other processors, relative to reads and writes to other addresses Stanford CS149, Winter 2019 Coherence vs.
    [Show full text]
  • Memory Consistency: in a Distributed Outline for Lecture 20 Memory System, References to Memory in Remote Processors Do Not Take Place I
    Memory consistency: In a distributed Outline for Lecture 20 memory system, references to memory in remote processors do not take place I. Memory consistency immediately. II. Consistency models not requiring synch. This raises a potential problem. Suppose operations that— Strict consistency Sequential consistency • The value of a particular memory PRAM & processor consist. word in processor 2’s local memory III. Consistency models is 0. not requiring synch. operations. • Then processor 1 writes the value 1 to that word of memory. Note that Weak consistency this is a remote write. Release consistency • Processor 2 then reads the word. But, being local, the read occurs quickly, and the value 0 is returned. What’s wrong with this? This situation can be diagrammed like this (the horizontal axis represents time): P1: W (x )1 P2: R (x )0 Depending upon how the program is written, it may or may not be able to tolerate a situation like this. But, in any case, the programmer must understand what can happen when memory is accessed in a DSM system. Consistency models: A consistency model is essentially a contract between the software and the memory. It says that iff they software agrees to obey certain rules, the memory promises to store and retrieve the expected values. © 1997 Edward F. Gehringer CSC/ECE 501 Lecture Notes Page 220 Strict consistency: The most obvious consistency model is strict consistency. Strict consistency: Any read to a memory location x returns the value stored by the most recent write operation to x. This definition implicitly assumes the existence of a global clock, so that the determination of “most recent” is unambiguous.
    [Show full text]
  • Towards Shared Memory Consistency Models for Gpus
    TOWARDS SHARED MEMORY CONSISTENCY MODELS FOR GPUS by Tyler Sorensen A thesis submitted to the faculty of The University of Utah in partial fulfillment of the requirements for the degree of Bachelor of Science School of Computing The University of Utah March 2013 FINAL READING APPROVAL I have read the thesis of Tyler Sorensen in its final form and have found that (1) its format, citations, and bibliographic style are consistent and acceptable; (2) its illustrative materials including figures, tables, and charts are in place. Date Ganesh Gopalakrishnan ABSTRACT With the widespread use of GPUs, it is important to ensure that programmers have a clear understanding of their shared memory consistency model i.e. what values can be read when issued concurrently with writes. While memory consistency has been studied for CPUs, GPUs present very different memory and concurrency systems and have not been well studied. We propose a collection of litmus tests that shed light on interesting visibility and ordering properties. These include classical shared memory consistency model properties, such as coherence and write atomicity, as well as GPU specific properties e.g. memory visibility differences between intra and inter block threads. The results of the litmus tests are determined by feedback from industry experts, the limited documentation available and properties common to all modern multi-core systems. Some of the behaviors remain unresolved. Using the results of the litmus tests, we establish a formal state transition model using intuitive data structures and operations. We implement our model in the Murphi modeling language and verify the initial litmus tests.
    [Show full text]
  • On the Coexistence of Shared-Memory and Message-Passing in The
    On the Co existence of SharedMemory and MessagePassing in the Programming of Parallel Applications 1 2 J Cordsen and W SchroderPreikschat GMD FIRST Rudower Chaussee D Berlin Germany University of Potsdam Am Neuen Palais D Potsdam Germany Abstract Interop erability in nonsequential applications requires com munication to exchange information using either the sharedmemory or messagepassing paradigm In the past the communication paradigm in use was determined through the architecture of the underlying comput ing platform Sharedmemory computing systems were programmed to use sharedmemory communication whereas distributedmemory archi tectures were running applications communicating via messagepassing Current trends in the architecture of parallel machines are based on sharedmemory and distributedmemory For scalable parallel applica tions in order to maintain transparency and eciency b oth communi cation paradigms have to co exist Users should not b e obliged to know when to use which of the two paradigms On the other hand the user should b e able to exploit either of the paradigms directly in order to achieve the b est p ossible solution The pap er presents the VOTE communication supp ort system VOTE provides co existent implementations of sharedmemory and message passing communication Applications can change the communication paradigm dynamically at runtime thus are able to employ the under lying computing system in the most convenient and applicationoriented way The presented case study and detailed p erformance analysis un derpins the
    [Show full text]
  • Consistency Models • Data-Centric Consistency Models • Client-Centric Consistency Models
    Consistency and Replication • Today: – Consistency models • Data-centric consistency models • Client-centric consistency models Computer Science CS677: Distributed OS Lecture 15, page 1 Why replicate? • Data replication: common technique in distributed systems • Reliability – If one replica is unavailable or crashes, use another – Protect against corrupted data • Performance – Scale with size of the distributed system (replicated web servers) – Scale in geographically distributed systems (web proxies) • Key issue: need to maintain consistency of replicated data – If one copy is modified, others become inconsistent Computer Science CS677: Distributed OS Lecture 15, page 2 Object Replication •Approach 1: application is responsible for replication – Application needs to handle consistency issues •Approach 2: system (middleware) handles replication – Consistency issues are handled by the middleware – Simplifies application development but makes object-specific solutions harder Computer Science CS677: Distributed OS Lecture 15, page 3 Replication and Scaling • Replication and caching used for system scalability • Multiple copies: – Improves performance by reducing access latency – But higher network overheads of maintaining consistency – Example: object is replicated N times • Read frequency R, write frequency W • If R<<W, high consistency overhead and wasted messages • Consistency maintenance is itself an issue – What semantics to provide? – Tight consistency requires globally synchronized clocks! • Solution: loosen consistency requirements
    [Show full text]
  • Challenges for the Message Passing Interface in the Petaflops Era
    Challenges for the Message Passing Interface in the Petaflops Era William D. Gropp Mathematics and Computer Science www.mcs.anl.gov/~gropp What this Talk is About The title talks about MPI – Because MPI is the dominant parallel programming model in computational science But the issue is really – What are the needs of the parallel software ecosystem? – How does MPI fit into that ecosystem? – What are the missing parts (not just from MPI)? – How can MPI adapt or be replaced in the parallel software ecosystem? – Short version of this talk: • The problem with MPI is not with what it has but with what it is missing Lets start with some history … Argonne National Laboratory 2 Quotes from “System Software and Tools for High Performance Computing Environments” (1993) “The strongest desire expressed by these users was simply to satisfy the urgent need to get applications codes running on parallel machines as quickly as possible” In a list of enabling technologies for mathematical software, “Parallel prefix for arbitrary user-defined associative operations should be supported. Conflicts between system and library (e.g., in message types) should be automatically avoided.” – Note that MPI-1 provided both Immediate Goals for Computing Environments: – Parallel computer support environment – Standards for same – Standard for parallel I/O – Standard for message passing on distributed memory machines “The single greatest hindrance to significant penetration of MPP technology in scientific computing is the absence of common programming interfaces across various parallel computing systems” Argonne National Laboratory 3 Quotes from “Enabling Technologies for Petaflops Computing” (1995): “The software for the current generation of 100 GF machines is not adequate to be scaled to a TF…” “The Petaflops computer is achievable at reasonable cost with technology available in about 20 years [2014].” – (estimated clock speed in 2004 — 700MHz)* “Software technology for MPP’s must evolve new ways to design software that is portable across a wide variety of computer architectures.
    [Show full text]
  • An Overview on Cyclops-64 Architecture - a Status Report on the Programming Model and Software Infrastructure
    An Overview on Cyclops-64 Architecture - A Status Report on the Programming Model and Software Infrastructure Guang R. Gao Endowed Distinguished Professor Electrical & Computer Engineering University of Delaware [email protected] 2007/6/14 SOS11-06-2007.ppt 1 Outline • Introduction • Multi-Core Chip Technology • IBM Cyclops-64 Architecture/Software • Cyclops-64 Programming Model and System Software • Future Directions • Summary 2007/6/14 SOS11-06-2007.ppt 2 TIPs of compute power operating on Tera-bytes of data Transistor Growth in the near future Source: Keynote talk in CGO & PPoPP 03/14/07 by Jesse Fang from Intel 2007/6/14 SOS11-06-2007.ppt 3 Outline • Introduction • Multi-Core Chip Technology • IBM Cyclops-64 Architecture/Software • Programming/Compiling for Cyclops-64 • Looking Beyond Cyclops-64 • Summary 2007/6/14 SOS11-06-2007.ppt 4 Two Types of Multi-Core Architecture Trends • Type I: Glue “heavy cores” together with minor changes • Type II: Explore the parallel architecture design space and searching for most suitable chip architecture models. 2007/6/14 SOS11-06-2007.ppt 5 Multi-Core Type II • New factors to be considered –Flops are cheap! –Memory per core is small –Cache-coherence is expensive! –On-chip bandwidth can be enormous! –Examples: Cyclops-64, and others 2007/6/14 SOS11-06-2007.ppt 6 Flops are Cheap! An example to illustrate design tradeoffs: • If fed from small, local register files: 64-bit FP – 3200 GB/s, 10 pJ/op unit – < $1/Gflop (60 mW/Gflop) (drawn to a 64-bit FPU is < 1mm^2 scale) and ~= 50pJ • If fed from global on-chip memory: Can fit over 200 on a chip.
    [Show full text]
  • Constraint Graph Analysis of Multithreaded Programs
    Journal of Instruction-Level Parallelism 6 (2004) 1-23 Submitted 10/03; published 4/04 Constraint Graph Analysis of Multithreaded Programs Harold W. Cain [email protected] Computer Sciences Dept., University of Wisconsin 1210 W. Dayton St., Madison, WI 53706 Mikko H. Lipasti [email protected] Dept. of Electrical and Computer Engineering, University of Wisconsin 1415 Engineering Dr., Madison, WI 53706 Ravi Nair [email protected] IBM T.J. Watson Research Laboratory P.O. Box 218, Yorktown Heights, NY 10598 Abstract This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions for sequentially consistent systems, and extend these definitions for use in analyzing other memory consistency models. Using this framework, we present two constraint graph analysis case studies using several commercial and scientific workloads running on a full system simulator. The first case study illus- trates how a constraint graph can be used to determine the necessary conditions for implementing a memory consistency model, rather than conservative sufficient conditions. Using this method, we classify coherence misses as either required or unnecessary. We determine that on average over 30% of all load instructions that suffer cache misses due to coherence activity are unnecessarily stalled because the original copy of the cache line could have been used without violating the mem- ory consistency model. Based on this observation, we present a novel delayed consistency imple- mentation that uses stale cache lines when possible. The second case study demonstrates the effects of memory consistency constraints on the fundamental limits of instruction level parallelism, com- pared to previous estimates that did not include multiprocessor constraints.
    [Show full text]
  • Memory Consistency Models
    Memory Consistency Models David Mosberger TR 93/11 Abstract This paper discusses memory consistency models and their in¯uence on software in the context of parallel machines. In the ®rst part we review previous work on memory consistency models. The second part discusses the issues that arise due to weakening memory consistency. We are especially interested in the in¯uence that weakened consistency models have on language, compiler, and runtime system design. We conclude that tighter interaction between those parts and the memory system might improve performance considerably. Department of Computer Science The University of Arizona Tucson, AZ 85721 ¡ This is an updated version of [Mos93] 1 Introduction increases. Shared memory can be implemented at the hardware Traditionally, memory consistency models were of in- or software level. In the latter case it is usually called terest only to computer architects designing parallel ma- DistributedShared Memory (DSM). At both levels work chines. The goal was to present a model as close as has been done to reap the bene®ts of weaker models. We possible to the model exhibited by sequential machines. conjecture that in the near future most parallel machines The model of choice was sequential consistency (SC). will be based on consistency models signi®cantly weaker ¡ Sequential consistency guarantees that the result of any than SC [LLG 92, Sit92, BZ91, CBZ91, KCZ92]. execution of processors is the same as if the opera- The rest of this paper is organized as follows. In tions of all processors were executed in some sequential section 2 we discuss issues characteristic to memory order, and the operations of each individual processor consistency models.
    [Show full text]
  • The Openmp Memory Model
    The OpenMP Memory Model Jay P. Hoeflinger1 and Bronis R. de Supinski2 1 Intel, 1906 Fox Drive, Champaign, IL 61820 [email protected] http://www.intel.com 2 Lawrence Livermore National Laboratory, P.O. Box 808, L-560, Livermore, California 94551-0808* [email protected] http://www.llnl.gov/casc Abstract. The memory model of OpenMP has been widely misunder- stood since the first OpenMP specification was published in 1997 (For- tran 1.0). The proposed OpenMP specification (version 2.5) includes a memory model section to address this issue. This section unifies and clarifies the text about the use of memory in all previous specifications, and relates the model to well-known memory consistency semantics. In this paper, we discuss the memory model and show its implications for future distributed shared memory implementations of OpenMP. 1 Introduction Prior to the OpenMP version 2.5 specification, no separate OpenMP Memory Model section existed in any OpenMP specification. Previous specifications had scattered information about how memory behaves and how it is structured in an OpenMP pro- gram in several sections: the parallel directive section, the flush directive section, and the data sharing attributes section, to name a few. This has led to misunderstandings about how memory works in an OpenMP program, and how to use it. The most problematic directive for users is probably the flush directive. New OpenMP users may wonder why it is needed, under what circumstances it must be used, and how to use it correctly. Perhaps worse, the use of explicit flushes often confuses even experienced OpenMP programmers.
    [Show full text]
  • Optimization of Memory Management on Distributed Machine Viet Hai Ha
    Optimization of memory management on distributed machine Viet Hai Ha To cite this version: Viet Hai Ha. Optimization of memory management on distributed machine. Other [cs.OH]. Institut National des Télécommunications, 2012. English. NNT : 2012TELE0042. tel-00814630 HAL Id: tel-00814630 https://tel.archives-ouvertes.fr/tel-00814630 Submitted on 17 Apr 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. ABCDBEFAD EBDDDFADD ABCDEF EEEFAABCDEFCAADDABCDDA FCF EFECFF !" #$!"B ! "!#$!%" EC%&EF'%(' C*F+EEA ADDCDD A F !"DDDD#$% AC!AD&F'F(CA ))DC !*ADD+, F DDCADAD AD. !*(/AD !F DDCADA0, 1ADC !*2D3 C !,FF DDCDAADDD!AD4CAD !*4A)D4 DDCDAA.5 !D*(D+,!(( !"DDDD#$%4! 2012TELE0042 ABCD ABACDEAFFEBBADDEABFAEABFBFDAEFE EEABEFACAABAFAFFFFBAEABBA ADEFBFAEAABEBAADAEE EBABAFDB !"EABAFBABAEA#AEF $%&EBAEADFEFBEBADEAEAF AADA#BABBA!ABAFAAEABEBAFEFDBFB#E FB$%&EBAFDDEBBAEBF ABBEAFB$%&EBAEFDDEBBAFEA'F ACDAEABF (AADBBAFBBAEAABFDDEBA DEABFFFBAEF#EBAEFABEA ABABFBAFFBBAA#AEF ABCDEEFABCABBBFADFEFD DFEFBDDBAFFBFBDDBF DABBBBDAFEBBDEA ACA DEBDAAFB ABBB!CDCFBBEDCEFEDB " BB C E
    [Show full text]
  • Dag-Consistent Distributed Shared Memory
    Dag-Consistent Distributed Shared Memory Robert D. Blumofe Matteo Frigo Christopher F. Joerg Charles E. Leiserson Keith H. Randall MIT Laboratory for Computer Science 545 Technology Square Cambridge, MA 02139 Abstract relaxed models of shared-memory consistency have been developed [10, 12, 13] that compromise on semantics for We introduce dag consistency, a relaxed consistency model a faster implementation. By and large, all of these consis- for distributed shared memory which is suitable for multi- tency models have had one thingin common: they are ªpro- threaded programming. We have implemented dag consis- cessor centricº in the sense that they de®ne consistency in tency in software for the Cilk multithreaded runtime system terms of actions by physical processors. In this paper, we running on a Connection Machine CM5. Our implementa- introduce ªdagº consistency, a relaxed consistency model tion includes a dag-consistent distributed cactus stack for based on user-level threads which we have implemented for storage allocation. We provide empirical evidence of the Cilk[4], a C-based multithreadedlanguage and runtimesys- ¯exibility and ef®ciency of dag consistency for applications tem. that include blocked matrix multiplication, Strassen's ma- trix multiplication algorithm, and a Barnes-Hut code. Al- Dag consistency is de®ned on the dag of threads that make though Cilk schedules the executions of these programs dy- up a parallel computation. Intuitively, a read can ªseeº a namically, their performances are competitive with stati- write in the dag-consistency model only if there is some se- cally scheduled implementations in the literature. We also rial execution order consistentwiththedag in which theread sees the write.
    [Show full text]