会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Method And System For Internet Transport Acceleration Without Protocol Offload
    • 无协议卸载的Internet传输加速方法和系统
    • US20080165784A1
    • 2008-07-10
    • US12051827
    • 2008-03-19
    • Michael Anthony KoPrasenjit Sarkar
    • Michael Anthony KoPrasenjit Sarkar
    • H04L12/56
    • H04L69/16H04L69/10H04L69/161H04L69/22
    • A packet classifier within a network adapter detects an application packet header belonging to a packet in a data stream associated with an application that uses a network protocol, such as TCP/IP, SNA or IPX. Offsets included within the application header are identified and a plurality of registers is loaded with the identified offsets. Each of a plurality direct data placement patterns are masked with contents of the loaded registers. Each direct data placement pattern is associated with an application packet header and includes a corresponding I/O context. Additionally, each direct data placement pattern includes a corresponding connection path for direct placement of a payload corresponding to the detected application header in a memory that is utilized by the application.
    • 网络适​​配器内的分组分类器检测属于与使用诸如TCP / IP,SNA或IPX之类的网络协议的应用相关联的数据流中的分组的应用分组报头。 识别包括在应用头内的偏移量,并且使用所识别的偏移来加载多个寄存器。 多个直接数据放置模式中的每一个都被加载的寄存器的内容屏蔽。 每个直接数据放置模式与应用分组报头相关联并且包括相应的I / O上下文。 另外,每个直接数据放置模式包括相应的连接路径,用于将与检测到的应用头相对应的有效载荷直接放置在由应用使用的存储器中。
    • 3. 发明授权
    • Conflict resolution in multi-node communication network
    • 多节点通信网络中的冲突解决
    • US6101194A
    • 2000-08-08
    • US871165
    • 1997-06-09
    • Narasimha Lakshmi AnnapareddyJames Thomas BradyDamon W. FinneyMichael Howard HartungMichael Anthony KoJai M. MenonDavid Ronald Nowlen
    • Narasimha Lakshmi AnnapareddyJames Thomas BradyDamon W. FinneyMichael Howard HartungMichael Anthony KoJai M. MenonDavid Ronald Nowlen
    • H04J3/02H04L29/06H04L29/08
    • H04L29/06H04L29/08
    • Conflicts are resolved between competing nodes in a multi-node communications network. After a first node in the network requests an initiation of communications with a target node, the requesting node may simply initiate the requested communications with the target node if the target node is not busy. If the first node determines that the target node is busy, it proceeds to resolve the conflict. Namely, the first node repeats the process of waiting for a first delay then requesting initiation of communications with the target node. After each unsuccessful attempt, the first delay is successively increased. As an example, the delay may be increased exponentially, with a controlled randomness added. After a or more queued messages to other nodes. Following this, the first node performs another sequence to initiate communications with the target node, successively increasing the delay between unsuccessful attempts, as before. After a predetermined number of unsuccessful passes through the foregoing routine, the first node proceeds to take appropriate action, such as initiating an error recovery routine, sending the message via different hardware components, or issuing an error message.
    • 冲突在多节点通信网络中的竞争节点之间解决。 在网络中的第一节点请求启动与目标节点的通信之后,如果目标节点不忙,请求节点可以简单地发起与目标节点的所请求的通信。 如果第一个节点确定目标节点正在忙,则会继续解决冲突。 也就是说,第一节点重复等待第一延迟的处理,然后请求发起与目标节点的通信。 在每次不成功的尝试后,第一个延迟连续增加。 作为示例,延迟可以以指数方式增加,并且增加受控的随机性。 将一个或多个排队的消息发送到其他节点。 此后,第一个节点执行另一个序列以启动与目标节点的通信,如以前一样,连续增加不成功尝试之间的延迟。 在通过上述例程的预定数量的不成功通过之后,第一节点继续采取适当的动作,例如启动错误恢复例程,经由不同硬件组件发送消息或发出错误消息。
    • 5. 发明授权
    • Method and system for message status reporting in a multi-node network
    • 多节点网络中消息状态报告的方法和系统
    • US5717862A
    • 1998-02-10
    • US429702
    • 1995-04-27
    • Narasimhareddy L. AnnapareddyJames Thomas BradyDamon W. FinneyRichard F. FreitasMichael Anthony KoMichael James Rayfield
    • Narasimhareddy L. AnnapareddyJames Thomas BradyDamon W. FinneyRichard F. FreitasMichael Anthony KoMichael James Rayfield
    • H04L12/56G06F13/00
    • H04L47/10
    • A multi-nodal data processing system includes a plurality of processing nodes, each node connected to plural other nodes by bidirectional data links. Each node comprises receivers for receiving messages on bidirectional data links and transmitters for transmitting messages on bidirectional data links. Each node records child nodes to which a message was transmitted and is further adapted to transmit a lock-up message received from a child node to a parent node, the lock-up message indicating a successful establishment of a message signal path to a destination node. Each node further is adapted to transmit a link cancel signal to another node to close the link in the event of an unsuccessful message transfer attempt over the link. Each node inhibits transmission of a lock-up signal to a parent node until link cancel signals have been received from all child nodes (other than a node from which a lock-up signal was received). A source node (where a message originates) continues transmission of its message, even before a lock-up signal has been received. The destination node which originates the lock-up message terminates a bidirectional data link by an end-of-session signal when it has received an entire message.
    • 多节点数据处理系统包括多个处理节点,每个节点通过双向数据链路连接到多个其他节点。 每个节点包括用于在双向数据链路上接收消息的接收机和用于在双向数据链路上发送消息的发射机。 每个节点记录发送消息的子节点,并且进一步适于将从子节点接收的锁定消息发送到父节点,锁定消息指示成功建立到目的地节点的消息信号路径 。 每个节点进一步适于在另一节点上发送链路取消信号以在通过链路的不成功的消息传送尝试的情况下关闭链路。 每个节点禁止向父节点发送锁定信号,直到从所有子节点(除了接收到锁定信号的节点)接收到链路消除信号为止。 即使在接收到锁定信号之前,源节点(消息始发地)也继续发送其消息。 当接收到整个消息时,发起锁定消息的目的地节点通过会话结束信号终止双向数据链路。
    • 6. 发明授权
    • Method and system for internet transport acceleration without protocol offload
    • 无协议卸载的互联网传输加速方法和系统
    • US07941498B2
    • 2011-05-10
    • US12051827
    • 2008-03-19
    • Michael Anthony KoPrasenjit Sarkar
    • Michael Anthony KoPrasenjit Sarkar
    • G06F15/167G06F15/16
    • H04L69/16H04L69/10H04L69/161H04L69/22
    • A packet classifier within a network adapter detects an application packet header belonging to a packet in a data stream associated with an application that uses a network protocol, such as TCP/IP, SNA or IPX. Offsets included within the application header are identified and a plurality of registers is loaded with the identified offsets. Each of a plurality direct data placement patterns are masked with contents of the loaded registers. Each direct data placement pattern is associated with an application packet header and includes a corresponding I/O context. Additionally, each direct data placement pattern includes a corresponding connection path for direct placement of a payload corresponding to the detected application header in a memory that is utilized by the application.
    • 网络适​​配器内的分组分类器检测属于与使用诸如TCP / IP,SNA或IPX之类的网络协议的应用相关联的数据流中的分组的应用分组报头。 识别包括在应用头内的偏移量,并且使用所识别的偏移来加载多个寄存器。 多个直接数据放置模式中的每一个都被加载的寄存器的内容屏蔽。 每个直接数据放置模式与应用分组报头相关联并且包括相应的I / O上下文。 另外,每个直接数据放置模式包括相应的连接路径,用于将与检测到的应用头相对应的有效载荷直接放置在由应用使用的存储器中。
    • 8. 发明授权
    • Dynamic memory allocation that enalbes efficient use of buffer pool
memory segments
    • 动态内存分配,有效利用缓冲池内存段
    • US5784698A
    • 1998-07-21
    • US568180
    • 1995-12-05
    • James Thomas BradyDamon W. FinneyMichael Howard HartungMichael Anthony KoNoah R. MendelsohnJaishankar Moothedath MenonDavid R. Nowlen
    • James Thomas BradyDamon W. FinneyMichael Howard HartungMichael Anthony KoNoah R. MendelsohnJaishankar Moothedath MenonDavid R. Nowlen
    • G06F9/50G06F12/02
    • G06F9/5016G06F12/023
    • An apparatus for dynamically allocating memory includes a processor, a free buffer pool memory and a control memory which stores control block data structures. The control block data structures enable a segmentation of the free buffer pool memory into a series of free buffer pools, each free buffer pool comprising plural identical size buffers, each succeeding free buffer pool including a larger buffer size than a preceding free buffer pool. A selection size parameter for a given free buffer pool is a value that is larger than the buffer size comprising the given free buffer pool, but less than a next larger buffer size in the next of the series of free buffer pools. A memory allocation procedure responds to a request from an executing procedure for allocation of buffer space by: (i) allocating a buffer from a free buffer pool memory whose associated selection size parameter is a next larger value than the buffer space that was requested; (ii) determining a difference between the allocated buffer size and the requested buffer space to find an unfulfilled amount of the requested buffer space; (iii) allocating a buffer from a free buffer pool memory whose selection size parameter is a next larger value, among selection size parameters, than the unfulfilled amount; and (iv) repeating ii and iii until the memory allocation procedure determines that there is no unfulfilled amount of the requested buffer space. The apparatus further includes "quickcell" memory which is allocated without use of control block data structures.
    • 用于动态分配存储器的装置包括处理器,空闲缓冲池存储器和存储控制块数据结构的控制存储器。 控制块数据结构使得可以将空闲缓冲池存储器分割成一系列空闲缓冲池,每个空闲缓冲池包括多个相同大小的缓冲器,每个随后的空闲缓冲池包括比先前的空闲缓冲池大的缓冲器大小。 给定可用缓冲池的选择大小参数是大于包含给定可用缓冲池的缓冲区大小的值,但小于下一个空闲缓冲池系列中的下一个较大缓冲区大小的值。 存储器分配过程响应来自用于分配缓冲器空间的执行过程的请求,其通过以下步骤来响应:(i)从相关选择大小参数是比所请求的缓冲空间更大的值的空闲缓冲池存储器分配缓冲器; (ii)确定所分配的缓冲器大小与所请求的缓冲器空间之间的差异,以找到所请求的缓冲空间的未实现量; (iii)从选择大小参数中选择大小参数为选择大小参数的空闲缓冲池存储器中分配缓冲器,而不是未实现的量; 和(iv)重复ii和iii,直到存储器分配过程确定没有未实现的所请求的缓冲空间量。 该装置还包括在不使用控制块数据结构的情况下分配的“快速小区”存储器。