On the public citation graph
A Key-based Adaptive Transactional Memory Executor
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1994.1104openalex-snapshot
Communication Optimizations for Irregular Scientific Computations on Distributed Memory Architectures
inferredcites →https://doi.org/10.1006/jpdc.1996.0107openalex-snapshot
Cilk: An Efficient Multithreaded Runtime System
inferredcites →https://doi.org/10.1007/3-540-40889-4_6openalex-snapshot
A Comparison of Locality Transformations for Irregular Codes
inferredcites →https://doi.org/10.1016/s0020-0190(96)00148-2openalex-snapshot
An efficient algorithm for concurrent priority queue heaps
inferredcites →https://doi.org/10.1023/a:1011119519789openalex-snapshot
Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings
inferredcites →https://doi.org/10.1109/71.273046openalex-snapshot
Using processor affinity in loop scheduling on shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/71.850833openalex-snapshot
Cacheminer: A runtime approach to exploit cache locality on SMP
inferredcites →https://doi.org/10.1109/icpp.2004.13openalex-snapshot
Adaptive data partition for sorting using probability distribution
inferredcites →https://doi.org/10.1109/icpp.2004.1327928openalex-snapshot
Adaptive data partition for sorting using probability distribution
inferredcites →https://doi.org/10.1109/isca.1993.698569openalex-snapshot
Transactional Memory: Architectural Support For Lock-free Data Structures
inferredcites →https://doi.org/10.1109/pgec.1966.264565openalex-snapshot
Analysis of Programs for Parallel Processing
inferredcites →https://doi.org/10.1109/tc.1985.5009388openalex-snapshot
An Adaptive Method for Unknown Distributions in Distributive Partitioned Sorting
inferredcites →https://doi.org/10.1145/1065895.1065899openalex-snapshot
Metrics and models for reordering transformations
inferredcites →https://doi.org/10.1145/1073814.1073861openalex-snapshot
Advanced contention management for dynamic software transactional memory
inferredcites →https://doi.org/10.1145/237090.237151openalex-snapshot
Thread scheduling for cache locality
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/301618.301670openalex-snapshot
Improving cache performance in dynamic applications through data and computation reorganization at run time
inferredcites →https://doi.org/10.1145/305138.305228openalex-snapshot
Improving memory hierarchy performance for irregular applications
inferredcites →https://doi.org/10.1145/512529.512554openalex-snapshot
Dynamic hot data stream prefetching for general-purpose programs
inferredcites →https://doi.org/10.1145/512553.512554openalex-snapshot
Dynamic hot data stream prefetching for general-purpose programs
inferredcites →https://doi.org/10.1145/514191.514227openalex-snapshot
Computation regrouping: restructuring programs for temporal data cache locality
inferredcites →https://doi.org/10.1145/780822.781142openalex-snapshot
Compile-time composition of run-time data and iteration reorderings
inferredcites →https://doi.org/10.1145/781131.781142openalex-snapshot
Compile-time composition of run-time data and iteration reorderings
inferredcites →https://doi.org/10.1145/872035.872048openalex-snapshot
Software transactional memory for dynamic-sized data structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_39openalex-snapshot
Resolving Semantic Conflicts in Word Based Software Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_10openalex-snapshot
Scheduling-Based Contention Management Techniques for Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-92990-1_3openalex-snapshot
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
inferred← citeshttps://doi.org/10.1007/978-3-642-11515-8_5openalex-snapshot
Improving Performance by Reducing Aborts in Hardware Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-24568-8_10openalex-snapshot
Transaction Reordering to Reduce Aborts in Software Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_48openalex-snapshot
Hugh: A Semantically Aware Universal Construction for Transactional Memory Systems
inferred← citeshttps://doi.org/10.1007/s10766-016-0427-4openalex-snapshot
Purge-Rehab: Eager Software Transactional Memory with High Performance Under Contention
inferred← citeshttps://doi.org/10.1007/s11227-012-0854-yopenalex-snapshot
Improving performance of software transactional memory through contention locality
inferred← citeshttps://doi.org/10.1007/s11227-014-1138-5openalex-snapshot
Weighted adaptive concurrency control for software transactional memory
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.12.018openalex-snapshot
A general purpose contention manager for software transactions on the GPU
inferred← citeshttps://doi.org/10.1109/hpca.2011.5749718openalex-snapshot
Bloom Filter Guided Transaction Scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2011.290openalex-snapshot
Speculative Contention Avoidance in Software Transactional Memory
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.66openalex-snapshot
Conflict Avoidance Scheduling Using Grouping List for Transactional Memory
inferred← citeshttps://doi.org/10.1109/ispdc.2015.14openalex-snapshot
Cache Affinity Optimization Techniques for Scaling Software Transactional Memory Systems on Multi-CMP Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2018.2877656openalex-snapshot
Applying Transactional Memory for Concurrency-Bug Failure Recovery in Production Runs
inferred← citeshttps://doi.org/10.1145/1378533.1378562openalex-snapshot
Automatic data partitioning in software transactional memories
inferred← citeshttps://doi.org/10.1145/1378533.1378564openalex-snapshot
Adaptive transaction scheduling for transactional memory systems
inferred← citeshttps://doi.org/10.1145/1669112.1669133openalex-snapshot
Proactive transaction scheduling for contention management
inferred← citeshttps://doi.org/10.1145/2578903.2579141openalex-snapshot
Parallelizing irregular algorithms
inferred← citeshttps://doi.org/10.1145/2636805.2636823openalex-snapshot
Distributed computing column 54 transactional memory: models and algorithms
inferred← citeshttps://doi.org/10.2200/s00093ed1v01y200707cac003openalex-snapshot
Chip Multiprocessor Architecture: Techniques to Improve Throughput and Latency
inferred← citeshttps://doi.org/10.2200/s00272ed1v01y201006cac011openalex-snapshot
Transactional Memory, 2nd edition
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1909openalex-snapshot
Scheduling in Transactional Memory Systems: Models, Algorithms, and Evaluations
inferred← citeshttps://doi.org/10.5445/ir/1000035636openalex-snapshot
Performance Optimization Strategies for Transactional Memory Applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.