会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for serializing access to a shared resource in an information handling system
    • 用于在信息处理系统中对共享资源进行序列化的方法和装置
    • US06330612B1
    • 2001-12-11
    • US09141900
    • 1998-08-28
    • Mark A. BooniePeter G. SuttonWendell W. WilkinsonPhil Chi-Chung Yeh
    • Mark A. BooniePeter G. SuttonWendell W. WilkinsonPhil Chi-Chung Yeh
    • G06F1300
    • G06F9/52
    • A method and apparatus for serializing access by n entities to a shared resource in an information handling system. A waiter list is defined as a circular list of n bits, each of which is assigned to an entity. When a bit is false (0) it indicates that the corresponding entity is not waiting for the lock; when the bit is true (1) it indicates the corresponding entity is waiting for the lock. A next waiter indicator (NWI) is also defined that contains a value from 0 to n inclusive; a value of 0 indicates that there are currently no waiters, while a value from 1 to n indicates the next waiter to whom the lock will be granted. The waiter list is initialized to zeros to indicate there are no waiters. When an entity requests a lock that cannot be granted, the entity is made a waiter by setting the corresponding bit in the waiter list to one. If the next waiter indicator is zero, indicating that there were previously no waiters for the lock, the indicator is set to identify the requesting entity as the next waiter. When a lock is released and there is a next waiter for the lock as indicated by the next waiter indicator, that waiter is made a lock holder and the corresponding bit in the waiter list is reset to indicate that the entity is no longer a waiter for the lock. A new next waiter is then found by scanning the waiter list beginning with the entry following that for the entity granted access to the resource. This ensures that once a waiter releases a lock, the waiter is not selected to receive the lock again until all other waiters have received the lock.
    • 一种用于将n个实体的访问序列化到信息处理系统中的共享资源的方法和装置。 服务员列表被定义为n位的循环列表,其中每个被分配给一个实体。 当一个位为false(0)时,表示相应的实体不在等待锁定; 当该位为真时(1)表示相应的实体正在等待锁定。 还定义了下一个服务员指示符(NWI),其中包含0到n的值; 值0表示当前没有服务员,而从1到n的值表示将被授予锁的下一个服务员。 服务员列表初始化为零,表示没有服务员。 当实体请求不能授予的锁时,通过将服务员列表中的相应位设置为1来将实体设为服务员。 如果下一个服务员指示符为零,表示以前没有服务员进行锁定,则指示符将被设置为将请求实体标识为下一个服务员。 当锁定被释放并且下一个服务员如下一个服务员指示符所指示的那个服务员时,该服务员被制成一个锁持有者,并且服务员列表中的相应位被重置以指示该实体不再是服务员 锁。 然后通过扫描服务员列表开始的条目,然后通过授予访问资源的实体,找到新的下一个服务员。 这样可以确保一旦服务员释放锁定,则在所有其他服务器都已收到锁定之前,服务员不会再次接收锁定。