会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明授权
    • Balanced channel finding method
    • 平衡渠道查找方法
    • US4435755A
    • 1984-03-06
    • US334991
    • 1981-12-28
    • Allan S. Meritt
    • Allan S. Meritt
    • G06F13/12G06F13/40G06F3/00
    • G06F13/4022G06F13/122
    • For a CPU I/O request, the disclosed methods find a physical channel path within a logical channel (LCH) likely to be connectable to a requested device by using channel path count (CAT count) fields. The CAT counts respectively indicate the current number of uncompleted requests accepted by the respective physical channels in the data processing system. An available physical channel in the LCH with the smallest CAT count is found as the candidate channel path for a connection attempt to the requested device. If the lowest CAT count is equal for plural available channel paths, any of these plural channel paths may be selected as the candidate channel path. The CAT count for a channel path is incremented for each successful connection of any device to that channel path. The CAT count for a channel path is decremented upon receiving a signal indicating that a successfully connected I/O device has completed the operation for a request. CAT counts indicate the current load on each physical channel across all LCHs in which the physical channels may be contained. The CAT counts indicate the relative likelihood of the physical channels within a LCH being non-busy relative to each other in order to find the channel path most likely to be non-busy and thereby avoid a RPS miss when a requested DASD record is reached during disk rotation. Choosing the channel paths with the lowest available CAT counts balances the load among the physical channels across all LCHs containing the same physical channel.
    • 对于CPU I / O请求,所公开的方法通过使用信道路径计数(CAT计数)字段找到可能可连接到所请求的设备的逻辑信道(LCH)内的物理信道路径。 CAT计数分别表示数据处理系统中相应物理信道接受的当前未完成请求数。 找到具有最小CAT计数的LCH中的可用物理信道作为到所请求设备的连接尝试的候选信道路径。 如果对于多个可用信道路径,最低的CAT计数相等,则可以选择这些多个信道路径中的任一个作为候选信道路径。 每个成功连接任何设备到该通道路径的通道路径的CAT计数递增。 当接收到指示成功连接的I / O设备已经完成了请求的操作的信号时,通道路径的CAT计数递减。 CAT计数表示跨物理通道可能包含的所有LCH的每个物理信道上的当前负载。 CAT计数指示LCH内的物理信道相对于彼此不相关的相对似然性,以便找到最可能是非忙的信道路径,从而在达到所请求的DASD记录时避免RPS丢失 磁盘旋转。 选择具有最低可用CAT计数的信道路径平衡包含相同物理信道的所有LCH的物理信道之间的负载。
    • 16. 发明授权
    • Method for requesting identification of a neighbor node in a data
processing I/O system
    • 在数据处理I / O系统中请求识别邻居节点的方法
    • US5371897A
    • 1994-12-06
    • US750356
    • 1991-08-27
    • Paul J. BrownKenneth J. Fredericks, Sr.Eugene P. HefferonGerald T. MoffittAllan S. Meritt
    • Paul J. BrownKenneth J. Fredericks, Sr.Eugene P. HefferonGerald T. MoffittAllan S. Meritt
    • G06F13/14G06F13/00H04L29/00
    • H04L29/00
    • A method for acquiring the node identifier of a node in a data processing input/output (I/O) system having a plurality of nodes. This procedure is part of the initialization of each node in the I/O system and may be used to establish the configuration of the I/O system such that if a connection breaks or a fault occurs between nodes, the configuration can be confirmed after the break or fault is corrected. This prevents data from being sent to the wrong device if lines were connected in a different configuration during the correction of a fault. The node identifier is a worldwide-unique identifier such that only one node is identified by a node identifier. The node identifier contains a validity code that specifies if the node identifier is valid. Also disclosed is a retry procedure for retrying the acquisition of a node identifier if the acquired node identifier is not valid, and a deferral procedure which defers the retry procedure if a link is not available.
    • 一种用于获取具有多个节点的数据处理输入/输出(I / O)系统中的节点的节点标识符的方法。 该过程是I / O系统中每个节点的初始化的一部分,可用于建立I / O系统的配置,以便如果连接中断或节点之间发生故障,则可以在 故障或故障已更正。 这可以防止在校正故障期间将线路连接到不同配置中时将数据发送到错误的设备。 节点标识符是全球唯一的标识符,使得仅一个节点由节点标识符标识。 节点标识符包含指定节点标识符是否有效的有效性代码。 还公开了如果获取的节点标识符无效,则重试对节点标识符的获取的重试过程,以及如果链路不可用则延迟重试过程的延迟过程。
    • 17. 发明授权
    • System for dynamic association of a variable number of device addresses
with input/output devices to allow increased concurrent requests for
access to the input/output devices
    • 用于将可变数量的设备地址与输入/输出设备动态关联的系统,以允许增加对访问输入/输出设备的并发请求
    • US5530897A
    • 1996-06-25
    • US130218
    • 1993-10-01
    • Allan S. Meritt
    • Allan S. Meritt
    • G06F13/12G06F13/00G06F13/14G06F13/38
    • G06F13/122
    • Disclosed is a data processing system for presenting concurrent requests for access to peripheral devices up to the number of subchannels available for handling input/output operations. A computer system provides a plurality of subchannels and affiliated unit control blocks for input/output operations between main storage and the peripheral devices. The unit control blocks comprise two groups, including a first dedicated to the peripheral devices and a second group available for dynamic association with the peripheral devices on a demand basis. The unit control blocks are termed base unit control blocks and alias unit control blocks, respectively. Upon system initialization, alias unit control blocks for a given logical subsystem are linked in a free pool. To initiate an input/output operation a program executing on the CPU first queries a base unit control block for a target peripheral device to determine its availability. If available, the base unit control block and associated base subchannel are used for the input/output operation. If not, determination is made if an alias unit control block may be used and if any are available. Responsive to affirmative determinations, an alias unit control block is removed from the free pool and is linked to the base unit control device for the target peripheral device in an exposure chain. The CPU then places a channel program in main storage including a prefix channel command for binding an alias address for the alias unit control block with a particular device. This is done by passing the binding command to a controller for the target peripheral device which maintains tables of affiliations between aliases and peripheral devices on a path group basis. After binding, the input/output operation proceeds in conventional fashion.
    • 公开了一种数据处理系统,用于呈现用于访问外围设备的并发请求,直到可用于处理输入/输出操作的子信道的数量。 计算机系统为主存储器和外围设备之间的输入/输出操作提供多个子信道和附属单元控制块。 单元控制块包括两组,包括专用于外围设备的第一组和可根据需要与外围设备动态关联的第二组。 单元控制块分别称为基本单元控制块和别名单元控制块。 在系统初始化时,给定逻辑子系统的别名单元控制块在可用池中进行链接。 为了启动输入/输出操作,在CPU上执行的程序首先查询目标外围设备的基本单元控制块以确定其可用性。 如果可用,基本单元控制块和相关联的基本子信道用于输入/输出操作。 如果没有,则确定是否可以使用别名单元控制块,如果有可用的话。 响应于肯定性确定,从空闲池中移除别名单元控制块,并将其链接到暴露链中的目标外围设备的基本单元控制设备。 然后,CPU将信道节目放置在主存储器中,包括前缀信道命令,用于将特定设备的别名单元控制块的别名地址绑定。 这通过将绑定命令传递给目标外围设备的控制器,该控制器在路径组的基础上维护别名和外围设备之间的关联表。 装订后,输入/输出操作以常规方式进行。
    • 18. 发明授权
    • Apparatus and accompanying method for use in a sysplex environment for
performing escalated isolation of a sysplex component in the event of a
failure
    • 在sysplex环境中使用的装置和相关方法,用于在发生故障时执行sysplex组件的升级隔离
    • US5416921A
    • 1995-05-16
    • US147351
    • 1993-11-03
    • Jeffrey A. FreyLisa M. GoetzeAllan S. MerittJeffrey M. NickWilliam C. ShepardDavid H. SurmanMichael D. Swanson
    • Jeffrey A. FreyLisa M. GoetzeAllan S. MerittJeffrey M. NickWilliam C. ShepardDavid H. SurmanMichael D. Swanson
    • G06F11/20
    • G06F11/2035G06F11/2046
    • Apparatus and accompanying methods for use in preferably a multi-system shared data (sysplex (5)) environment which quickly and efficiently isolates (fences), through a pre-defined hierarchical order, failed sysplex components from accessing shared data in order to protect data integrity. Specifically, by dividing a sysplex workload into specified fence groups (FG A, FG B) and providing appropriate software and hardware fence support, fencing can occur at various distinct levels: a member-to-member level, i.e. to allow any member (220, 225, 230, 233,237) of a fence group to fully isolate any other ("target") member of that same group; a fence group level, i.e. to isolate all members of a fence group that execute on a "target" system (200.sub.1, 200.sub.2, 200.sub.3); and a system level, i.e. to fully isolate an entire "target" system. Through pre-defined escalation rules (630), fencing can be escalated from a lower member level to a higher, group or system, level in the event a lower level fence can not be successfully imposed. Member level fencing is accomplished in software (1300, 1500); group and system level fencing is accomplished through dedicated hardware fencing facilities (44). An identifier (444, 464) uniquely designates each different fence group existing on a computer processing complex (CPC) (40.sub.1, 40.sub.2, 40.sub.3, 40.sub.M) in the sysplex over the life of that CPC. Advantageously, this technique eliminates erroneous back level fencing, significantly expedites fence processing and also greatly reduces a need for human intervention.
    • 用于优选多系统共享数据(sysplex(5))环境的装置和伴随方法通过预定义的分级顺序快速有效地隔离(围栏)使得系统组件不能访问共享数据以保护数据 诚信 具体来说,通过将系统工作负载划分为指定的栅栏组(FG A,FG B)并提供适当的软件和硬件围栏支持,防护可以在各种不同的级别发生:成员级别,即允许任何成员(220 ,225,230,233,237),以完全隔离同一组的任何其他(“目标”)成员; 围墙组级别,即隔离在“目标”系统上执行的围栏组的所有成员(2001,2002,2003); 和系统级别,即完全隔离整个“目标”系统。 通过预定义的升级规则(630),如果无法成功施加较低级别的围栏,则围栏可以从较低的成员级别升级到较高的组或系统级别。 成员级围栏是用软件完成的(1300,1500); 组和系统级围栏通过专用的硬体围栏设施完成(44)。 标识符(444,446)唯一地指定存在于该CPC的整个生命周期中的系统复合体中的计算机处理复合体(CPC)(401,402,403,40M)上的每个不同的栅栏组。 有利的是,这种技术消除了错误的背面水平围栏,显着地加快了围栏处理,并且还大大降低了人为干预的需要。