会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Reactive deadlock management in storage area networks
    • 存储区域网络中的无效死锁管理
    • US20050246504A1
    • 2005-11-03
    • US10833457
    • 2004-04-28
    • Robert FreyChao Zhang
    • Robert FreyChao Zhang
    • G06F3/06G06F12/00
    • G06F3/0659G06F3/0607G06F3/067
    • Systems and methods in accordance with various embodiments can detect and alleviate potential or actual deadlock of a storage switch or storage area network when attempting to write data to a mirrored virtual target. In accordance with one embodiment, a timer is started when a storage switch routes a write command to the physical targets corresponding to a virtual target of the write command. If each physical target does not return a transfer ready resource within a predetermined timeout period, the switch determines that a potential or actual deadlock has occurred. An abort command is sent to each of the physical devices. The abort command can clear the command from the targets and also free any allocated transfer ready resources. After receiving an acceptance response from each physical target, the state of the write command at the switch can be cleared. The write command can then be re-issued to the physical devices. In one embodiment, a queue depth for the virtual target can be lowered after failing to receive transfer ready resources from each target. By decreasing the queue depth, the maximum number of commands the switch will process for a virtual target is decreased to decrease the probability of future deadlock. In one embodiment, the queue depth is increased after no deadlock is detected for a period of time.
    • 根据各种实施例的系统和方法可以在尝试将数据写入到镜像的虚拟目标时,检测和减轻存储交换机或存储区域网络的潜在或实际的死锁。 根据一个实施例,当存储交换机将写入命令路由到与写入命令的虚拟目标相对应的物理目标时,启动定时器。 如果每个物理目标在预定的超时期间内不返回传送就绪资源,则交换机确定发生了潜在或实际的死锁。 将一个中止命令发送到每个物理设备。 abort命令可以清除目标中的命令,并释放任何分配的传输就绪资源。 在接收到每个物理目标的接受响应后,可以清除交换机上的写命令的状态。 然后可以将write命令重新发送到物理设备。 在一个实施例中,在不能从每个目标接收传送就绪资源之后,可以降低虚拟目标的队列深度。 通过减少队列深度,减少交换机将为虚拟目标处理的命令的最大数量,以减少未来死锁的概率。 在一个实施例中,在一段时间内没有检测到死锁之后,队列深度增加。
    • 6. 发明申请
    • Proactive transfer ready resource management in storage area networks
    • 存储区域网络中的主动转接就绪资源管理
    • US20050262309A1
    • 2005-11-24
    • US10833438
    • 2004-04-28
    • Robert FreyChao Zhang
    • Robert FreyChao Zhang
    • G06F3/06G06F12/14
    • G06F3/0658G06F3/061G06F3/0635G06F3/067G06F11/004G06F11/2056
    • Systems and methods in accordance with various embodiments can manage transfer ready resources of one or more physical targets to avoid deadlock of a storage switch or storage area network when attempting to write data to a mirrored virtual target. When writing data to a mirrored virtual target, a storage switch simultaneously or synchronously routes data from an initiator to multiple physical locations, such as multiple physical targets. A switch or network can become deadlocked while waiting to receive a transfer ready resource from each of the physical targets involved in the operation. In accordance with an embodiment, a storage switch determines the availability of a transfer ready resource from a physical target prior to issuing a write command to the target. In this manner, the switch can ensure that the target will be available to issue a transfer ready signal when a write command is issued, thus alleviating potential deadlock situations. In accordance with one embodiment, a resource table can be used to store an indication of the availability of transfer ready resources from one or more targets. The resource table can be updated as transfer ready resources are allocated to incoming commands. In one embodiment, a circular first in/first out buffer can be used to queue information relating to write commands for mirrored virtual targets.
    • 根据各种实施例的系统和方法可以管理一个或多个物理目标的传送就绪资源,以在尝试将数据写入镜像的虚拟目标时避免存储交换机或存储区域网络的死锁。 当将数据写入镜像的虚拟目标时,存储交换机同时或同步地将数据从发起者路由到多个物理位置,例如多个物理目标。 交换机或网络可能在等待接收来自操作涉及的每个物理目标的转移就绪资源时变为死锁。 根据实施例,存储交换机在向目标发出写入命令之前,确定来自物理目标的转移就绪资源的可用性。 以这种方式,当发出写入命令时,开关可以确保目标可用于发出转移就绪信号,从而减轻潜在的死锁情况。 根据一个实施例,可以使用资源表来存储来自一个或多个目标的转移就绪资源的可用性的指示。 资源表可以随着转移就绪资源被分配给传入命令而被更新。 在一个实施例中,循环的先进先出缓冲器可用于对与镜像的虚拟目标的写入命令相关的信息进行排队。
    • 10. 发明申请
    • GAME THEORY MODEL FOR PATROLLING AN AREA THAT ACCOUNTS FOR DYNAMIC UNCERTAINTY
    • 用于计算动态不确定性帐户的游戏理论模型
    • US20140279818A1
    • 2014-09-18
    • US14216449
    • 2014-03-17
    • Albert Xin JiangZhengyu YinChao ZhangMilind TambeSarit Kraus
    • Albert Xin JiangZhengyu YinChao ZhangMilind TambeSarit Kraus
    • G06N5/04
    • G06N5/048G06N7/005G06Q10/047
    • Game theory models may be used for producing a strategy and schedule for patrolling an area like a rail transportation system. In some instances, the model may account for events that cause a patrol unit to deviate from a patrol schedule and route. For example, a patrol schedule may be generated for one or more patrol units using a Bayesian Stackelberg game theory model based on a map of the public transportation system, a schedule of the transports, a list of the one or more patrolling units, a probability distribution for the occurrence of the passenger not paying to ride the transports, a list of the one or more possible events that would delay the patrol units, and a probability distribution for the occurrence of the one or more possible events that would delay the patrolling units represented by a Markov-decision process.
    • 游戏理论模型可用于制定巡视像铁路运输系统这样的区域的战略和时间表。 在某些情况下,该模型可能会导致巡视单位偏离巡逻进度和路线的事件。 例如,可以使用基于公共交通系统的地图,运输时间表,一个或多个巡逻单元的列表,一个或多个巡逻单元的列表,使用贝叶斯Stackelberg游戏理论模型来生成针对一个或多个巡逻单元的巡逻时间表 分配用于不支付乘坐运输工具的乘客的发生,将延迟巡逻单位的一个或多个可能的事件的列表,以及发生一个或多个可能的事件的概率分布,这些事件将延迟巡逻单位 由马尔科夫决定过程代表。