会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Apparatus, system and method for implementing a generalized queue pair in a system area network
    • 用于在系统区域网络中实现广义队列对的装置,系统和方法
    • US07493409B2
    • 2009-02-17
    • US10411425
    • 2003-04-10
    • David F. CraddockDonald William SchmidtBruce Marshall Walk
    • David F. CraddockDonald William SchmidtBruce Marshall Walk
    • G06F15/173G06F15/177G06F15/16
    • H04L49/901H04L49/90H04L67/1097H04L69/329
    • The present invention provides an apparatus, system and method for providing a generalized queue pair for use with host channel adapters of a system area network. With the apparatus, system and method, the hypervisor of a host channel adapter maintains a P_Key table for each logical port of the host channel adapter. When a request is received to allocate a queue pair from a requestor application associated with a logical port, a P_Key mode is set in a control register associated with the queue pair based on the type of requestor application that sent the request. Based on this P_Key mode, one or more P_Keys from a P_Key table associated with the logical port from which the request was received are written to one or more P_Key registers allocated to the queue pair. These P_Keys are then used to perform P_Key checks of incoming data packets. In addition, these P_Keys are inserted into headers of outgoing data packets. In a preferred embodiment, the P_Key modes may be a single P_Key check mode, a multiple P_Key check mode, and a P_Key check disabled mode.
    • 本发明提供了一种用于提供与系统区域网络的主机信道适配器一起使用的广义队列对的装置,系统和方法。 使用设备,系统和方法,主机通道适配器的管理程序维护主机通道适配器的每个逻辑端口的P_Key表。 当接收到从与逻辑端口相关联的请求者应用分配队列对的请求时,基于发送请求的请求者应用的类型,在与队列对关联的控制寄存器中设置P_Key模式。 基于该P_Key模式,来自与接收请求的逻辑端口相关联的P_Key表中的一个或多个P_Key被写入分配给队列对的一个或多个P_Key寄存器。 这些P_Keys然后用于执行P_Key检查输入数据包。 另外,这些P_Keys被插入输出数据包的头。 在优选实施例中,P_Key模式可以是单个P_Key检查模式,多个P_Key检查模式和P_Key检查禁用模式。
    • 18. 发明授权
    • Implementing ghost packet removal within a reliable meshed network
    • 在可靠的网状网络中实现ghost包删除
    • US08416785B2
    • 2013-04-09
    • US12764193
    • 2010-04-21
    • Phillip Rogers Hillier, IIIDavid Alan ShedivyKenneth Michael ValkBruce Marshall Walk
    • Phillip Rogers Hillier, IIIDavid Alan ShedivyKenneth Michael ValkBruce Marshall Walk
    • H04L12/28
    • H04L47/34H04L45/245H04L49/552
    • A method and circuit for implementing multiple active paths between source and destination devices in an interconnect system while removing ghost packets, and a design structure on which the subject circuit resides are provided. Each packet includes a generation ID and is assigned an End-to-End (ETE) sequence number in the source interconnect chip that represents the packet position in an ordered packet stream from the source device. The packets are transmitted from a source interconnect chip source to a destination interconnect chip on the multiple active paths. The generation ID of a received packet is compared with a current generation ID at a destination interconnect chip to validate packet acceptance. The destination interconnect chip uses the ETE sequence numbers to reorder the accepted received packets into the correct order before sending the packets to the destination device.
    • 一种用于在去除重影分组的同时在互连系统中实现源和目的设备之间的多个活动路径的方法和电路,以及提供了所述主题电路所在的设计结构。 每个分组包括生成ID,并且在源互连芯片中分配表示来自源设备的有序分组流中的分组位置的端到端(ETE)序列号。 分组从源互连芯片源传输到多个主动路径上的目的地互连芯片。 将接收到的分组的生成ID与目的地互连芯片上的当前生成ID进行比较,以验证分组接受。 目的互连芯片在将数据包发送到目标设备之前,使用ETE序列号将接收的接收数据包重新排序为正确的顺序。
    • 19. 发明授权
    • Storage method and hierarchical padding structure for direct access
storage device (DASD) data compression
    • 直接存取存储设备(DASD)数据压缩的存储方法和分层填充结构
    • US5666560A
    • 1997-09-09
    • US510804
    • 1995-08-03
    • Daniel Frank MoertlJohn Douglas StevensGene Steven Van GrinsvenBruce Marshall Walk
    • Daniel Frank MoertlJohn Douglas StevensGene Steven Van GrinsvenBruce Marshall Walk
    • G06F3/06G11B20/00G11B20/10G06F12/02G06F12/08
    • G06F3/0601G11B20/00007G11B20/10G06F2003/0697G06F2212/401
    • A data compression storage method and data compression hierarchical padding structure are provided for a direct access storage device (DASD) using fixed block architecture (FBA). A minimum page allocation defining a minimum number of sectors allocated for each logical compressed data page is selected. The DASD is segmented into at least one compression group. Each compression group has a fixed logical size and includes a selected number of DASD compressed data pages with an initial page allocation of a number of sectors. The initial page allocation is greater than or equal to the minimum page allocation. A minimum number of compressed data regions is allocated within each compression group. A selected number of additional compressed data regions including a plurality of sectors for padding is allocated within each compression group. The plurality of padding sectors are distributed between the compression pages. An exception region is allocated within each compression group. Compressed data is written to a selected DASD compressed data page and typically updated in place. Compressed data is written and updated to the selected DASD compressed data page using sector borrowing of available free sectors from adjacent pages if needed.
    • 为使用固定块架构(FBA)的直接存取存储设备(DASD)提供数据压缩存储方法和数据压缩分层填充结构。 选择定义为每个逻辑压缩数据页分配的最小扇区数的最小页分配。 DASD被分割成至少一个压缩组。 每个压缩组具有固定的逻辑大小,并且包括具有多个扇区的初始页分配的所选数量的DASD压缩数据页。 初始页面分配大于或等于最小页面分配。 在每个压缩组中分配最小数量的压缩数据区域。 在每个压缩组内分配选择数量的包括用于填充的多个扇区的附加压缩数据区域。 多个填充扇区分布在压缩页之间。 在每个压缩组内分配一个异常区域。 压缩数据被写入选定的DASD压缩数据页面,并通常在现场进行更新。 如果需要,压缩数据被写入并更新到所选择的DASD压缩数据页面,使用从相邻页面获得的可用空闲扇区的扇区借用。