default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael F. Spear
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c61]Ravil Galiev
, Michael F. Spear, Vitaly Aksenov:
The Next 700 Benchmarking Frameworks for Concurrent Data Structures. ApPLIED@PODC 2024: 1-9- 2023
- [c60]Yaodong Sheng, Ahmed Hassan, Michael F. Spear:
Separating Mechanism from Policy in STM. PACT 2023: 279-296 - [c59]Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear:
Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. DISC 2023: 35:1-35:7 - 2022
- [e1]Jaejin Lee, Kunal Agrawal, Michael F. Spear:
PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2 - 6, 2022. ACM 2022, ISBN 978-1-4503-9204-4 [contents] - 2021
- [j7]Abhishek Singh, Shail Dave, Pantea Zardoshti, Robert Brotzman, Chao Zhang, Xiaochen Guo, Aviral Shrivastava, Gang Tan, Michael F. Spear:
SPX64: A Scratchpad Memory for General-purpose Microprocessors. ACM Trans. Archit. Code Optim. 18(1): 14:1-14:26 (2021) - [c58]Matthew Rodriguez, Ahmed Hassan, Michael F. Spear:
Exploiting Locality in Scalable Ordered Maps. ICDCS 2021: 998-1008 - [c57]Yaodong Sheng, Ahmed Hassan, Michael F. Spear:
Semantic Conflict Detection for Transactional Data Structure Libraries. SPAA 2021: 446-448 - 2020
- [c56]Matthew Rodriguez, Ahmed Hassan, Michael F. Spear:
Exploiting Locality in Scalable Ordered Maps. PACT 2020: 351-352 - [c55]Matthew Rodriguez, Michael F. Spear:
Optimizing Linearizable Bulk Operations on Data Structures. ICPP 2020: 24:1-24:10 - [c54]Pantea Zardoshti, Michael F. Spear, Aida Vosoughi, Garret Swart:
Understanding and Improving Persistent Transactions on Optane™ DC Memory. IPDPS 2020: 348-357 - [c53]Matthew Rodriguez, Michael F. Spear:
Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model. PODC 2020: 224-226
2010 – 2019
- 2019
- [j6]Pantea Zardoshti, Tingzhe Zhou, Pavithra Balaji, Michael L. Scott, Michael F. Spear:
Simplifying Transactional Memory Support in C++. ACM Trans. Archit. Code Optim. 16(3): 25:1-25:24 (2019) - [c52]Pantea Zardoshti, Tingzhe Zhou, Yujie Liu, Michael F. Spear:
Optimizing Persistent Memory Transactions. PACT 2019: 219-231 - [c51]Tingzhe Zhou, Maged M. Michael, Michael F. Spear:
A Practical, Scalable, Relaxed Priority Queue. ICPP 2019: 57:1-57:10 - [c50]Tingzhe Zhou, Pantea Zardoshti, Michael F. Spear:
Optimizing Persistent Transactions (Brief Announcement). SPAA 2019: 169-170 - 2018
- [j5]Kunal Agrawal, I-Ting Angelina Lee, Michael F. Spear:
Introduction to Special Issue on SPAA'15. ACM Trans. Parallel Comput. 4(4): 16:1-16:2 (2018) - [c49]Henry Daly, Ahmed Hassan, Michael F. Spear, Roberto Palmieri:
NUMASK: High Performance Scalable Skip List for NUMA. DISC 2018: 18:1-18:19 - 2017
- [c48]Louis Jenkins, Tingzhe Zhou, Michael F. Spear:
Redesigning Go's Built-In Map to Support Concurrent Operations. PACT 2017: 14-26 - [c47]Tingzhe Zhou, Pantea Zardoshti, Michael F. Spear:
Practical Experience with Transactional Lock Elision. ICPP 2017: 81-90 - [c46]Christopher Garman, Xiaochen Guo, Michael F. Spear:
A study of unnecessary write backs. MEMSYS 2017: 127-129 - [c45]Tingzhe Zhou, Victor Luchangco, Michael F. Spear:
Extending Transactional Memory with Atomic Deferral. OPODIS 2017: 7:1-7:17 - [c44]Tingzhe Zhou, Victor Luchangco, Michael F. Spear:
Hand-Over-Hand Transactions with Precise Memory Reclamation. SPAA 2017: 255-264 - [c43]Tingzhe Zhou, Victor Luchangco, Michael F. Spear:
Brief Announcement: Extending Transactional Memory with Atomic Deferral. SPAA 2017: 371-373 - 2016
- [c42]Chao Wang, Michael F. Spear:
Practical condition synchronization for transactional memory. EuroSys 2016: 32:1-32:16 - [c41]Xiaochen Guo, Aviral Shrivastava, Michael F. Spear, Gang Tan:
Languages Must Expose Memory Heterogeneity. MEMSYS 2016: 251-256 - [c40]Adam Schaub, Michael F. Spear:
Towards migrating computation to distributed memory caches. DCC@PODC 2016: 10:1-10:6 - 2015
- [c39]Yujie Liu, Justin Gottschlich, Gilles Pokam, Michael F. Spear:
TSXProf: Profiling Hardware Transactions. PACT 2015: 75-86 - [c38]Yujie Liu, Tingzhe Zhou, Michael F. Spear:
Transactional Acceleration of Concurrent Data Structures. SPAA 2015: 244-253 - [c37]Wenjia Ruan, Michael F. Spear:
Hybrid Transactional Memory Revisited. DISC 2015: 215-231 - [p1]Michael F. Spear, Wenjia Ruan, Yujie Liu, Trilok Vyas:
Case Study: Using Transactions in Memcached. Transactional Memory 2015: 449-467 - 2014
- [j4]Wenjia Ruan, Yujie Liu, Michael F. Spear:
Transactional Read-Modify-Write Without Aborts. ACM Trans. Archit. Code Optim. 11(4): 63:1-63:24 (2014) - [c36]Wenjia Ruan, Trilok Vyas, Yujie Liu, Michael F. Spear:
Transactionalizing legacy code: an experience report using GCC and Memcached. ASPLOS 2014: 399-412 - [c35]Yujie Liu, Kunlong Zhang, Michael F. Spear:
Dynamic-sized nonblocking hash tables. PODC 2014: 242-251 - [c34]Sambhawa Priya, Yuanbo Guo, Michael F. Spear, Jeff Heflin:
Partitioning OWL Knowledge Bases for Parallel Reasoning. ICSC 2014: 108-115 - [c33]Chao Wang, Yujie Liu, Michael F. Spear:
Transaction-friendly condition variables. SPAA 2014: 198-207 - 2013
- [j3]Wenjia Ruan, Yujie Liu, Michael F. Spear:
Boosting timestamp-based transactional memory by exploiting hardware cycle counters. ACM Trans. Archit. Code Optim. 10(4): 40:1-40:21 (2013) - [c32]Wenjia Ruan, Yujie Liu, Chao Wang, Michael F. Spear:
On the platform specificity of STM instrumentation mechanisms. CGO 2013: 8:1-8:10 - [c31]Yujie Liu, Victor Luchangco, Michael F. Spear:
Mindicators: A Scalable Approach to Quiescence. ICDCS 2013: 206-215 - [c30]Jennifer Bayzick, Bradley Askins, Sharon Kalafut, Michael F. Spear:
Reading mobile games throughout the curriculum. SIGCSE 2013: 209-214 - [c29]Stephan Diestelhorst, Martin Nowack, Michael F. Spear, Christof Fetzer:
Brief announcement: between all and nothing - versatile aborts in hardware transactional memory. SPAA 2013: 108-110 - [c28]Kunlong Zhang, Yujiao Zhao, Yajun Yang, Yujie Liu, Michael F. Spear:
Practical Non-blocking Unordered Lists. DISC 2013: 239-253 - 2012
- [j2]Qingping Wang, Sameer Kulkarni, John Cavazos, Michael F. Spear:
A transactional memory with automatic performance tuning. ACM Trans. Archit. Code Optim. 8(4): 54:1-54:23 (2012) - [c27]Yujie Liu, Michael F. Spear:
Mounds: Array-Based Concurrent Priority Queues. ICPP 2012: 1-10 - [c26]Yujie Liu, Michael F. Spear:
A lock-free, array-based priority queue. PPoPP 2012: 323-324 - [c25]Yujie Liu, Stephan Diestelhorst, Michael F. Spear:
Delegation and nesting in best-effort hardware transactional memory. SPAA 2012: 38-47 - 2011
- [c24]Luke Dalessandro, François Carouge, Sean White, Yossi Lev, Mark Moir, Michael L. Scott, Michael F. Spear:
Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory. ASPLOS 2011: 39-52 - [c23]Yujie Liu, Michael F. Spear:
A nonblocking set optimized for querying the minimum value. PODC 2011: 345-346 - 2010
- [c22]Luke Dalessandro, David Dice, Michael L. Scott, Nir Shavit, Michael F. Spear:
Transactional Mutex Locks. Euro-Par (2) 2010: 2-13 - [c21]Luke Dalessandro, Michael F. Spear, Michael L. Scott:
NOrec: streamlining STM by abolishing ownership records. PPoPP 2010: 67-78 - [c20]Michael F. Spear:
Lightweight, robust adaptivity for software transactional memory. SPAA 2010: 273-283 - [c19]Luke Dalessandro, Michael L. Scott, Michael F. Spear:
Transactions as the Foundation of a Memory Consistency Model. DISC 2010: 20-34 - [c18]François Carouge, Michael F. Spear:
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware. DISC 2010: 50-63
2000 – 2009
- 2009
- [j1]Peng Wu, Maged M. Michael, Christoph von Praun, Takuya Nakaike, Rajesh Bordawekar, Harold W. Cain, Calin Cascaval, Siddhartha Chatterjee, Stefanie Chiras, Rui Hou, Mark F. Mergen, Xiaowei Shen, Michael F. Spear, Huayong Wang, Kun Wang:
Compiler and runtime techniques for software transactional memory optimization. Concurr. Comput. Pract. Exp. 21(1): 7-23 (2009) - [c17]Michael F. Spear, Maged M. Michael, Michael L. Scott, Peng Wu:
Reducing Memory Ordering Overheads in Software Transactional Memory. CGO 2009: 13-24 - [c16]Michael F. Spear, Kirk Kelsey, Tongxin Bai, Luke Dalessandro, Michael L. Scott, Chen Ding, Peng Wu:
Fastpath Speculative Parallelization. LCPC 2009: 338-352 - [c15]Michael F. Spear, Luke Dalessandro, Virendra J. Marathe, Michael L. Scott:
A comprehensive strategy for contention management in software transactional memory. PPoPP 2009: 141-150 - 2008
- [c14]Michael F. Spear, Michael Silverman, Luke Dalessandro, Maged M. Michael, Michael L. Scott:
Implementing and Exploiting Inevitability in Software Transactional Memory. ICPP 2008: 59-66 - [c13]Virendra J. Marathe, Michael F. Spear, Michael L. Scott:
Scalable Techniques for Transparent Privatization in Software Transactional Memory. ICPP 2008: 67-74 - [c12]Michael F. Spear, Luke Dalessandro, Virendra J. Marathe, Michael L. Scott:
Ordering-Based Semantics for Software Transactional Memory. OPODIS 2008: 275-294 - [c11]Michael F. Spear, Andrew Sveikauskas, Michael L. Scott:
Transactional memory retry mechanisms. PODC 2008: 453 - [c10]Michael F. Spear, Maged M. Michael, Christoph von Praun:
RingSTM: scalable transactions with a single atomic instruction. SPAA 2008: 275-284 - 2007
- [c9]Michael L. Scott, Michael F. Spear, Luke Dalessandro, Virendra J. Marathe:
Delaunay Triangulation with Transactions and Barriers. IISWC 2007: 107-113 - [c8]Arrvindh Shriraman, Michael F. Spear, Hemayet Hossain, Virendra J. Marathe, Sandhya Dwarkadas, Michael L. Scott:
An integrated hardware-software approach to flexible transactional memory. ISCA 2007: 104-115 - [c7]Michael L. Scott, Michael F. Spear, Luke Dalessandro, Virendra J. Marathe:
Transactions and privatization in Delaunay triangulation. PODC 2007: 336-337 - [c6]Michael F. Spear, Virendra J. Marathe, Luke Dalessandro, Michael L. Scott:
Privatization techniques for software transactional memory. PODC 2007: 338-339 - [c5]Michael F. Spear, Arrvindh Shriraman, Hemayet Hossain, Sandhya Dwarkadas, Michael L. Scott:
Alert-on-update: a communication aid for shared memory multiprocessors. PPoPP 2007: 132-133 - [c4]Michael F. Spear, Arrvindh Shriraman, Luke Dalessandro, Sandhya Dwarkadas, Michael L. Scott:
Nonblocking transactions without indirection using alert-on-update. SPAA 2007: 210-220 - [c3]Virendra J. Marathe, Michael F. Spear, Michael L. Scott:
Transaction Safe Nonblocking Data Structures. DISC 2007: 488-489 - 2006
- [c2]Michael F. Spear, Tom Roeder, Orion Hodson, Galen C. Hunt, Steven Levi:
Solving the starting problem: device drivers as self-describing artifacts. EuroSys 2006: 45-57 - [c1]Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
Conflict Detection and Validation Strategies for Software Transactional Memory. DISC 2006: 179-193
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
