Improving the Performance Competitive Ratios of Transactional Memory Contention Managers Gokarna Sharma Costas Busch Louisiana State University, USA WTTM.

Slides:



Advertisements
Similar presentations
演 算 法 實 驗 室演 算 法 實 驗 室 On the Minimum Node and Edge Searching Spanning Tree Problems Sheng-Lung Peng Department of Computer Science and Information Engineering.
Advertisements

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Distributed Transactional Memory for General Networks Gokarna Sharma Costas Busch Srivathsan Srinivasagopalan Louisiana State University May 24, 2012.
Online Scheduling with Known Arrival Times Nicholas G Hall (Ohio State University) Marc E Posner (Ohio State University) Chris N Potts (University of Southampton)
Inherent limitations on DAP TMs 1 Inherent Limitations on Disjoint-Access Parallel Transactional Memory Hagit Attiya, Eshcar Hillel, Alessia Milani Technion.
Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Competitive Analysis.
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem Alessia Milani [Attiya et al. PODC 06] [Attiya and Milani OPODIS 09]
1 Database Replication Using Generalized Snapshot Isolation Sameh Elnikety, EPFL Fernando Pedone, USI Willy Zwaenepoel, EPFL.
Randomized Algorithms Randomized Algorithms CS648 Lecture 8 Tools for bounding deviation of a random variable Markov’s Inequality Chernoff Bound Lecture.
Bounds for Overlapping Interval Join on MapReduce Foto N. Afrati 1, Shlomi Dolev 2, Shantanu Sharma 2, and Jeffrey D. Ullman 3 1 National Technical University.
Reasoning and Identifying Relevant Matches for XML Keyword Search Yi Chen Ziyang Liu, Yi Chen Arizona State University.
Numbers
Courtesy Costas Busch - RPI1 More Applications of the Pumping Lemma.
Fall 2005Costas Busch - RPI1 CSCI-2400 Models of Computation.
Online Algorithms Motivation and Definitions Paging Problem Competitive Analysis Online Load Balancing.
Self-tuning Reactive Distributed Trees for Counting and Balancing Phuong Hoai Ha Marina Papatriantafilou Philippas Tsigas OPODIS ’04, Grenoble, France.
The Cost of Privatization Hagit Attiya Eshcar Hillel Technion & EPFLTechnion.
1 Scalable Transactional Memory Scheduling Gokarna Sharma (A joint work with Costas Busch) Louisiana State University.
Fall 2006Costas Busch - RPI1 More Applications of the Pumping Lemma.
Costas Busch - RPI1 CSCI-2400 Models of Computation.
1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)
Fall 2006Costas Busch - RPI1 CSCI-2400 Models of Computation.
Minimizing Cache Usage in Paging Alejandro Salinger University of Waterloo Joint work with Alex López-Ortiz.
Some Notes on the Binary GV Bound for Linear Codes Sixth International Workshop on Optimal Codes and Related Topics June , 2009, Varna, BULGARIA.
An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università.
International Graduate School of Dynamic Intelligent Systems, University of Paderborn Improved Algorithms for Dynamic Page Migration Marcin Bieńkowski.
1 Scalable and transparent parallelization of multiplayer games Bogdan Simion MASc thesis Department of Electrical and Computer Engineering.
Window-Based Greedy Contention Management for Transactional Memory Gokarna Sharma (LSU) Brett Estrade (Univ. of Houston) Costas Busch (LSU) 1DISC 2010.
Dynamic Resource Monitoring and Allocation in a virtualized environment.
Minimizing Cache Usage in Paging Alejandro López-Ortiz, Alejandro Salinger University of Waterloo.
1 Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer Distributed Computing Group LEA.
Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks Costas Busch (RPI) Srikanth Surapaneni (RPI) Srikanta Tirthapura (Iowa State University)
“Differential Information and Performance Measurement Using a Security Market Line” by Philip H. Dybvig and Stephen A. Ross Presented by Jane Zhao.
On the Performance of Window-Based Contention Managers for Transactional Memory Gokarna Sharma and Costas Busch Louisiana State University.
Technology from seed Exploiting Off-the-Shelf Virtual Memory Mechanisms to Boost Software Transactional Memory Amin Mohtasham, Paulo Ferreira and João.
A Multiversion Update-Serializable Protocol for Genuine Partial Data Replication Sebastiano Peluso, Pedro Ruivo, Paolo Romano, Francesco Quaglia and Luís.
Bounds Bingo!. Pick any 9 of these numbers
Tight Bounds for Online Vector Bin Packing Ilan Cohen Joint work with : Yossi Azar,Bruce Shepherd, Seny Kamara.
PREWRITE: STEP 1: Graphic Organizer Describes who the person is Personality Characteristics.
NB-FEB: A Universal Scalable Easy- to-Use Synchronization Primitive for Manycore Architectures Phuong H. Ha (Univ. of Tromsø, Norway) Philippas Tsigas.
CSE 6410 Advanced Algorithmic Graph Theory s = 1 t = 16 V 8 V 7 V 6 V 5 V 4 V 3 V 2 V 1 n u 1 u 2 u
Window-Based Greedy Contention Management for Transactional Memory Gokarna Sharma (LSU) Brett Estrade (Univ. of Houston) Costas Busch (LSU) DISC
10-1 人生与责任 淮安工业园区实验学校 连芳芳 “ 自我介绍 ” “ 自我介绍 ” 儿童时期的我.
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem Hagit Attiya, Alessia Milani Technion, Haifa-LABRI, University of Bordeaux.
Gargamel: A Conflict-Aware Contention Resolution Policy for STM Pierpaolo Cincilla, Marc Shapiro, Sébastien Monnet.
On the analysis of indexing schemes
Online parameter optimization for elastic data stream processing
مباحث ویژه مدیریت دولتی
Yahoo Mail Customer Support Number
Most Effective Techniques to Park your Manual Transmission Car
How do Power Car Windows Ensure Occupants Safety
ARGENTINE RADIATION PROTECTION SOCIETY (SAR)
التخطيط لاستراتيجيات و أنشطة اللغة العربية
Sustainable employability in the Dutch taxi market
CSCI-2400 Models of Computation Costas Busch - RPI.
Gokarna Sharma Costas Busch Louisiana State University, USA
Author’s name(s) , Company Name
THANK YOU!.
The Off-Line Machine Input File read-only (once) Input string
Thank you.
Thank you.
Topic of the final thesis
More Applications of the Pumping Lemma
Topic of the diploma thesis
Bounds Bingo!.
Presenter’s Name (if case)
Algorithms CSCI 235, Spring 2019 Lecture 8 Recurrences III
Data-Dependent Approximation
Presentation transcript:

Improving the Performance Competitive Ratios of Transactional Memory Contention Managers Gokarna Sharma Costas Busch Louisiana State University, USA WTTM nd Workshop on the Theory of Transactional Memory1

STM Systems 2WTTM nd Workshop on the Theory of Transactional Memory

Related Work 3WTTM nd Workshop on the Theory of Transactional Memory

Our Contributions 4WTTM nd Workshop on the Theory of Transactional Memory

Roadmap Balanced workloads CM algorithms and proof intuitions Lower bound and proof intuition 5WTTM nd Workshop on the Theory of Transactional Memory

Balanced Workloads 6WTTM nd Workshop on the Theory of Transactional Memory

Algorithms 7WTTM nd Workshop on the Theory of Transactional Memory

Proof Intuition (1/2) 8WTTM nd Workshop on the Theory of Transactional Memory

Proof Intuition (2/2) 9WTTM nd Workshop on the Theory of Transactional Memory

Lower Bound (1/2) 10WTTM nd Workshop on the Theory of Transactional Memory

Lower Bound (2/2) 11WTTM nd Workshop on the Theory of Transactional Memory

Conclusions 12WTTM nd Workshop on the Theory of Transactional Memory

[Full paper to appear in OPODIS 2010] arXiv version: Thank You!!! 13WTTM nd Workshop on the Theory of Transactional Memory