利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

23 条记录 (耗时 0.04 秒)

    Priority Differentiated Subtree Locking
    9.
    发明申请
    Priority Differentiated Subtree Locking 失效
    优先区分子树锁定

    公开(公告)号：US20070150474A1

    公开(公告)日：2007-06-28

    申请号：US11683951

    申请日：2007-03-08

    申请人： Zoltan Szilagyi ,  Matthew Rhoten ,  Philip Su

    发明人： Zoltan Szilagyi ,  Matthew Rhoten ,  Philip Su

    IPC分类号： G06F17/30

    CPC分类号： G06F9/524 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/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.

    摘要翻译： 提供了数据结构的锁定装置，其防止死锁，但是仍然允许不同的线程同时获得用于读取和写入操作的数据结构的不同节点上的锁定。 锁定系统基于优先级层次来区分锁。 如果对这些资源的访问已经受到相同或更高优先级的冲突锁限制，则锁定系统将失败锁定数据结构中的一个或多个资源的请求。 锁定系统还可以使用可抢占的和不可抢占的锁，使得如果具有较低优先级的可抢占锁限制了对资源的访问，则锁定系统将优先考虑较低优先权锁以有利于较高优先级的锁定。 或者，如果具有较低优先级的不可抢占锁限制了对资源的访问，则锁定系统将等待，直到在执行所请求的冲突较高优先级锁之前移除较低优先权锁。 该锁定装置允许高优先级操作，其需要更高的性能和效率来接收对数据结构的优先访问，而不会阻止较低优先级的操作访问数据结构，同时防止不同操作之间的死锁。

    Electronic Inking Process
    10.
    发明申请
    Electronic Inking Process 有权
    电子灌浆工艺

    公开(公告)号：US20060224610A1

    公开(公告)日：2006-10-05

    申请号：US11423030

    申请日：2006-06-08

    申请人： Jamie Wakeam ,  Richard Duncan ,  Herry Sutanto ,  Sashi Raghupathy ,  Timothy Kannapel ,  Zoltan Szilagyi

    发明人： Jamie Wakeam ,  Richard Duncan ,  Herry Sutanto ,  Sashi Raghupathy ,  Timothy Kannapel ,  Zoltan Szilagyi

    IPC分类号： G06F7/00

    CPC分类号： G06K9/00409 ,  G06K9/00463 ,  Y10S707/99931 ,  Y10S707/99938 ,  Y10S707/99939 ,  Y10S707/99942 ,  Y10S707/99952 ,  Y10S707/99953

    摘要： A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

    摘要翻译： 将第一数据结构与作为第一数据结构的随后修改版本的第二数据结构协调的方法。 首先，访问在第二数据结构中对相应节点进行了改变的第一数据结构中的每个节点。 对于每个被访问的节点，确定对第二数据结构中的对应节点所做的改变是否与第一数据结构产生冲突。 如果对第二数据结构中的相应节点所做的改变不会产生与第一数据结构的冲突，则在第一数据结构中对所访问的节点进行改变。