M
Michael Spear
Researcher at Lehigh University
Publications - 94
Citations - 3073
Michael Spear is an academic researcher from Lehigh University. The author has contributed to research in topics: Transactional memory & Software transactional memory. The author has an hindex of 29, co-authored 93 publications receiving 2986 citations. Previous affiliations of Michael Spear include Microsoft & University of Rochester.
Papers
More filters
Proceedings ArticleDOI
Transactional memory retry mechanisms
TL;DR: This note presents a retry mechanism based on Bloom filters that is entirely orthogonal to TM implementation, compatible with hardware, software, and hybrid TM implementations, and has no impact on memory management or on the cache behavior of shared locations.
Patent
Architectural support for software thread-level speculation
TL;DR: In this article, a thread-level speculation system for thread level speculation includes a memory system for storing a program code, a plurality of registers corresponding to one or more execution contexts, for storing sets of memory addresses that are accessed speculatively, and a multiplicity of processors in communication with the memory system, where a processor of the plurality of processors executes the program code to implement method steps of dividing a program into a number of epochs to be executed in parallel.
Proceedings ArticleDOI
Understanding and Improving Persistent Transactions on Optane™ DC Memory
TL;DR: A large throughput difference is found, which emphasizes the importance of choosing the best durability domain for each application and system, and confirms that recently published persistent transactional memory algorithms are able to scale, and that recent optimizations for these algorithms lead to strong performance.
Proceedings ArticleDOI
Redesigning Go’s Built-In Map to Support Concurrent Operations
TL;DR: The Interlocked Hash Table is the result of language-driven data structure design: it requires minimal changes to the Go map API, supports the full range of operations available on the sequential Go map, and provides a path for the language to evolve to become more amenable to scalable computation over shared data structures.
Book ChapterDOI
A scalable lock-free universal construction with best effort transactional hardware
Francois Carouge,Michael Spear +1 more
TL;DR: This work explores the possibility of using this emerging transactional hardware to implement a scalable, unbounded transactional memory that is simultaneously nonblocking and compatible with strong language-level semantics.