会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • System and method for avoiding deadlock in multi-node network
    • 避免多节点网络死锁的系统和方法
    • US06490630B1
    • 2002-12-03
    • US09285316
    • 1999-04-02
    • Wing Leong PoonPatrick J. HellandTakeshi ShimizuYasushi UmezawaWolf-Dietrich Weber
    • Wing Leong PoonPatrick J. HellandTakeshi ShimizuYasushi UmezawaWolf-Dietrich Weber
    • G06F1516
    • G06F15/17
    • A computer architecture for avoiding a deadlock condition in an interconnection network comprises a messaging buffer having a size pre-calculated to temporarily store outgoing messages from a node. Messages are classified according to their service requirements and messaging protocols, and reserved quotas in the messaging buffer are allocated for different types of messages. The allocations of the reserved quotas are controlled by a mechanism that, to prevent overflow, limits the maximum number of messages that can be outstanding at any time. The messaging buffer is sized large enough to guarantee that a node is always able to service incoming messages, thereby avoiding deadlock and facilitating forward progress in communications. The buffer may be bypassed to improve system performance when the buffer is empty or when data in the buffer is corrupted. In addition, a multicast engine facilitates dense packing of the buffer and derives information from a message header to determine whether there is a multicast to perform and to permit passage of messages. Other considerations to reduce the buffer size are incorporated.
    • 用于避免互连网络中的死锁状况的计算机体系结构包括具有预先计算以便临时存储来自节点的传出消息的大小的消息传送缓冲器。 消息根据其服务要求和消息协议进行分类,消息缓冲区中的保留配额被分配给不同类型的消息。 保留配额的分配由一种机制来控制,为了防止溢出,可以限制任何时候可以发送的最大消息数。 消息传递缓冲区的大小足够大,以确保节点始终能够服务传入的消息,从而避免死锁并促进通信的前进进程。 当缓冲区为空或缓冲区中的数据被破坏时,可能会旁路缓冲区以提高系统性能。 此外,多播引擎促进了缓冲器的密集打包,并从消息头部导出信息,以确定是否存在要执行的多播并允许消息通过。 纳入了减少缓冲区大小的其他考虑因素。
    • 2. 发明授权
    • Asynchronous packet switching
    • 异步分组交换
    • US5959995A
    • 1999-09-28
    • US605677
    • 1996-02-22
    • Thomas M. WickiPatrick J. HellandTakeshi ShimizuWolf-Dietrich WeberWinfried W. Wilcke
    • Thomas M. WickiPatrick J. HellandTakeshi ShimizuWolf-Dietrich WeberWinfried W. Wilcke
    • G06F15/17H04L12/56H04J3/24
    • H04L45/00H04L45/34
    • A multiprocessor system includes a plurality of nodes and an interconnect that includes routers. Each node includes a reliable packet mover and a fast frame mover. The reliable packet mover provides packets to the fast frame mover which adds routing information to the packet to form a frame. The route to each node is predetermined. The frame is provided to the routers which delete the route from the routing information. If the frame is lost while being routed, the router discards the frame. If the packet is received at a destination node, the reliable packet mover in that node sends an acknowledgment to the source node if the packet passes an error detection test. The reliable packet mover in the source node resends the packet if it does not receive an acknowledgment in a predetermined time. The fast frame mover randomly selects the route from a plurality of predetermined routes to the destination node according to a probability distribution.
    • 多处理器系统包括多个节点和包括路由器的互连。 每个节点包括可靠的分组移动器和快速帧移动器。 可靠的分组移动器向快速帧移动器提供分组,其将路由信息添加到分组以形成帧。 到每个节点的路由是预定的。 该帧被提供给从路由信息中删除路由的路由器。 如果在路由时帧丢失,路由器将丢弃帧。 如果在目的地节点处接收到分组,则如果分组通过错误检测测试,则该节点中的可靠分组移动器向源节点发送确认。 如果源节点中的可靠的分组移动器在预定时间内没有接收到确认,则重新发送分组。 快速帧移动器根据概率分布从多个预定路由到目的地节点随机选择路由。
    • 4. 发明授权
    • System and method for dynamic network topology exploration
    • 动态网络拓扑探索的系统与方法
    • US5740346A
    • 1998-04-14
    • US605676
    • 1996-02-22
    • Thomas M. WickiPatrick J. HellandWolf-Dietrich WeberWinfried W. Wilcke
    • Thomas M. WickiPatrick J. HellandWolf-Dietrich WeberWinfried W. Wilcke
    • H04L12/56
    • H04L45/02
    • A system and method dynamically determines the topology of a source node routing network while having a minimal effect on network performance and without requiring expensive hardware to implement. A source node generates a ping frame. The source node transmits the ping frame to a first source router that is coupled to the source node. The first router transparently identifies the frame as a ping frame and creates an echo frame that is transmitted back to the source node. The first router identifies the port from which the ping frame is received and places this information in the header of the echo frame along with an echo frame identifier. The source node receives the echo frame and identifies routers and nodes to which a ping frame has not been sent based upon the connectivity information in the received echo frame. The source node continue generating and transmitting ping frame to all nodes and routers in the network. The source node identifies loops in the topology to avoid repetitive checking and identifies link and router failures. The topology exploration technique is transparent to the routers The topology exploration techique can be implemented during slow traffic periods with no increase in network latency or the technique can be implemented during high traffic periods and result in only a minimal increase in system latency because ping frames are small and are transparently sent to the control frame handler of the destination router or node.
    • 系统和方法动态地确定源节点路由网络的拓扑,同时对网络性能影响最小,而不需要昂贵的硬件来实现。 源节点生成ping帧。 源节点将ping帧发送到耦合到源节点的第一源路由器。 第一个路由器将该帧透明地识别为一个ping帧,并创建一个发送回源节点的回波帧。 第一个路由器识别从其接收ping帧的端口,并将该信息与回波帧标识符一起放置在回波帧的报头中。 根据所接收的回波帧中的连通性信息,源节点接收回波帧并识别尚未发送ping帧的路由器和节点。 源节点继续生成并发送Ping帧到网络中的所有节点和路由器。 源节点标识拓扑中的循环,以避免重复检查,并识别链路和路由器故障。 拓扑探索技术对于路由器是透明的。拓扑探索技术可以在较慢的流量周期内实现,而不会增加网络延迟,或者在高流量时段内可以实现该技术,并且只能使系统延迟最小化,因为ping帧 并且被透明地发送到目的地路由器或节点的控制帧处理器。