Somerville, Massachusetts
United States
31
2012-11-01
The entities that hold a legal rights for patent applications filed by inventor Moir Mark S.:
Mark S. Moir from Somerville, US has applied for patents for these inventions. The list has both pending applications and granted patents:
Efficient non-blocking K-compare-single-swap operation
#2 | 2012-08-14Obstruction-free synchronization for shared data structures
#3 | 2011-12-06Using transactional memory with early release to implement non-blocking dynamic-sized data structure
#4 | 2011-07-07Value recycling facility for multithreaded computations
#5 | 2011-06-09Software transactional memory for dynamically sizable shared data structures
#6 | 2011-03-15Value recycling facility for multithreaded computations
#7 | 2010-10-12Quickly reacquirable locks
#8 | 2010-04-20Technique to allow a first transaction to wait on condition that affects its working set
#9 | 2010-03-23Obstruction-free mechanism for atomic update of multiple non-contiguous locations in shared memory
#10 | 2008-09-09Shared synchronized skip-list data structure and technique employing linearizable operations
#11 | 2008-07-01Hybrid software/hardware transactional memory
#12 | 2008-07-01Space- and time-adaptive nonblocking algorithms
#13 | 2008-05-08Efficient non-blocking K-compare-single-swap operation
#14 | 2008-04-24Software transactional memory for dynamically sizable shared data structures
#15 | 2008-03-27Method and apparatus for emulating linked-load/store-conditional synchronization
#16 | 2008-03-27Efficient non-blocking K-compare-single-swap operation
#17 | 2008-02-07Efficient non-blocking k-compare-single-swap operation
#18 | 2008-02-05Software transactional memory for dynamically sizable shared data structures
#19 | 2007-11-20Single-word lock-free reference counting
#20 | 2007-11-06Efficient non-blocking k-compare-single-swap operation
#21 | 2007-08-07Lock-free implementation of dynamic-sized shared data structure
#22 | 2007-07-26Non-blocking growable arrays
#23 | 2007-06-28Method and apparatus for improving transactional memory interactions by tracking object visibility
#24 | 2007-04-17Method and apparatus for releasing memory locations during transactional execution
#25 | 2007-03-20Non-blocking memory management mechanism for supporting dynamic-sized data structures
#26 | 2007-01-30Non-blocking growable arrays
#27 | 2006-09-07Selectively unmarking load-marked cache lines during transactional program execution
#28 | 2006-08-08Selectively unmarking load-marked cache lines during transactional program execution
#29 | 2006-07-20Concurrency technique for shared objects
#30 | 2006-03-21Concurrent shared object implemented using a linked-list with amortized node allocation
#31 | 2006-01-31Lock free reference counting
3287975 ⎘