会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 82. 发明授权
    • System and method for attached storage stacking
    • 连接存储堆放的系统和方法
    • US08499012B1
    • 2013-07-30
    • US12818870
    • 2010-06-18
    • Millind Mittal
    • Millind Mittal
    • G06F12/00G06F17/30G06F7/00
    • H04L67/1097
    • A system and method are provided for stacking storage drives in a network attached storage (NAS) system. The method provides a NAS stacking network including at least a first and second stackable building block (SBB), where each SBB includes a head, with an embedded processor and storage application, and a storage drive including client files. The method connects a first interface of the first SBB to a client computer device via a LAN switch, and connects a second interface of the first SBB to the first interface of the second SBB. A directory is built of client files stored in the first and second SBBs. The directory is maintained in both the first and second SBBs. In one aspect, the first SBB, acting as a primary SBB, provides access to NAS stacking network directory structure in response to an inquiry from a client computer connected to the LAN switch.
    • 提供了一种用于将存储驱动器堆叠在网络连接存储(NAS)系统中的系统和方法。 该方法提供包括至少第一和第二可堆叠构建块(SBB)的NAS堆叠网络,其中每个SBB包括具有嵌入式处理器和存储应用的头部以及包括客户端文件的存储驱动器。 该方法通过LAN交换机将第一SBB的第一接口连接到客户端计算机设备,并将第一SBB的第二接口连接到第二SBB的第一接口。 目录由存储在第一和第二SBB中的客户端文件构建。 该目录保持在第一和第二SBB中。 在一个方面,作为主SBB的第一SBB响应于来自连接到LAN交换机的客户端计算机的查询,提供对NAS堆叠网络目录结构的访问。
    • 83. 发明授权
    • Dual-connect service box with router bypass
    • 双路服务器与路由器旁路
    • US08488618B1
    • 2013-07-16
    • US12769540
    • 2010-04-28
    • Millind MittalRobert James Fanfelle
    • Millind MittalRobert James Fanfelle
    • H04L12/28
    • H04L63/02H04L63/0236
    • A system and method provide both inline services and in-network services for a dual-connect service box interposed between a modem and a router. The method transceives communications between a service box wide area network (WAN) port and a local area network (LAN) port of a WAN-connected broadband modem, and between a service box WAN-proxy port and a WAN port of a router. The method also selectively transceives communications between the service box WAN port and a LAN port. A service box binding module monitors messages transceived between the router and the modem to determine the service box WAN IP address, and registers at least one service box WAN IP addresses with a WAN network-connected account server. The method selectively transceives communications in response to an authentification means, which may be identifying an authorized port number in the communications, or identifying an authorized command in the communications.
    • 系统和方法为插入在调制解调器和路由器之间的双连接服务盒提供内联服务和网络内服务。 该方法收发WAN连接宽带调制解调器的服务盒广域网(WAN)端口和局域网(LAN)端口之间以及路由器的服务盒WAN代理端口和WAN端口之间的通信。 该方法还选择性地收发服务盒WAN端口和LAN端口之间的通信。 服务箱绑定模块监视路由器和调制解调器之间收发的消息,以确定服务箱WAN IP地址,并向WAN网络连接的帐户服务器注册至少一个服务箱WAN IP地址。 所述方法响应于认证装置选择性地收发通信,所述认证装置可能是识别通信中的授权端口号,或者识别通信中的授权命令。
    • 85. 发明申请
    • Multi-Level Compressed Look-up Tables Formed by Logical Operations to Compress Selected Index Bits
    • 通过逻辑操作形成的多级压缩查找表来压缩所选择的索引位
    • US20090024643A1
    • 2009-01-22
    • US12190692
    • 2008-08-13
    • Millind Mittal
    • Millind Mittal
    • G06F17/30
    • G06F17/30961Y10S707/99942Y10S707/99943
    • A lookup is performed using multiple levels of compressed stride tables in a multi-bit Trie structure. An input lookup key is divided into several strides including a current stride of S bits. A valid entry in a current stride table is located by compressing the S bits to form a compressed index of D bits into the current stride table. A compression function logically combines the S bits to generate the D compressed index bits. An entry in a prior-level table points to the current stride table and has a field indicating which compression function and mask to use. Compression functions can include XOR, shifts, rotates, and multi-bit averaging. Rather than store all 2S entries, the current stride table is compressed to store only 2D entries. Ideally, the number of valid entries in the current stride table is between 2D−1 and 2D for maximum compression. Storage requirements are reduced.
    • 在多位Trie结构中使用多级压缩步幅表进行查找。 输入查找键被分成包括S位的当前步幅的几个步骤。 通过压缩S位来形成当前步幅表中的有效条目,以形成D位的压缩索引到当前步幅表中。 压缩函数逻辑组合S位以产生D压缩索引位。 前一级表中的条目指向当前步幅表,并具有指示要使用的压缩函数和掩码的字段。 压缩功能可以包括XOR,移位,旋转和多位平均。 而不是存储所有2S条目,当前步幅表被压缩以仅存储2D条目。 理想情况下,当前步幅表中有效条目的数量在2D-1和2D之间用于最大压缩。 存储要求降低。
    • 89. 发明授权
    • Controlling shared memory access ordering in a multi-processing system
using an acquire/release consistency model
    • 使用获取/释放一致性模型控制多处理系统中的共享内存访问排序
    • US5860126A
    • 1999-01-12
    • US768775
    • 1996-12-17
    • Millind Mittal
    • Millind Mittal
    • G06F9/30G06F9/38G06F9/46G06F12/00
    • G06F9/52G06F9/3004G06F9/30087
    • A technique for controlling memory access ordering in a multi-processing system in which a sequence of accesses to acquire, access and release a shared space of memory is strictly adhered to by use of two specialized instructions for controlling memory access. Two instructions noted as MFDA (Memory Fence Directional--Acquire)and MFDR (Memory Fence Directional--Release) are utilized to control the ordering. The MFDA instruction when encountered in a program operates to ensure that all previous accesses to the specified address (typically to a lock controlling access to the shared space) become visible to other processors before all future accesses are permitted. The MFDR instruction when encountered in a program operates to ensure that all previous accesses become visible to other processors before any future accesses to the specified address. The accesses to the shared space of memory are then located between the MFDA and MFDR instructions and made visible to the other processors in proper order with respect to accesses for acquiring and releasing the shared space.
    • 一种用于在多处理系统中控制存储器访问排序的技术,其中通过使用用于控制存储器访问的两个专用指令严格地遵守用于获取,访问和释放存储器的共享空间的访问序列。 被指定为MFDA(记忆栅栏方向获取)和MFDR(记忆栅栏定向释放)的两个指令用于控制排序。 在程序中遇到MFDA指令时,可以确保在允许所有未来访问之前,所有之前对指定地址的访问(通常是控制对共享空间的访问锁)在其他处理器中可见。 程序中遇到的MFDR指令运行,以确保所有以前的访问在任何将来访问指定地址之前变得对其他处理器可见。 然后,对存储器的共享空间的访问位于MFDA和MFDR指令之间,并且对于其他处理器,对于获取和释放共享空间的访问,以适当的顺序可见。
    • 90. 发明授权
    • Method and apparatus for providing memory access in a processor pipeline
    • 用于在处理器流水线中提供存储器访问的方法和装置
    • US5787026A
    • 1998-07-28
    • US575780
    • 1995-12-20
    • Doron OrensteinMillind MittalOfri Wechsler
    • Doron OrensteinMillind MittalOfri Wechsler
    • G06F9/38G06F9/302
    • G06F9/3826G06F9/3867
    • The invention provides a method and apparatus for providing operand reads in a processor pipeline. According to one aspect of the invention, a method is described for executing an instruction in a computer pipeline that requires different operands be read from the same register file in different stages of the computer pipeline. According to another aspect of the invention, a method is described for executing an instruction in a processor pipeline. According to this method, at least a first operand is read from a register file in a first stage of the processor pipeline. If execution of the instruction causes the processor to place the first operand in a storage area other than the register file, then the first operand in written to that storage area in a subsequent stage of the processor pipeline. Otherwise, one or more ALU operations are performed on the first operand and at least a second operand in a different subsequent stage of the processor pipeline.
    • 本发明提供了一种用于在处理器管线中提供操作数读取的方法和装置。 根据本发明的一个方面,描述了一种用于执行计算机流水线中的指令的方法,其需要在计算机管线的不同阶段从同一寄存器文件读取不同的操作数。 根据本发明的另一方面,描述了一种用于在处理器流水线中执行指令的方法。 根据该方法,在处理器管线的第一级中,从寄存器文件读取至少第一操作数。 如果指令的执行导致处理器将第一操作数放置在除寄存器文件之外的存储区域中,则将第一操作数写入处理器管线的后续阶段中的该存储区域。 否则,在处理器流水线的不同后续阶段的第一操作数和至少第二操作数上执行一个或多个ALU操作。