会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Mechanism for completing messages in memory
    • 在内存中完成消息的机制
    • US06744765B1
    • 2004-06-01
    • US09645864
    • 2000-08-24
    • Glenn A. DearthThomas P. WebberKenneth A. Ward
    • Glenn A. DearthThomas P. WebberKenneth A. Ward
    • H04L1228
    • H04L47/10H04L47/34H04L67/42
    • A method for transmitting messages between two processes includes creating a communications channel between a first channel adapter coupled to a client process and a second channel adapter coupled to a remote process. The method further includes reading a request message at the first channel adapter, segmenting the request message into a series of packets, assigning a sequence number to each packet, and transmitting the packets in order to the second channel adapter through the communications channel. The method further includes receiving the packets at the second channel adapter and sending at least one acknowledgement message to the first channel adapter in response to the received packets. The acknowledgement message has a packet sequence number field containing a packet sequence number and a payload containing a message sequence number, wherein the message sequence number identifies a complete message last received at the second channel adapter and the packet sequence number identifies a packet last received at the second channel adapter.
    • 用于在两个进程之间传送消息的方法包括在耦合到客户端进程的第一通道适配器和耦合到远程进程的第二通道适配器之间建立通信通道。 该方法还包括在第一信道适配器处读取请求消息,将请求消息分割成一系列分组,向每个分组分配序列号,并通过通信信道向第二信道适配器发送分组。 该方法还包括在第二信道适配器处接收分组,并响应于所接收的分组向第一信道适配器发送至少一个确认消息。 确认消息具有分组序列号字段,其包含分组序列号和包含消息序列号的有效载荷,其中消息序列号标识在第二信道适配器上最后接收的完整消息,并且分组序列号标识最后在 第二个通道适配器。
    • 5. 发明授权
    • Mechanism for efficient scheduling of communication flows
    • 通信流程高效调度机制
    • US06937611B1
    • 2005-08-30
    • US09553966
    • 2000-04-21
    • Kenneth A. Ward
    • Kenneth A. Ward
    • H04L12/56H04J15/00
    • H04L47/621H04L47/50
    • A system for servicing communication queues may include memory configured to store a hierarchical channel map having a plurality of levels wherein each bit of the lowest level is mapped to a different one of a plurality of communication channels and wherein each bit of each higher level is mapped to a group of bits at the next lower level. The system may include a host adapter configured to maintain the hierarchical bitmap wherein each bit at the lowest level is set if the channel to which it is mapped has a pending communication request and is cleared if not. Each bit of each higher level is set if at least one bit is set in the lower level group to which is mapped and cleared if not. The host adapter may be configured to examine the hierarchical bitmap in order to determine a next one of the communication channels to service. At each level of the hierarchical channel map a service mask may be provided to track which bits have already been traversed at that level. Multiple such service masks may be provided at each level to support different service classes.
    • 用于维护通信队列的系统可以包括被配置为存储具有多个级别的分级信道映射的存储器,其中最低级别的每个位映射到多个通信信道中的不同的一个,并且其中每个较高级别的每个位被映射 到下一个较低级别的一组位。 该系统可以包括被配置为维护分层位图的主机适配器,其中如果其被映射到的信道具有未决的通信请求,则在最低级别的每个位被设置,并且如果不是则被清除。 如果在映射的较低级别组中设置了至少一个位,并且如果不是,则将其清除,每个较高级别的每个位都被置位。 主机适配器可以被配置为检查分层位图,以便确定要进行服务的下一个通信信道。 在分级通道图的每个级别,可以提供服务掩码以跟踪哪个位已经在该级别被遍历。 可以在每个级别提供多个这样的服务掩码以支持不同的服务等级。
    • 6. 发明授权
    • Method and apparatus for alleviating cell packing problems in bundled link systems
    • 捆绑链接系统中减轻细胞包装问题的方法和装置
    • US06804258B1
    • 2004-10-12
    • US09456740
    • 1999-12-07
    • Kenneth A. WardDomenic DimeoGlenn Dearth
    • Kenneth A. WardDomenic DimeoGlenn Dearth
    • H04J324
    • H04L12/5601H04L2012/5624H04L2012/5652H04L2012/5665
    • In a bundled link system which partitions a data packet into varying size cells, a data packet is partitioned into a stream of cells of which the last two cells are partial cells. When the data has been partitioned so that less than the data required to fill two maximum size cells remains, the remaining data is divided into two cells where the cell size is selected so that each cell is larger than a predetermined minimum size. In a preferred embodiment, the remaining data is equally divided into partial size cells. In particular, in accordance with one embodiment, when there is less than two times the maximum size cell of data remaining to be partitioned in a packet and the remaining data is more than the maximum cell size, then the cell size used for the last two cells is the size of the remaining data divided by two.
    • 在将数据分组划分成不同大小的分组的捆绑链路系统中,将数据分组划分成最后两个小区为部分小区的小区流。 当数据被分割成小于填充两个最大尺寸单元所需的数据时,剩下的数据被分成两个单元,其中选择单元大小,使得每个单元大于预定的最小尺寸。 在优选实施例中,剩余数据被等分成部分大小的单元。 特别地,根据一个实施例,当存在少于分组中被分割的剩余数据的最大大小小区的数目小于两倍时,剩余数据大于最大小区大小时,则用于最后两个小区的小区大小 单元格是剩余数据的大小除以2。
    • 7. 发明授权
    • Self-actuating control valve for a bed pad or seat pad
    • 用于床垫或座垫的自动控制阀
    • US06895988B2
    • 2005-05-24
    • US10435089
    • 2003-05-09
    • Benton H. GrantKenneth A. Ward
    • Benton H. GrantKenneth A. Ward
    • G05D7/06G05D7/01
    • G05D7/0664Y10T137/2544Y10T137/2668Y10T137/2678Y10T137/2695
    • A fluid operated control valve for controlling fluid flow of a system which includes a first and a second fluid channels therein, the control valve includes: a hollow casing with closed first and second ends; a piston member slidably disposed within the casing and defining thereby within the casing a first chamber adjacent to the first end of the casing and a second chamber adjacent to the second end of the casing; a first magnet disposed adjacent the first chamber of the casing for attracting the piston member to a first terminal position; a second magnet disposed adjacent the second chamber of the casing for attracting the piston member to a second terminal position. The control valve further includes: an input port disposed adjacent to an intermediate location in the casing; a first output port disposed in the casing in fluid communication with the first chamber; a second output port disposed in the casing in fluid communication with the second chamber; wherein the control valve is adapted to alternately inflate and deflate the two fluid channels of the system through the ports in response to the reciprocal movement of the piston member. Pad systems utilizing the control valve are also disclosed.
    • 一种用于控制包括第一和第二流体通道的系统的流体流动的流体操作控制阀,所述控制阀包括:具有封闭的第一和第二端的中空壳体; 活塞构件,其可滑动地设置在所述壳体内并且由此限定所述壳体内与所述壳体的所述第一端相邻的第一室和邻近所述壳体的第二端的第二室; 邻近所述壳体的所述第一室设置的第一磁体,用于将所述活塞构件吸引到第一端子位置; 邻近所述壳体的第二腔室设置的第二磁体,用于将所述活塞构件吸引到第二终端位置。 所述控制阀还包括:与壳体中的中间位置相邻设置的输入端口; 第一输出端口,设置在与第一室流体连通的壳体中; 第二输出端口,设置在所述壳体中,与所述第二室流体连通; 其中所述控制阀适于响应于所述活塞构件的往复运动,通过所述端口交替地使所述系统的两个流体通道膨胀和放气。 还公开了利用控制阀的垫系统。
    • 8. 发明授权
    • Method and apparatus for bundling serial data transmission links to obtain increased data throughput
    • 用于捆绑串行数据传输链路以获得增加的数据吞吐量的方法和装置
    • US06549540B1
    • 2003-04-15
    • US09268178
    • 1999-03-15
    • Kenneth A. Ward
    • Kenneth A. Ward
    • H04J302
    • H04Q11/0478H04L2012/5672
    • In a switched configuration in which data links can be bundled to increase data throughput, the links in a bundle are ordered. A data sender sequentially transmits cells in the data packet over links in the bundle. For example, a first cell is transmitted over a first ordered link in the bundle. The next cell is transmitted over the next link in the bundle order and operation continues in a “round robin” fashion. The data receiver is informed in advance of the order of links in the bundle and expects cells to be distributed over the links in that order. The data sender transmits a bundle sequence number with each data cell. As each new data cell is transmitted, the bundle sequence number is incremented. The receiver uses the bundle sequence number to validate cell order, to detect lost cells, and to resynchronize cell order with the sender in the case of cell errors. Bundle sequence numbers are used on a single bundle on a single link, or “hop”, between a data sender and a data receiver. When the cells are received by the data receiver of a hop, the received bundle sequence numbers are replaced by new bundle sequence numbers generated by the data sender for transmission over the next hop.
    • 在可以捆绑数据链路以增加数据吞吐量的交换配置中,捆绑中的链路被排序。 数据发送器通过链路中的链路顺序传输数据包中的小区。 例如,第一小区通过该束中的第一有序链路传输。 下一个小区以捆绑顺序通过下一个链路传输,操作以“循环”方式继续。 数据接收者被提前通知捆绑中的链接的顺序,并且期望单元按顺序分布在链接上。 数据发送器与每个数据单元发送一个包序列号。 随着每个新的数据信元被传输,束序列号被递增。 在单元格错误的情况下,接收器使用包序列号验证信元顺序,检测丢失的信元,并重新同步发送方的信元顺序。 捆绑序列号在单个链路上的单个捆绑包上使用,或者在数据发送者和数据接收者之间使用“跳”。 当小区被跳数的数据接收者接收时,接收到的束序列号由数据发送器生成的新的包序列号代替,用于在下一跳传输。