Learn more

MCKENNEY PAUL E

Overview
  • Total Patents
    34
About

MCKENNEY PAUL E has a total of 34 patent applications. Its first patent ever was published in 2004. It filed its patents most often in United States. Its main competitors in its focus markets computer technology, environmental technology and audio-visual technology are MIGOS CHARLES J, MORRISON GERALD and MUV INTERACTIVE LTD.

Patent filings in countries

World map showing MCKENNEY PAUL Es patent filings in countries
# Country Total Patents
#1 United States 34

Patent filings per year

Chart showing MCKENNEY PAUL Es patent filings per year from 1900 to 2020

Top inventors

# Name Total Patents
#1 Mckenney Paul E 34
#2 Triplett Joshua A 6
#3 Krieger Orran Y 3
#4 Kegel Andrew G 2
#5 Michael Maged M 2
#6 Landsberg Paul J 2
#7 Ward James P 2
#8 Sarma Dipankar 2
#9 Satran Julian 2
#10 Asselin Albert A 1

Latest patents

Publication Filing date Title
US2014006820A1 Energy efficient implementation of read-copy update for light workloads running on systems with many processors
US2013311995A1 Resolving RCU-scheduler deadlocks
US2013152095A1 Expedited module unloading for kernel modules that execute read-copy update callback processing code
US2013151488A1 Optimized resizing for RCU-protected hash tables
US2013151489A1 Optimized deletion and insertion for high-performance resizable RCU-protected hash tables
US2013138896A1 Reader-writer synchronization with high-performance readers and low-latency writers
US2013061071A1 Energy Efficient Implementation Of Read-Copy Update For Light Workloads Running On Systems With Many Processors
US2012331237A1 Asynchronous grace-period primitives for user-space applications
US2012324473A1 Effective management of blocked-tasks in preemptible read-copy update
US2012324170A1 Read-copy update implementation for non-cache-coherent systems
US2012079301A1 Making read-copy update free-running grace period counters safe against lengthy low power state sojourns
US2011283082A1 Scalable, concurrent resizing of hash tables
US2011137962A1 Applying limited-size hardware transactional memory to arbitrarily large data structure
US2011055630A1 Safely rolling back transactions in a transactional memory system with concurrent readers
US2011055183A1 High performance real-time read-copy update
US2009138896A1 Providing a computing system with real-time capabilities
US2009077080A1 Fast path for grace-period detection for read-copy update system
US2009006403A1 Efficiently boosting priority of read-copy update readers while resolving races with exiting and unlocking processes
US2007271468A1 Method and Apparatus for Maintaining Data Integrity When Switching Between Different Data Protection Methods
US2006265373A1 Hybrid multi-threaded access to data structures using hazard pointers for reads and locks for updates