会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Multi-level round robin arbitration system
    • 多级循环仲裁系统
    • US5729702A
    • 1998-03-17
    • US772782
    • 1996-12-24
    • Tadhg CreedonRichard A. GahanFearghal Morgan
    • Tadhg CreedonRichard A. GahanFearghal Morgan
    • G06F13/364G06F13/14G06F13/37
    • G06F13/364
    • Arbitration means for arbitrating between computer devices A to F which compete for access to a common bus. The system provides cascaded round-robin units. Unit RR1 has ports A, B, C, and X in sequence, with port X coupled to round-robin unit RR2, which has ports D, E, F in sequence. On each cycling of unit RR1 past C to A, unit RR2 is checked and the next one of devices D to F (in the sequence determined by unit RR2) has the opportunity of bus access. A gating circuit 13 can further restrict bus accessing by unit RR2's devices, by timing or counter control. A third round-robin unit can be added coupled to unit RR1 (which would have ports A, B, C, X,Y) or to unit RR2 (which would have ports D, E, F, Y). The assignment of devices to ports can be controllable by a matrix switch and device assignment memory.
    • 仲裁意味着在计算机设备A到F之间进行仲裁,竞争访问公共总线。 该系统提供级联循环单元。 单元RR1依次具有端口A,B,C和X,端口X与循环单元RR2相连,其具有端口D,E,F。 在单元RR1经过C到A的每个循环之后,检查单元RR2,并且设备D到F中的下一个(由单元RR2确定的顺序)具有总线访问的机会。 选通电路13可以通过定时或反向控制来进一步限制通过单元RR2的设备的总线访问。 可以将第三循环单元添加到单元RR1(其将具有端口A,B,C,X,Y)或单元RR2(其将具有端口D,E,F,Y)。 设备到端口的分配可以通过矩阵开关和设备分配存储器来控制。
    • 4. 发明授权
    • Storage disk failover and replacement system
    • 存储磁盘故障切换和更换系统
    • US06915448B2
    • 2005-07-05
    • US10128352
    • 2002-04-24
    • Ciaran MurphyRichard A GahanJohn Healy
    • Ciaran MurphyRichard A GahanJohn Healy
    • G06F11/00G06F11/20H04L1/22
    • G06F11/1662G06F11/2094
    • A storage assembly includes a plurality of multi-unit storage device is provided with a failover procedure that does not require hot-swap capability. Individual units are aggregated into a storage array by an aggregation procedure such as RAID. When a failure occurs data from the failed unit is transferred to a hot spare unit. Also, data from other units is transferred by simulating failure of those units and then the complete device can be removed. In small storage networks all the units may be aggregated as a single array and a spare auxiliary device is summoned and integrated into the array prior to the simulated failure. In larger systems there may be two layers of aggregation and failover is run by the second level of aggregation.
    • 存储组件包括多个多单元存储设备,其具有不需要热插拔能力的故障转移过程。 通过诸如RAID的聚合过程将单个单元聚合到存储阵列中。 发生故障时,故障单元的数据传输到热备用单元。 此外,通过模拟这些单元的故障来传输来自其他单元的数据,然后可以去除完整的设备。 在小型存储网络中,所有单元可以被聚合为单个阵列,并且备用辅助设备在模拟故障之前被召唤并集成到阵列中。 在较大的系统中,可能有两层聚合,故障转移由第二级聚合运行。
    • 5. 发明授权
    • System and method for dynamically mapping a high speed link to a multiplicity of low speed trunked links
    • 将高速链路动态映射到多个低速中继链路的系统和方法
    • US06504843B1
    • 2003-01-07
    • US09353606
    • 1999-07-14
    • Con CreminSorcha O'CallaghanDavid NolanRaymond BeechinorRichard A Gahan
    • Con CreminSorcha O'CallaghanDavid NolanRaymond BeechinorRichard A Gahan
    • H04L1228
    • H04L47/621H04L45/745H04L47/50H04L47/521H04L47/6225H04L49/30H04L49/351H04L49/901
    • A method for distributing addressed data packets from an input channel to a multiplicity of packet queues includes receiving said addressed data packets and, responsive to first hashed addresses, distributing the addressed data packets to said queues in accordance with said first hashed addresses. A first hash function is applied to selected address data of each of said addressed data packets to produce said first hashed addresses. At the same time a succession of different hash functions is applied to said selected address data in each of the packets to produce second hashed addresses and occurrences of each of the second hashed addresses are counted so as to obtain for each of said different hash functions a respective one of a plurality of set of counts, each such set representing the distribution of said packets that would occur in said queues if the respective one of the different hash functions had been applied to said addressed data packets. The sets of counts are analyzed to determined which one of them represents a best distribution of said packets and the hash function associated with the best distribution is applied to incoming packets in place of the said first hash function.
    • 一种用于将寻址的数据分组从输入信道分配到多个分组队列的方法包括接收所述寻址的数据分组,并且响应于第一哈希地址,根据所述第一散列地址将寻址的数据分组分配到所述队列。 第一散列函数被应用于每个所述寻址的数据分组的选择的地址数据以产生所述第一散列地址。 同时,对每个分组中的所述选择的地址数据应用一系列不同的散列函数以产生第二散列地址,并对每个第二散列地址的出现进行计数,以便为每个所述不同的散列函数a 相应的多个计数集合中的一个,每个这样的集合表示如果不同散列函数中的相应一个已被应用于所述寻址的数据分组,则将在所述队列中发生的所述分组的分布。 分析计数集合以确定其中哪一个表示所述分组的最佳分布,并且将与最佳分布相关联的散列函数应用于输入分组而不是所述第一哈希函数。
    • 9. 发明授权
    • Calculation and transmission of error check codes
    • 错误检查代码的计算和传输
    • US06804804B2
    • 2004-10-12
    • US09909756
    • 2001-07-23
    • Richard A GahanEugene O'Neill
    • Richard A GahanEugene O'Neill
    • G08C2502
    • H04L69/16H04L1/1874H04L69/169
    • A method of transmitting data (1) generated in an upper layer protocol such as iSCSI in a transport protocol such as TCP or SCTP, without requiring separate reads for check code generation and transmission. The upper layer protocol data is read into a transmission engine (5) that calculates the error check codes and inserts them into the transport protocol transmission. To prevent having to recalculate error codes in the event of loss of transmitted data and a retransmission request, the engine preferably also writes the error check codes into the memory so that the can be retrieved if retransmission is necessary.
    • 在诸如TCP或SCTP的传输协议中发送在诸如iSCSI的上层协议(诸如iSCSI)中生成的数据(1)的方法,而不需要用于校验码生成和传输的单独读取。 将上层协议数据读入传输引擎(5),该传输引擎计算错误校验码并将其插入到传输协议传输中。 为了防止在丢失发送数据和重发请求的情况下重新计算错误代码,引擎优选还将错误校验码写入存储器,以便如果需要重传则可以检索该错误代码。