PPT-Abstractions for Relaxed Memory Models

Andrei Dan Yuri Meshman Martin Vechev Eran Yahav 1 Verification under a relaxed memory model P M S 2 Really about P M S P M S Change the program . All Programmable Abstractions push beyond traditional RTL design methodologies to automate all aspects of system development and algorithm deployment into all programmable FPGAs SoC and 3D ICs Xilinx and its Alliance members are working together to Weak Consistency Models. Madan Musuvathi. Research in Software Engineering. Microsoft Research. Hard to program. Hard to test. Hard to debug. General consensus: trade consistency for . Availability. Performance. In this photo the models smile is more reserved and not quite as full blown, this makes him look more attractive for a young boy and also shows that he is well behaved. Again his looking directly into the lens is to show that he is quietly confident and invite the reader in to find out more. His pose is quite relaxed to show the stress free life that children should have at that age. . Matei Zaharia, . Benjamin . Hindman. , Andy . Konwinski. , Ali . Ghodsi. , Anthony Joseph, Randy Katz, Scott . Shenker. , Ion . Stoica. Background. Clusters of commodity servers . have become a . major computing . Macroprogramming. Systems. Presented by: S. M. . Shahriar. . Nirjon. Timothy W.. . Hnat. and . Kamin. Whitehouse. hnat@cs.virginia.edu, WHITEHOUSE@cs.virginia.edu . Motivation. Synchronization Problems. Michael Carbin. Deokhwan. Kim, . Sasa. . Misailovic. , and Martin C. . Rinard. Approximate Computing. Media Processing, Machine Learning, Search. Solution Space: Accuracy versus Cost. Accuracy. Time/. Steven . Pelley. , Peter M. Chen, Thomas F. . Wenisch. University of Michigan. Nonvolatile memory (NVRAM) recovery. 2. Writes unordered!. Constrain persist order for correctness, . but reorder for performance. Rajeev Alur. . University of Pennsylvania. Amir . Pnueli. Memorial Symposium. New York University, May . 2010. Joint work with . . Sebastian Burckhardt . Sela. . Mador-Haim. Milo Martin. Cynthia Lee. CS106X. Topics this week:. Memory and Pointers. Revisit some topics from last week. Deeper look at what a pointer is. Hexadecimal!. Address-of operator: &. Dynamic Memory allocation. Dictionary ADT. : Arrays, Lists and . Trees. Kate Deibel. Summer 2012. June 27, 2012. CSE 332 Data Abstractions, Summer 2012. 1. Where We Are. Studying the absolutely essential ADTs of computer science and classic data structures for implementing them. Disjoint Set Union-Find . and . Minimum Spanning Trees. Kate Deibel. Summer 2012. August 13, 2012. CSE 332 Data Abstractions, Summer 2012. 1. Making Connections. You have a set of nodes (numbered 1-9) on a network. . CSE 332 Data Abstractions: A Heterozygous Forest of AVL, Splay, and B Trees Kate Deibel Summer 2012 July 2, 2012 CSE 332 Data Abstractions, Summer 2012 1 From last time… Binary search trees can give us great performance due to providing a structured binary search. of Concurrent Data Types. Sebastian Burckhardt. Dissertation Defense. University of Pennsylvania. July 30, 2007. Thesis. Our . CheckFence. method / tool . is a valuable aid for designing and implementing concurrent data types.. Dictionary ADT. : Arrays, Lists and . Trees. Kate Deibel. Summer 2012. June 27, 2012. CSE 332 Data Abstractions, Summer 2012. 1. Where We Are. Studying the absolutely essential ADTs of computer science and classic data structures for implementing them.