公开(公告)号：US5579475A

公开(公告)日：1996-11-26

申请号：US518955

申请日：1995-08-24

申请人： Miguel M. Blaum ,  James T. Brady ,  Jehoshua Bruck ,  Jaishankar M. Menon

发明人： Miguel M. Blaum ,  James T. Brady ,  Jehoshua Bruck ,  Jaishankar M. Menon

IPC分类号： G06F11/10 ,  G06F11/20 ,  G11B20/18 ,  G11C29/00 ,  H03M13/11 ,  G06F11/34

CPC分类号： G11C29/88 ,  G06F11/1076 ,  G11B20/1833 ,  H03M13/11 ,  G06F11/1012

摘要： The data contents of up to two concurrently failed or erased DASDs can be reconstituted where the data is distributed across M DASDs as an (M-1)*M block array and where (1) the (M-1)st DASD contains the simple parity taken over each of the array diagonals in diagonal major order in the same mode (odd/even) as that exhibited by the major diagonal of the array and (2) where the M-th DASD contains the simple even parity over each of the rows in row major order. Relatedly, short write updates require fewer operations for data blocks located off the major data array diagonal.

摘要翻译： 最多两个并发故障或擦除的DASD的数据内容可以重新组合，其中数据作为（M-1）* M块阵列分布在M DASD上，其中（1）（M-1）st DASD包含简单 在与阵列的主对角线所显示的相同模式（奇数/偶数）中的对角线主序列中的每个阵列对角线上获得的奇偶校验，以及（2）其中第M个DASD包含每个阵列对角线上的简单偶数奇偶校验 行行主要顺序。 相关地，对于位于主数据阵列对角线上的数据块，短写入更新需要更少的操作。

公开(公告)号：US5577211A

公开(公告)日：1996-11-19

申请号：US241920

申请日：1994-05-11

申请人： Narasimhareddy L. Annapareddy ,  James T. Brady ,  Damon W. Finney ,  Richard F. Freitas ,  Michael H. Hartung ,  Michael A. Ko ,  Noah R. Mendelsohn ,  Jaishankar M. Menon ,  David R. Nowlen ,  Shin-Yuan Tzou

发明人： Narasimhareddy L. Annapareddy ,  James T. Brady ,  Damon W. Finney ,  Richard F. Freitas ,  Michael H. Hartung ,  Michael A. Ko ,  Noah R. Mendelsohn ,  Jaishankar M. Menon ,  David R. Nowlen ,  Shin-Yuan Tzou

IPC分类号： G06F13/00 ,  H04L29/06 ,  G06F13/38 ,  G06F15/16

CPC分类号： H04L29/06

摘要： A computing system includes plural nodes that are connected by a communications network. Each node comprises a communications interface that enables an exchange of messages with other nodes. A ready queue is maintained in a node and includes plural message entries, each message entry indicating an output message control data structure. The node further includes memory for storing plural output message control data structures, each including one or more chained further monrtol data structures that define data comprising a message or a portion of a message that is to be dispatched. Control data structures that are chained from an output messsage control data structure exhibit a sequence dependincy. A processor is controlled by the ready queue and enables dispatch of portions of the message designated by an output message control data structure and associated further control structures. The processor prevents dispatch of one portion of a message prior to dispatch of another portion of the message upon which the first portion is dependent even if message transmissions are interrupted.

摘要翻译： 计算系统包括通过通信网络连接的多个节点。 每个节点包括能够与其他节点交换消息的通信接口。 在节点中维护就绪队列，并且包括多个消息条目，每个消息条目指示输出消息控制数据结构。 该节点还包括用于存储多个输出消息控制数据结构的存储器，每个包括一个或多个链接的另外的monrtol数据结构，该数据结构定义包括要发送的消息或消息的一部分的数据。 从输出消息控制数据结构链接的控制数据结构表现出序列依赖性。 处理器由就绪队列控制，并且使得能够分派由输出消息控制数据结构和相关联的进一步控制结构指定的消息的部分。 即使消息传输被中断，处理器在发送消息的另一部分之前防止了第一部分依赖于消息的一部分的分派。

公开(公告)号：US5263145A

公开(公告)日：1993-11-16

申请号：US528999

申请日：1990-05-24

申请人： James T. Brady ,  Ruth E. Cintron ,  Stephen Goldstein ,  Jean H. Wang Ju ,  Jaishankar M. Menon

发明人： James T. Brady ,  Ruth E. Cintron ,  Stephen Goldstein ,  Jean H. Wang Ju ,  Jaishankar M. Menon

IPC分类号： G06F3/06 ,  G06F11/10 ,  G06F13/42 ,  G11B20/10 ,  G11B20/18 ,  G06F12/02

CPC分类号： G06F11/1076 ,  G06F11/1008 ,  G06F3/0601 ,  G11B20/10 ,  G11B20/1833 ,  G06F2003/0692

摘要： A method and means for managing access to a logical track of KN blocks of which K are parity blocks. The KN blocks are distributed and stored in an array of N DASDs having K blocks per physical track per DASD. The array includes control means for securing synchronous access to selectable ones of the DASDs responsive to each access request. The method involves (a) formatting the blocks onto the array using a row major order modulus as the metric for balancing the data rate and concurrency (the number of DASDs bound per access) and (b) executing the random sequences of large and small access requests over the array.

公开(公告)号：US5706443A

公开(公告)日：1998-01-06

申请号：US241904

申请日：1994-05-11

申请人： James T. Brady ,  Damon W. Finney ,  Michael H. Hartung ,  Donald J. Lang ,  Jaishankar M. Menon ,  David R. Nowlen ,  Calvin K. Tang

发明人： James T. Brady ,  Damon W. Finney ,  Michael H. Hartung ,  Donald J. Lang ,  Jaishankar M. Menon ,  David R. Nowlen ,  Calvin K. Tang

IPC分类号： G06F13/12 ,  G06F5/06 ,  G06F13/38 ,  G06F13/00

CPC分类号： G06F5/06

摘要： A system that enables pipelining of data to and from a memory includes multiple control block data structures which indicate amounts of data stored in the memory. An input port device receives and stores in memory, data segments of a received data message and only updates status information in the software control blocks when determined quantities of the data segments are stored. An output port is responsive to a request for transmission of a portion of the received data and to a signal from the input port that at least a first control count of data segments of the received data are present in memory. The output port then outputs the stored data segments from memory but discontinues the action if, before the required portion of the received data is outputted, software control blocks indicate that no further stored data segments are available for outputting. The input port then updates the software control blocks when newly arrived and stored data segments reach a second control count value, the updating occurring irrespective of whether the determined quantity of the received data has been stored in memory.

摘要翻译： 使得数据能够流向存储器和从存储器流出的系统包括指示存储在存储器中的数据量的多个控制块数据结构。 输入端口设备在存储器中接收并存储接收的数据消息的数据段，并且仅在存储确定的数据段的数量时才更新软件控制块中的状态信息。 输出端口响应于对接收到的数据的一部分的传输的请求和来自输入端口的信号，接收到的数据的数据段的至少第一控制计数存在于存储器中。 然后，输出端口从存储器输出存储的数据段，但是如果在输出所接收的数据的所需部分之前，软件控制块指示没有进一步存储的数据段可用于输出，则停止该动作。 然后，当新到达时，输入端口更新软件控制块，并且存储的数据段达到第二控制计数值，无论所确定的接收数据量是否已被存储在存储器中，更新发生。

公开(公告)号：US5488701A

公开(公告)日：1996-01-30

申请号：US340977

申请日：1994-11-17

申请人： James T. Brady ,  Jaishankar M. Menon

发明人： James T. Brady ,  Jaishankar M. Menon

IPC分类号： G06F3/06 ,  G06F11/10 ,  G06F12/02 ,  G11C29/00 ,  G06F11/34

CPC分类号： G11C29/74 ,  G06F11/1088 ,  G06F12/023 ,  G06F2003/0697 ,  G06F3/0601

摘要： In a log structured array (LSA) storage subsystem, a method for recovering from a storage device failure which incorporates the LSA write and garbage collection procedures, thereby simplifying the recovery process and eliminating the need for dedicated or distributed sparing schemes. Data is distributed across the array in N+P parity groups. Upon a device failure, each lost data block is reconstructed from the remaining blocks of its parity group. The reconstructed block is then placed in the subsystem write buffer to be processed with incoming write data, and new parity is generated for the remaining N-1 data blocks of the group. A lost parity block is replaced by first moving one of the data blocks of its parity group to the write buffer, and then generating new parity for the remaining N-1 data blocks. Also disclosed is a storage subsystem implementing the preceding recovery method.

摘要翻译： 在日志结构化阵列（LSA）存储子系统中，一种从存储设备故障中恢复的方法，其中包含了LSA写入和垃圾收集过程，从而简化了恢复过程，并且消除了对专用或分布式备份方案的需求。 数据在N + P个奇偶校验组中分布在阵列中。 在设备故障时，从其奇偶校验组的剩余块重构每个丢失的数据块。 然后将重建的块放置在子系统写入缓冲器中，以进入写入数据进行处理，并为该组的剩余N-1个数据块生成新的奇偶校验。 丢失的奇偶校验块被首先将其奇偶校验组的数据块中的一个移动到写缓冲器，然后为剩余的N-1个数据块生成新的奇偶校验。 还公开了实现上述恢复方法的存储子系统。

公开(公告)号：US06923369B2

公开(公告)日：2005-08-02

申请号：US10611017

申请日：2003-07-01

申请人： James T. Brady ,  Anthony A. Shah-Nazaroff

发明人： James T. Brady ,  Anthony A. Shah-Nazaroff

IPC分类号： G06K5/00 ,  G06Q20/38 ,  G06Q30/02 ,  G07C9/00

CPC分类号： G06Q30/02 ,  G06Q20/385 ,  G06Q20/387 ,  G07C9/00031

摘要： A system and method for constructing an ID code for a loyalty program from non-restricted information from a payment card or other ID card having restricted information.

摘要翻译： 一种用于从具有受限制信息的支付卡或其他身份证件的非限制性信息构建忠诚度计划的ID代码的系统和方法。

公开(公告)号：US6041049A

公开(公告)日：2000-03-21

申请号：US852019

申请日：1997-05-06

申请人： James T. Brady

发明人： James T. Brady

IPC分类号： H04L12/56 ,  H04J1/16

CPC分类号： H04L45/02

摘要： A method enables each node in a multi-nodal network to construct a routing table to all other nodes in the network. Each "home" or originating node performs a method which includes the steps of: transmitting a query to all immediate neighbor nodes and recording in a routing table, responses received which identify the neighbor node at the terminus of each link; transferring to each neighbor node, home node routing table entries and receiving routing table entries from each neighbor node; and, for each routing table entry to a node that is received from a neighbor node, if the route indicator is already present in the home node routing table, ignoring the entry; if the new entry indicates a route to a new node, entering the new node and a route identifier; and if the entry indicates a route to a node for which there is already an entry in the home node routing table, noting the new entry as a lower priority route to the node. Once the aforementioned procedure is repeated a number of times, each node in the multi-nodal network includes routes to all nodes in the network, with the routes having automatically been prioritized in accordance by sequence of receipt.

摘要翻译： 一种方法使多节点网络中的每个节点能够构建到网络中所有其他节点的路由表。 每个“归属”或始发节点执行一种方法，该方法包括以下步骤：向所有直接相邻节点发送查询并在路由表中记录识别每个链路的终点处的邻居节点的响应; 向每个邻居节点传送主节点路由表条目和从每个相邻节点接收路由表条目; 并且对于从邻居节点接收到的节点的每个路由表条目，如果路由指示符已经存在于归属节点路由表中，则忽略该条目; 如果新条目指示到新节点的路由，输入新节点和路由标识符; 并且如果条目指示到家庭节点路由表中已经存在条目的节点的路由，则将新条目注意为到节点的较低优先级路由。 一旦上述过程重复多次，多节点网络中的每个节点包括到网络中的所有节点的路由，其中​​路由已经根据接收顺序自动被优先化。

公开(公告)号：US6000009A

公开(公告)日：1999-12-07

申请号：US851109

申请日：1997-05-06

申请人： James T. Brady

发明人： James T. Brady

IPC分类号： G11B20/10 ,  G06F3/06 ,  G06F12/00 ,  G11B20/00 ,  G06F12/02 ,  G06F13/00

CPC分类号： G06F3/0608 ,  G06F3/0644 ,  G06F3/0689 ,  G11B20/00007

摘要： A system and method allocates disk memory space for storage of compressed records and enables the compressed records to be stored in sequential physical positions on the disk memory space. The method and apparatus further assures a substantial likelihood that compressed, updated records will fit in the originally allocated physical positions during subsequent processing. The method comprises: compressing a record; determining a compression ratio (CR) value and a maximum run length (RL) of contiguous identical data segments in the uncompressed record; determining a corrected compression ratio (CCR) by repeating compression of the record without the RL of contiguous identical data segments included in the record; and if the CCR value is less than a historically experienced record compression ratio, employing the CCR value to allocate memory space for the compressed record. If CCR value equals or exceeds the ECR value, the ECR value is utilized to allocate memory space for the record.

摘要翻译： 系统和方法分配用于存储压缩记录的磁盘存储空间，并使压缩记录能够存储在磁盘存储空间的连续物理位置上。 该方法和装置进一步确保在后续处理期间压缩的更新记录将适合于原始分配的物理位置的可能性。 该方法包括：压缩记录; 确定未压缩记录中连续相同数据段的压缩比（CR）值和最大游程长度（RL）; 通过重复所述记录的压缩而不包括在所述记录中的连续的相同数据段的RL来确定校正压缩比（CCR）; 并且如果CCR值小于历史上经验的记录压缩率，则使用CCR值来分配用于压缩记录的存储空间。 如果CCR值等于或超过ECR值，则使用ECR值为记录分配内存空间。

公开(公告)号：US5649112A

公开(公告)日：1997-07-15

申请号：US593551

申请日：1996-01-30

申请人： John D. Yeager ,  Lawrence Y. Ho ,  Chester R. Stevens ,  James T. Brady ,  David T. Wang

发明人： John D. Yeager ,  Lawrence Y. Ho ,  Chester R. Stevens ,  James T. Brady ,  David T. Wang

IPC分类号： G06F15/16 ,  G06F9/06 ,  G06F9/24 ,  G06F9/445 ,  G06F13/00 ,  G06F15/177 ,  H04L29/06 ,  G06F13/42

CPC分类号： G06F8/67 ,  G06F9/24 ,  H04L29/06

摘要： Updating of control code is accomplished in multiple nodes of a computing system while the computing system remains in operation. Each node includes a processor, memory, a first version of a control code unit and an engineering change level indication for the control code unit. The method comprises the steps of: installing a revised version of the control code unit with converter code modules in a first node, the converter code modules enabling and performing first and second interface functions during communications between the first node and other nodes in the system. The first node is then operated to perform a function which requires communication with other nodes, the converter code module in the first node initially determining an engineering change level value stored in another node and, if the engineering change level values in the nodes match, communicating with the other node through the first interface function. If the engineering change level values are found not to match, communications occur with the other node through the use of the second interface function, enabling both nodes to communicate even though different level code changes are present. A sequencer is also provided in the computing system which enables updating of all nodes in a specified sequence so as to simplify the requirements placed upon the converter code module.

摘要翻译： 在计算系统保持运行的同时，在计算系统的多个节点中完成控制代码的更新。 每个节点包括处理器，存储器，控制代码单元的第一版本和用于控制代码单元的工程变更级指示。 该方法包括以下步骤：在第一节点中安装具有转换器代码模块的控制代码单元的修订版本，转换器代码模块在系统中的第一节点和其他节点之间的通信期间启用并执行第一和第二接口功能。 然后操作第一节点以执行需要与其他节点通信的功能，第一节点中的转换器代码模块最初确定存储在另一个节点中的工程变更级别值，并且如果节点中的工程变化级别值匹配，则通信 与其他节点通过第一个接口功能。 如果发现工程变更级别不匹配，则通过使用第二接口功能与其他节点进行通信，即使存在不同级别的代码更改，也能够使两个节点进行通信。 在计算系统中还提供了定序器，其能够以指定的顺序更新所有节点，以便简化对转换器代码模块的要求。

公开(公告)号：US5574952A

公开(公告)日：1996-11-12

申请号：US241987

申请日：1994-05-11

申请人： James T. Brady ,  Jaishankar Menon

发明人： James T. Brady ,  Jaishankar Menon

IPC分类号： G06F3/06 ,  G06F12/00

CPC分类号： G06F3/0601 ,  G06F2003/0697 ,  Y10S707/99931

摘要： A data storage system and method for operating a disk controller, and also a disk controller operated in accordance with the method are disclosed. The method includes the steps of allocating a first amount of disk space for a compressed data unit as a first predetermined percentage of an uncompressed size of the data unit; and then increasing the allocation by a second predetermined percentage that is less than the first predetermined percentage to obtain a total amount of allocated disk space. The first predetermined percentage is a function of an expected compression ratio for the data unit, and the second predetermined percentage is a function of an expected change in the size of the compressed data unit as a result of an update operation performed on the data unit. The method further includes compressing the updated data unit; comparing the size of the compressed updated data unit to the total amount of allocated disk space; and if the size of the compressed updated data unit is equal to or less than the total amount of allocated disk space, storing the compressed updated data unit within the allocated disk space. Otherwise, if the size of the compressed updated data unit is greater than the total amount of allocated disk space, other disk space is allocated for storing the compressed data unit.

摘要翻译： 公开了一种用于操作盘控制器的数据存储系统和方法，以及根据该方法操作的盘控制器。 该方法包括以下步骤：为压缩数据单元分配第一数量的磁盘空间作为数据单元的未压缩大小的第一预定百分比; 然后将分配增加小于第一预定百分比的第二预定百分比，以获得所分配的盘空间的总量。 第一预定百分比是数据单元的期望压缩比的函数，并且第二预定百分比是作为对数据单元执行的更新操作的结果的压缩数据单元的大小的预期变化的函数。 该方法还包括压缩更新的数据单元; 将压缩的更新数据单元的大小与分配的磁盘空间的总量进行比较; 并且如果压缩更新数据单元的大小等于或小于分配的磁盘空间总量，则将压缩的更新数据单元存储在所分配的磁盘空间内。 否则，如果压缩更新数据单元的大小大于分配的磁盘空间总量，则分配其他磁盘空间来存储压缩数据单元。