ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1009.0056
  4. Cited By
A Competitive Analysis for Balanced Transactional Memory Workloads

A Competitive Analysis for Balanced Transactional Memory Workloads

31 August 2010
Gokarna Sharma
C. Busch
ArXiv (abs)PDFHTML

Papers citing "A Competitive Analysis for Balanced Transactional Memory Workloads"

1 / 1 papers shown
Fast and Fair Randomized Wait-Free Locks
Fast and Fair Randomized Wait-Free LocksACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021
N. Ben-David
G. Blelloch
FaMLLRM
241
0
0
10 Aug 2021
1
Page 1 of 1