会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Method for Processing Multiple Operations
    • 多操作处理方法
    • US20080159528A1
    • 2008-07-03
    • US11617418
    • 2006-12-28
    • Wajdi FeghaliStephanie HirnakMakaram RaghunandanYogesh BansalKirk YapGilbert M. Wolrich
    • Wajdi FeghaliStephanie HirnakMakaram RaghunandanYogesh BansalKirk YapGilbert M. Wolrich
    • H04L9/30H04L9/28
    • H04L63/0485G06F9/30181G06F9/3879H04L63/08
    • In one embodiment, the present disclosure provides a method capable of processing a variety of different operations. A method according to one embodiment may include loading configuration data from a shared memory unit into a hardware configuration register, the hardware configuration register located within circuitry included within a hardware accelerator unit. The method may also include issuing a command set from a microengine to the hardware accelerator unit having the circuitry. The method may additionally include receiving the command set at the circuitry from the microengine, the command set configured to allow for the processing of a variety of different operations. The method may further include processing an appropriate operation based upon the configuration data loaded into the hardware configuration register. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 在一个实施例中,本公开提供了一种能够处理各种不同操作的方法。 根据一个实施例的方法可以包括将配置数据从共享存储器单元加载到硬件配置寄存器中,硬件配置寄存器位于包括在硬件加速器单元内的电路内。 该方法还可以包括从微引擎向具有该电路的硬件加速器单元发出命令集。 该方法可以另外包括接收来自微引擎的电路处的命令集,该命令集被配置为允许处理各种不同的操作。 该方法还可以包括基于加载到硬件配置寄存器中的配置数据来处理适当的操作。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 3. 发明申请
    • Storage Accelerator
    • 存储加速器
    • US20080162806A1
    • 2008-07-03
    • US11617966
    • 2006-12-29
    • Vinodh GopalYogesh BansalGilbert M. WolrichWajdi FeghaliKirk Yap
    • Vinodh GopalYogesh BansalGilbert M. WolrichWajdi FeghaliKirk Yap
    • G06F12/06
    • G06F11/1076G06F2211/1057
    • The present disclosure provides a method for generating RAID syndromes. In one embodiment the method may include loading a first data byte of a first disk block and a first data byte of a second disk block from a storage device to an arithmetic logic unit. The method may further include XORing the first data byte of the first disk block and the first data byte of the second disk block to generate a first result and storing the first result in a results buffer. The method may also include iteratively repeating, loading intermediate data bytes corresponding to the first disk block and intermediate data bytes corresponding to the second disk block from the storage device to the arithmetic logic unit. The method may additionally include XORing the intermediate data bytes corresponding to the first disk block and the intermediate data bytes corresponding to the second disk block to generate intermediate results and generating a RAID syndrome based on, at least in part, the intermediate results. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于生成RAID综合征的方法。 在一个实施例中,该方法可以包括将第一磁盘块的第一数据字节和第二磁盘块的第一数据字节从存储设备加载到算术逻辑单元。 该方法还可以包括将第一磁盘块的第一数据字节和第二磁盘块的第一数据字节进行异或,以产生第一结果并将第一结果存储在结果缓冲器中。 该方法还可以包括将对应于第一磁盘块的中间数据字节和对应于第二磁盘块的中间数据字节从存储设备反复重复加载到算术逻辑单元。 该方法还可以包括对与第一磁盘块相对应的中间数据字节和对应于第二磁盘块的中间数据字节进行异或,以产生中间结果,并至少部分地基于中间结果生成RAID综合征。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 4. 发明授权
    • Storage accelerator
    • 存储加速器
    • US07797612B2
    • 2010-09-14
    • US11617966
    • 2006-12-29
    • Vinodh GopalYogesh BansalGilbert M. WolrichWajdi FeghaliKirk Yap
    • Vinodh GopalYogesh BansalGilbert M. WolrichWajdi FeghaliKirk Yap
    • G11C29/00
    • G06F11/1076G06F2211/1057
    • The present disclosure provides a method for generating RAID syndromes. In one embodiment the method may include loading a first data byte of a first disk block and a first data byte of a second disk block from a storage device to an arithmetic logic unit. The method may further include XORing the first data byte of the first disk block and the first data byte of the second disk block to generate a first result and storing the first result in a results buffer. The method may also include iteratively repeating, loading intermediate data bytes corresponding to the first disk block and intermediate data bytes corresponding to the second disk block from the storage device to the arithmetic logic unit. The method may additionally include XORing the intermediate data bytes corresponding to the first disk block and the intermediate data bytes corresponding to the second disk block to generate intermediate results and generating a RAID syndrome based on, at least in part, the intermediate results. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于生成RAID综合征的方法。 在一个实施例中,该方法可以包括将第一磁盘块的第一数据字节和第二磁盘块的第一数据字节从存储设备加载到算术逻辑单元。 该方法还可以包括将第一磁盘块的第一数据字节和第二磁盘块的第一数据字节进行异或,以产生第一结果并将第一结果存储在结果缓冲器中。 该方法还可以包括将对应于第一磁盘块的中间数据字节和对应于第二磁盘块的中间数据字节从存储设备反复重复加载到算术逻辑单元。 该方法还可以包括对与第一磁盘块相对应的中间数据字节和对应于第二磁盘块的中间数据字节进行异或,以产生中间结果,并至少部分地基于中间结果生成RAID综合征。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 8. 发明授权
    • Apparatus and method for generating a Galois-field syndrome
    • 用于产生伽罗瓦氏综合征的装置和方法
    • US07607068B2
    • 2009-10-20
    • US11469222
    • 2006-08-31
    • Vinodh GopalGilbert M. WolrichDaniel CutterWajdi FeghaliRobert P. Ottavi
    • Vinodh GopalGilbert M. WolrichDaniel CutterWajdi FeghaliRobert P. Ottavi
    • G11C29/00
    • G06F11/1076G06F2211/1054G06F2211/1057
    • The present disclosure provides an apparatus and method for generating a Galois-field syndrome. One exemplary method may include loading a first data byte from a first storage device to a first register and loading a second data byte from a second storage device to a second register; ANDing the most significant bit (MSB) of the first data byte and a Galois-field polynomial to generate a first intermediate output; XORing each bit of the first intermediate output with the least significant bits (LSBs) of the first data byte to generate a second intermediate output; MUXing the second intermediate output with each bit of the first data byte to generate a third intermediate output; XORing each bit of the third intermediate output with each bit of the second data byte to generate at a fourth intermediate output; and generating a RAID Q syndrome based on, at least in part, the fourth intermediate output. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于产生伽罗瓦域综合征的装置和方法。 一个示例性方法可以包括将第一数据字节从第一存储设备加载到第一寄存器,并将第二数据字节从第二存储设备加载到第二寄存器; 将第一数据字节的最高有效位(MSB)和伽罗瓦域多项式进行比较以产生第一中间输出; 用第一数据字节的最低有效位(LSB)对第一中间输出的每个位进行异或,以产生第二中间输出; 将第二中间输出与第一数据字节的每个位进行多路复用以产生第三中间​​输出; 将第三中间输出的每个位与第二数据字节的每个位进行异或,以在第四中间输出处产生; 以及至少部分地基于第四中间输出产生RAID Q综合征。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 10. 发明申请
    • Method for Simultaneous Modular Exponentiations
    • 同时模块化指标的方法
    • US20080144811A1
    • 2008-06-19
    • US11610919
    • 2006-12-14
    • Vinodh GopalErdinc OzturkKaan YuskelGunnar GaubatzWajdi FeghaliGilbert M. Wolrich
    • Vinodh GopalErdinc OzturkKaan YuskelGunnar GaubatzWajdi FeghaliGilbert M. Wolrich
    • H04L9/30
    • G06F7/723H04L9/302
    • The present disclosure provides a method for performing modular exponentiation. The method may include generating a first remainder (xp) based on an encrypted message (X) modulo a first prime number (p) and generating a second remainder (xq) based on the encrypted message (X) modulo a second prime number (q). The method may further include generating a third remainder(v1) based on the first remainder (xp) raised to a first private key number (d1) modulo the first prime number (p) and simultaneously generating a fourth remainder (v2) based on the second remainder (xq) raised to a second private key number (d2) modulo the second prime number(q). The method may also include subtracting the fourth remainder (v2) from the third remainder (v1) to yield a result (v1−v2) and multiplying the result (v1−v2) by a constant (c) to produce a second result. The method may additionally include generating a sixth remainder (h) by taking the second result modulo the first prime number (p) and multiplying the sixth remainder (h) by the second prime number (q) to produce a third result. The method may further include adding the third result and the fourth remainder (v2) to yield a final result (Y) and generating, at least in part, a public key based on the final result (Y). Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于执行模幂运算的方法。 该方法可以包括基于第一素数(p)模数的加密消息(X)生成第一余数(xp),并且基于加密消息(X)生成第二余数(xq),第二素数(q) )。 该方法还可以包括:基于第一余数(xp)产生第三余数(v1),所述第一余数(xp)基于所述第一余数(xp)生成第一素数(p)的第一私钥数(d1)并同时生成第四余数 第二余数(xq)升至第二素数(q)的第二私钥号(d2)。 该方法还可以包括从第三余数(v1)中减去第四余数(v2)以产生结果(v1-v2)并将结果(v1-v2)乘以常数(c)以产生第二结果。 该方法可以另外包括通过将第二结果以第一素数(p)取模并将第六余数(h)乘以第二素数(q)产生第三结果来产生第六余数(h)。 该方法还可以包括添加第三结果和第四余数(v2)以产生最终结果(Y),并且至少部分地基于最终结果(Y)生成公钥。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。