会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Priority differentiated subtree locking
    • 优先级差分子树锁定
    • US07206776B2
    • 2007-04-17
    • US10222953
    • 2002-08-15
    • Zoltan C SzilagyiMatthew Paul RhotenPhilip Ti-Fei Su
    • Zoltan C SzilagyiMatthew Paul RhotenPhilip Ti-Fei Su
    • G06F17/30G06F15/16
    • G06F9/524Y10S707/99933Y10S707/99934Y10S707/99938
    • A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.
    • 提供了数据结构的锁定装置,其防止死锁,但是仍然允许不同的线程同时获得用于读取和写入操作的数据结构的不同节点上的锁定。 如果对这些资源的访问已经受到相同或更高优先级的冲突锁限制,则锁定系统将失败锁定数据结构中的一个或多个资源的请求。 锁定系统还可以使用可抢占的和不可抢占的锁,使得如果具有较低优先级的可抢占锁限制了对资源的访问,则锁定系统将优先考虑较低优先权锁以有利于较高优先级的锁定。 或者,如果具有较低优先级的不可抢占锁限制了对资源的访问,则锁定系统将等待,直到在执行所请求的冲突较高优先级锁之前移除较低优先权锁。
    • 2. 发明授权
    • Priority differentiated subtree locking
    • 优先级差分子树锁定
    • US07653629B2
    • 2010-01-26
    • US11683951
    • 2007-03-08
    • Zoltan C SzilagyiMatthew Paul RhotenPhilip Ti-Fei Su
    • Zoltan C SzilagyiMatthew Paul RhotenPhilip Ti-Fei Su
    • G06F17/30
    • G06F9/524Y10S707/99933Y10S707/99934Y10S707/99938
    • A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system differentiates locks based on a priority hierarchy. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock. This locking arrangement allows high priority operations that require higher performance and efficiency to receive preferential access to a data structure without preventing lower priority operations from accessing the data structure, while preventing deadlocks between different operations.
    • 提供了数据结构的锁定装置,其防止死锁,但是仍然允许不同的线程同时获得用于读取和写入操作的数据结构的不同节点上的锁定。 锁定系统基于优先级层次来区分锁。 如果对这些资源的访问已经受到相同或更高优先级的冲突锁限制,则锁定系统将失败锁定数据结构中的一个或多个资源的请求。 锁定系统还可以使用可抢占的和不可抢占的锁,使得如果具有较低优先级的可抢占锁限制了对资源的访问,则锁定系统将优先考虑较低优先权锁以有利于较高优先级的锁定。 或者,如果具有较低优先级的不可抢占锁限制了对资源的访问,则锁定系统将等待,直到在执行所请求的冲突较高优先级锁之前移除较低优先级的锁。 该锁定装置允许高优先级操作,其需要更高的性能和效率来接收对数据结构的优先访问,而不会阻止较低优先级的操作访问数据结构,同时防止不同操作之间的死锁。