NDLI: Seer: Probabilistic Scheduling for Hardware Transactional Memory

Please wait, while we are loading the content...

Sorting with Asymmetric Read and Write Costs

Matrix Multiplication I/O-Complexity by Path Routing

Myths and Misconceptions about Threads

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond

The Cilkprof Scalability Profiler

Speed Scaling in the Non-clairvoyant Model

The Revolution in Graph Theoretic Optimization Problems

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Seer: Probabilistic Scheduling for Hardware Transactional Memory

Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff

Communication-Efficient Computation on Distributed Noisy Datasets

Practical Massively Parallel Sorting

Online Caching with Convex Costs: Extended Abstract

Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees

Race Detection in Two Dimensions

Cost-Oblivious Reallocation for Scheduling and Planning

Improved Parallel Algorithms for Spanners and Hopsets

Conflict Reduction in Hardware Transactions Using Advisory Locks

Distributed Backup Placement in Networks

Parallel Computation of Persistent Homology using the Blowup Complex

A Top-Down Parallel Semisort

Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths

Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time

Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints

Transactional Acceleration of Concurrent Data Structures

Better Deterministic Online Packet Routing on Grids

Self-Stabilizing Repeated Balls-into-Bins

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering

ThreadScan: Automatic and Scalable Memory Reclamation

Scheduling Non-Unit Jobs to Minimize Calibrations

Branch-Avoiding Graph Algorithms

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks

Randomized Local Network Computing

Brief Announcement: Fair Adaptive Parallelism for Concurrent Transactional Memory Applications

Scheduling in Bandwidth Constrained Tree Networks

Electing a Leader in Wireless Networks Quickly Despite Jamming

Brief Announcement: Managing Resource Limitation of Best-Effort HTM

Brief Announcement: On Scheduling Best-Effort HTM Transactions

Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues

Brief Announcement: A Compiler-Runtime Application Binary Interface for Pipe-While Loops

Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication

Seer: Probabilistic Scheduling for Hardware Transactional Memory

Content Provider	ACM Digital Library
Author	Romano, Paolo Diegues, Nuno Garbatov, Stoyan
Abstract	Scheduling concurrent transactions to minimize contention is a well known technique in the Transactional Memory (TM) literature, which was largely investigated in the context of software TMs. However, the recent advent of Hardware Transactional Memory (HTM), and its inherently restricted nature, pose new technical challenges that prevent the adoption of existing schedulers: unlike software implementations of TM, existing HTMs provide no information on which data item or contending transaction caused abort. We propose Seer, a scheduler that addresses precisely this restriction of HTM by leveraging on an on-line probabilistic inference technique that identifies the most likely conflict relations, and establishes a dynamic locking scheme to serialize transactions in a fine-grained manner. Our evaluation shows that Seer improves the performance of the Intel TSX HTM by up to 2.5x, and by 62% on average, in TM benchmarks with 8 threads. These performance gains are not only a consequence of the reduced aborts, but also of the reduced activation of the HTM's pessimistic fall-back path.
Starting Page	224
Ending Page	233
Page Count	10
File Format	PDF
ISBN	9781450335881
DOI	10.1145/2755573.2755578
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-06-13
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Best-effort Scheduling Hardware transactional memory
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Brief Announcement: On Scheduling Best-Effort HTM Transactions

Transactional event profiling in a best-effort hardware transactional memory system

M.P.: Sane semantics of best-effort hardware transactional memory. In

Delegation and nesting in best-effort hardware transactional memory

Split hardware transactions: true nesting of transactions using best-effort hardware transactional memory

Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory

Serialization Management for Best-Effort Hardware Transactional Memory

Split hardware transactions: true nesting of transactions using best-effort hardware transactional memory (2008)

Hybrid Transactional Memory (2005)

Seer: Probabilistic Scheduling for Hardware Transactional Memory

Similar Documents

Brief Announcement: On Scheduling Best-Effort HTM Transactions

Transactional event profiling in a best-effort hardware transactional memory system

M.P.: Sane semantics of best-effort hardware transactional memory. In

Delegation and nesting in best-effort hardware transactional memory

Split hardware transactions: true nesting of transactions using best-effort hardware transactional memory

Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory

Serialization Management for Best-Effort Hardware Transactional Memory

Split hardware transactions: true nesting of transactions using best-effort hardware transactional memory (2008)

Hybrid Transactional Memory (2005)

Seer: Probabilistic Scheduling for Hardware Transactional Memory