PPT-Haskell and Transactional memory

Simon Peyton Jones Microsoft Research Tokyo Haskell Users Group April 2010 Most new programming languages 1yr 5yr 10yr 15yr 1000000 1 100 10000 The quick death Geeks Practitioners. tumde Abstract So far transactional memoryalthough a promising techniquesuffered from the absence of an ef64257cient hardware implementation The upcoming Haswell microarchitecture from Intel introduces hardware transactional memory HTM in mainstream FernandesJoaoCachopo istutlpt Abstract Software Transactional Memory STM was initially propose d as a lockfree mechanism for concurrency control Early imple menta tions had ef64257ciency limitations and soon obstructionfre e propos als appeared to ta Kathleen Fisher. cs242. Reading: . “. Beautiful Concurrency. ”. , . . “. The Transactional Memory / Garbage Collection Analogy. ”. Thanks. to Simon . Peyton Jones. for these . slides. . Steve Severance – Alpha Heavy Industries. Motivation. Innovations in concurrency has not kept pace. Still using locks. Immutability has helped in Haskell. STM Basics. Transactional Concurrency. Atomicity – Results are visible all at once. Memory. Supporting Large Transactions. Anvesh. . Komuravelli. Abe Othman. Kanat. . Tangwongsan. Hardware-based. . Concurrent Programs. obj.x. = 7;. find_primes. ();. // intrusion test. if (. obj.x. Chapter 5, Part I. Topics. Higher Order Functions. map, filter. Infinite lists. Get out a piece of paper… we’ll be doing lots of tracing. Higher Order Functions*. A function that can . take a function . Rajwar. , R., . Herlihy. , M., and Lai, K. 2005. presented by . VasilyVolkov. , 04/30/08. Motivation. Transactional Memory is good. Never deadlocks. Makes concurrent programming easier. But requires programmer to be aware of. Chapter 1, Part I. Why are we doing this?. http://stackoverflow.com/questions/3175656/why-should-i-want-to-learn-haskell. http://programmers.stackexchange.com/questions/25569/is-haskell-worth-learning. Introduction to Artificial Intelligence Lecture 4: Intro to Haskell III. 1. Recursion. Since variables in Haskell are immutable, our only way of achieving iteration is through recursion.. Zajac. , Edward J. & Olsen, Cyrus P.. Journal of Management Studies. , 30 (1): 131-145. Presented by Nan Zhang. Overview. Motivation. Two limiting emphases of transaction cost analysis. A transactional value framework. Prof. Parul Rishi. Faculty of Human Resource Management,. IIFM, Bhopal. parul@iifm.ac.in. Cell: 9009992144. 9/3/2015. TRANSACTIONAL ANALYSIS . definition. TRANSACTIONAL ANALYSIS (TA). is a method of understanding communication between people;. The Mistakes We Make. “Leadership can be developed. However, it cannot be ‘promoted.’”. -Dan Chase (June 16. th,. 2015). “There go the people. I must follow them, for I am their leader." . Spiegelman. *. , Guy . Golan-. Gueta. †. , and Idit Keidar. †*. *. Technion. . †. Yahoo Research. 1. Agenda. Motivation. Concurrent Data Structure Libraries (CDSLs) vs Transactional Memory. Introducing: Transactional Data Structure Libraries (TDSL). From High-level Haskell to Efficient Low-level Code Geoffrey Mainland Microsoft Research Cambridge Big Techday 6 June 14, 2013 2 RBS 6202 Virtex-7 FPGA Tesla K-20 USRP N200 NetFPGA 10G Intel Xeon Phi