会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Methods and apparatus for dynamically managing input/output (I/O)
connectivity
    • 用于动态管理输入/输出(I / O)连接的方法和装置
    • US5297262A
    • 1994-03-22
    • US964571
    • 1992-10-21
    • Michael C. CoxRichard CwiakalaJean-Louis FavaGary A. Fisher, Sr.Robert J. GallagherEugene P. HefferonKarl H. HoppePeter I. KaniaMartin W. Sachs
    • Michael C. CoxRichard CwiakalaJean-Louis FavaGary A. Fisher, Sr.Robert J. GallagherEugene P. HefferonKarl H. HoppePeter I. KaniaMartin W. Sachs
    • G06F13/14G06F13/40G06F15/173G06F13/00
    • G06F15/17375G06F13/4022
    • A computer system, including at least one host (processor and operating system), a channel subsystem and at least one switch (together with an associated switch controller) for switchably connecting an I/O device (together with an associated I/O device control unit) to a host via said channel subsystem, in combination with means for dynamically managing I/O connectivity in said computer from each host. The I/O manager's functions are centralized at the host level across the computer system. Each host is responsible for an instance of the manager. According to the preferred embodiment of the invention the computer system, I/O manager combination includes: (a) first means, located within each switch, for providing direct host access to the switch controller associated with a given switch; (b) second means, included in each host level instance of the manager, for automatically and dynamically determining the current I/O configuration and connectivity of each host; (c) third means, included in each host level instance of the manager, for performing System Integrated Switching (i.e., switching where any instance of the I/O manager can veto a proposed configuration change) and (d) fourth means, included in each host level instance of the manager, for insuring the integrity of the I/O connectivity database, through the use of an interlock mechanism, in a multiuser environment where each user can enter multiple part commands and processes concurrently.
    • 计算机系统,包括至少一个主机(处理器和操作系统),通道子系统和至少一个开关(以及相关联的开关控制器),用于可切换地连接I / O设备(连同相关的I / O设备控制 单元)通过所述通道子系统与主机结合,用于从每个主机动态管理所述计算机中的I / O连接的装置。 I / O管理器的功能集中在整个计算机系统的主机层。 每个主持人负责管理员的一个实例。 根据本发明的优选实施例,计算机系统I / O管理器组合包括:(a)位于每个开关内的第一装置,用于提供与给定开关相关联的开关控制器的直接主机访问; (b)包括在管理器的每个主机级实例中的第二装置,用于自动和动态地确定每个主机的当前I / O配置和连接性; (c)包括在管理者的每个主机级实例中的第三手段,用于执行系统集成交换(即,I / O管理器的任何实例可以否决所提出的配置更改的切换)和(d)包括在第 管理器的每个主机级实例,用于通过使用互锁机制来确保I / O连接数据库的完整性,在多用户环境中,每个用户可以同时输入多个部分命令和进程。
    • 3. 发明授权
    • Method and system for dynamically managing hash pool data structures
    • 动态管理哈希池数据结构的方法和系统
    • US06748401B2
    • 2004-06-08
    • US09974977
    • 2001-10-11
    • Robert A. BlackburnRobert O. DryfoosGary A. Fisher, Sr.Glenn W. Sears, Jr.
    • Robert A. BlackburnRobert O. DryfoosGary A. Fisher, Sr.Glenn W. Sears, Jr.
    • G06F700
    • G06F17/30949Y10S707/99945Y10S707/99948
    • An exemplary embodiment of the present invention is a method for dynamically managing a hash pool data structure. A request to insert a new key value into a hash pool data structure that includes at least one index level is received. An insertion location is calculated for the new key value in response to the new key value and to existing key values in the hash pool data structure. The insertion location includes an index level. A new index level is added at the insertion location if the index level is not the maximum number of index levels in the hash pool data structure; if the insertion location contains a chain of existing key values with a length equal to the maximum chain length; and if the new index record locations of the new key value and the existing key values are dispersed. The insertion location is updated in response to adding a new index record and the new key value is inserted into the insertion location. An additional embodiment includes a system and storage medium for dynamically managing a hash pool data structure.
    • 本发明的示例性实施例是用于动态管理散列池数据结构的方法。 接收到将包含至少一个索引级别的新密钥值插入散列池数据结构的请求。 针对新密钥值计算新密钥值的插入位置以及散列池数据结构中的现有密钥值。 插入位置包括索引级别。 如果索引级别不是哈希池数据结构中的索引级别的最大数目,则在插入位置添加新的索引级别; 如果插入位置包含长度等于最大链长度的现有密钥值链; 并且如果新键值的新索引记录位置和现有键值分散。 响应于添加新的索引记录而更新插入位置,并且将新的键值插入插入位置。 另外的实施例包括用于动态管理散列池数据结构的系统和存储介质。