会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Distributed computing network
    • 分布式计算网络
    • US5640504A
    • 1997-06-17
    • US185625
    • 1994-01-24
    • Harold E. Johnson, Jr.
    • Harold E. Johnson, Jr.
    • G06F11/00H04L12/56H04L29/06H04L29/08
    • H04L29/06H04L45/00G06F11/1417H04L69/32
    • A distributed computing network has a packet routing system for routing packets among packet lists accessible to tasks. Packets are routed and attached to lists identified within a packet header or selected from router tables. Access to packet lists is managed according to data stored within packet list headers. Several types of packets are used for exchanging data, executing remote instructions, maintaining communication between network nodes, and supplying initialization instructions to network nodes. An inductive booting mechanism uses the packet routing system to initialize nodes and to re-boot failed nodes. Interface tasks manage transmission and reception of packets between nodes in order to provide asynchronous communication between tasks in a multitasking distributed computing environment.
    • 分布式计算网络具有用于在可访问的任务的分组列表之间路由分组的分组路由系统。 数据包路由并附加到数据包头中标识或从路由器表中选择的列表。 根据数据包列表头中存储的数据来管理对数据包列表的访问。 使用几种类型的数据包来交换数据,执行远程指令,维护网络节点之间的通信,并向网络节点提供初始化指令。 感性启动机制使用分组路由系统来初始化节点并重新引导失败的节点。 接口任务管理节点之间的数据包的传输和接收,以便在多任务分布式计算环境中提供任务之间的异步通信。
    • 4. 发明授权
    • Threaded, height-balanced binary tree data structure
    • 螺纹,高度平衡的二叉树数据结构
    • US5557786A
    • 1996-09-17
    • US185436
    • 1994-01-24
    • Harold E. Johnson, Jr.
    • Harold E. Johnson, Jr.
    • G06F17/30G06F7/00
    • G06F17/30961Y10S707/99942
    • A hierarchical data structure is provided in the form of a tree for storing key-indexed entries. Each entry of the tree includes a balance bias indicator and pointer fields for maintaining (i) link pointers to successive entries in the hierarchy or (ii) thread pointers to preceding entries in the hierarchy. Entries are added to the tree, or removed from the tree, while the tree is maintained in a height-balanced condition. During insertion of a new entry, the tree is traversed along a search path to determine an insertion point for the entry and to determine a potential rebalancing point in the tree. The potential rebalancing point in the tree is identified on the basis of the balance bias indicators of the entries in the search path. The tree is rebalanced, if necessary, about the potential rebalancing point determined during the insertion traversal.
    • 以树形式提供分层数据结构,用于存储密钥索引条目。 树的每个条目包括平衡偏差指示符和指针字段,用于维护(i)将指针链接到层级中的连续条目,或者(ii)线程指针到层次结构中的先前条目。 条目被添加到树中,或从树中删除,同时树保持在高度平衡状态。 在插入新条目期间,树沿搜索路径遍历,以确定条目的插入点并确定树中的潜在重新平衡点。 根据搜索路径中条目的平衡偏差指标,确定树中潜在的重新平衡点。 如果需要,树将重新平衡插入遍历期间确定的潜在重新平衡点。