PPT-Window-Based Greedy Contention Management for Transactional Memory

Gokarna Sharma LSU Brett Estrade Univ of Houston Costas Busch LSU 1 DISC 2010 24th International Symposium on Distributed Computing Transactional Memory Background The emergence of multicore architectures. Avg Access Time 2 Tokens Number of Controllers Average Access Time clock cyles brPage 16br Number of Tokens vs Avg Access Time 9 Controllers Number of Tokens Average Access Time clock cycles brPage 17br brPage 18br Yoshua. . Bengio. , Pascal . Lamblin. , Dan . Popovici. , Hugo . Larochelle. NIPS 2007. Presented by . Ahmed . Hefny. Story so far …. Deep neural nets are more expressive: Can learn wider classes of functions with less . CIS 606. Spring 2010. Greedy Algorithms. Similar to dynamic programming.. Used for optimization problems.. Idea. When we have a choice to make, make the one that looks best . right now. . Make . a locally . Yuli. Ye . Joint work with Allan Borodin, University of Toronto. Why do we study greedy algorithms? . don’t. A quote from Jeff Erickson’s algorithms book. . Everyone should tattoo the following sentence on the back of their hands, right under all the rules about logarithms and big-Oh notation. Hamed Pirsiavash, Deva . Ramanan. , . Charless. . Fowlkes. Department of Computer Science, UC Irvine. 2. Estimate number of tracks and their extent. Do not initialize manually. Estimate birth and death of each track. 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. Patrick Santos (4465359). 1. Agenda. What is transactional memory (TM)?. Example transactions. Deadlocks and Cache Coherence. Types of TM. Implementations . & proposals . in industry. Sun / Oracle. Gokarna Sharma. (A joint work with . Costas Busch. ). Louisiana State University. Agenda. Introduction and Motivation. Scheduling Bounds in Different Software Transactional Memory Implementations. Tightly-Coupled Shared Memory Systems. Questions to consider. What is the central message the author is trying to convey to his/her audience?. What is the main point the author is trying to convince me of?. 1. Look at the title.. What is the message it is conveying?. The two key components. Optimal Sub-structure. You solve the problem by solving a sub-problem optimally. Greedy Property. Using the choice that seems best at the moment leads to the optimal result. This is tougher to show!. 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. 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). Fall 20151 Week . 7. CSCI-141. Scott C. Johnson. Say we go to the bank to cash our paycheck. We ask the teller for the fewest bills and coins as possible. Moments later the teller gives us our money and we leave.