公开(公告)号：US5940612A

公开(公告)日：1999-08-17

申请号：US534585

申请日：1995-09-27

申请人： James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Noah R. Mendelsohn ,  Jaishankar Moothedath Menon ,  David R. Nowlen

发明人： James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Noah R. Mendelsohn ,  Jaishankar Moothedath Menon ,  David R. Nowlen

IPC分类号： G06F9/46 ,  G06F9/48 ,  G06F9/00

CPC分类号： G06F9/4881

摘要： A procedure controls execution of priority ordered tasks in a multi-nodel data processing system. The data processing system includes a node with a software-controlled processor and a hardware-configured queue-controller. The queue-controller includes a plurality of priority-ordered queues, each queue listing tasks having an assigned priority equal to a priority order assigned to the queue. The queue-controller responds to a processor generated order to queue a first task for execution, by performing a method which includes the steps of: listing said first task on a first queue having an assigned priority that is equal to a priority of said first task; if a second task is listed on a queue having a higher assigned priority, attempting execution of the second task before execution of the first task; if no tasks are listed on a queue having a higher assigned priority than said first queue, attempting execution of a first listed task in the first queue means; and upon completion of execution of the task or a stalling of execution of the task, attempting execution of a further task on the first queue only if another order has not been issued to place a task on a queue having a higher assigned priority. The method further handles chained subtasks by attempting execution of each subtask of a task in response to the processor generated order; and if execution of any subtask does not complete, attempting execution of another task in lieu of a subtask chained to the subtask that did not complete.

摘要翻译： 程序控制多节点数据处理系统中优先级排序任务的执行。 数据处理系统包括具有软件控制处理器和硬件配置的队列控制器的节点。 队列控制器包括多个优先级排序队列，每个队列列出具有分配给队列的优先顺序的分配优先级的任务。 队列控制器响应于处理器生成的顺序来排队第一任务以执行，方法是执行一种方法，该方法包括以下步骤：在具有等于所述第一任务的优先级的分配优先级的第一队列上列出所述第一任务 ; 如果在具有较高分配优先级的队列中列出第二任务，则在执行第一任务之前尝试执行第二任务; 如果在具有比所述第一队列更高的分配优先级的队列上列出任务，则尝试执行第一队列中的第一列出的任务; 并且在完成执行任务或停止执行任务时，只有当尚未发出另一个订单以将任务放置在具有较高分配优先级的队列上时，才尝试在第一队列上执行另外的任务。 该方法通过响应于处理器生成的顺序尝试执行任务的每个子任务来进一步处理链接子任务; 并且如果任何子任务的执行未完成，则尝试执行另一任务代替链接到未完成的子任务的子任务。

公开(公告)号：US5784698A

公开(公告)日：1998-07-21

申请号：US568180

申请日：1995-12-05

申请人： James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Noah R. Mendelsohn ,  Jaishankar Moothedath Menon ,  David R. Nowlen

发明人： James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Noah R. Mendelsohn ,  Jaishankar Moothedath Menon ,  David R. Nowlen

IPC分类号： G06F9/50 ,  G06F12/02

CPC分类号： G06F9/5016 ,  G06F12/023

摘要： An apparatus for dynamically allocating memory includes a processor, a free buffer pool memory and a control memory which stores control block data structures. The control block data structures enable a segmentation of the free buffer pool memory into a series of free buffer pools, each free buffer pool comprising plural identical size buffers, each succeeding free buffer pool including a larger buffer size than a preceding free buffer pool. A selection size parameter for a given free buffer pool is a value that is larger than the buffer size comprising the given free buffer pool, but less than a next larger buffer size in the next of the series of free buffer pools. A memory allocation procedure responds to a request from an executing procedure for allocation of buffer space by: (i) allocating a buffer from a free buffer pool memory whose associated selection size parameter is a next larger value than the buffer space that was requested; (ii) determining a difference between the allocated buffer size and the requested buffer space to find an unfulfilled amount of the requested buffer space; (iii) allocating a buffer from a free buffer pool memory whose selection size parameter is a next larger value, among selection size parameters, than the unfulfilled amount; and (iv) repeating ii and iii until the memory allocation procedure determines that there is no unfulfilled amount of the requested buffer space. The apparatus further includes "quickcell" memory which is allocated without use of control block data structures.

摘要翻译： 用于动态分配存储器的装置包括处理器，空闲缓冲池存储器和存储控制块数据结构的控制存储器。 控制块数据结构使得可以将空闲缓冲池存储器分割成一系列空闲缓冲池，每个空闲缓冲池包括多个相同大小的缓冲器，每个随后的空闲缓冲池包括比先前的空闲缓冲池大的缓冲器大小。 给定可用缓冲池的选择大小参数是大于包含给定可用缓冲池的缓冲区大小的值，但小于下一个空闲缓冲池系列中的下一个较大缓冲区大小的值。 存储器分配过程响应来自用于分配缓冲器空间的执行过程的请求，其通过以下步骤来响应：（i）从相关选择大小参数是比所请求的缓冲空间更大的值的空闲缓冲池存储器分配缓冲器; （ii）确定所分配的缓冲器大小与所请求的缓冲器空间之间的差异，以找到所请求的缓冲空间的未实现量; （iii）从选择大小参数中选择大小参数为选择大小参数的空闲缓冲池存储器中分配缓冲器，而不是未实现的量; 和（iv）重复ii和iii，直到存储器分配过程确定没有未实现的所请求的缓冲空间量。 该装置还包括在不使用控制块数据结构的情况下分配的“快速小区”存储器。

公开(公告)号：US5675736A

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

申请号：US685770

申请日：1996-07-24

申请人： James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Paul Wayne Hunter ,  Michael Anthony Ko ,  Donald J. Lang ,  Noah R. Mendelsohn ,  Jaishankar Moothedath Menon ,  David Ronald Nowlen

发明人： James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Paul Wayne Hunter ,  Michael Anthony Ko ,  Donald J. Lang ,  Noah R. Mendelsohn ,  Jaishankar Moothedath Menon ,  David Ronald Nowlen

IPC分类号： G06F13/14 ,  G06F13/00 ,  G06F15/16 ,  G06F15/177 ,  H04L12/56 ,  H04L29/04 ,  H04L29/06

CPC分类号： H04L29/06 ,  H04L45/22 ,  H04L45/28 ,  H04L69/14

摘要： A distributed data processing system includes a plurality of nodes interconnected by bidirectional communication links. Each node includes a control message line for handling of control messages and a control memory for storing the control messages. Each node further includes data message line for handling of data messages and a data memory for storing the data messages. A processor in the node causes the data message line to queue and dispatch data messages from the data memory and the control message line to queue and dispatch control messages from the control memory. Each node includes N bidirectional communication links enabling the node to have at least twice as much input/output bandwidth as the control message line and data message line, combined. An input/output switch includes a routing processor and is coupled between the N bidirectional communication links, the data message line and control message line. The input/output switch dispatches either a control message or a data message over at least one of the bidirectional communication links in accordance with an output from the routing control processor, thereby enabling each communication link to carry either data or control messages. If a communication link is busy with either a control or a data message, the routing control processor increments to another communication link to enable dispatch of a queued message.

摘要翻译： 分布式数据处理系统包括通过双向通信链路互连的多个节点。 每个节点包括用于处理控制消息的控制消息线和用于存储控制消息的控制存储器。 每个节点还包括用于处理数据消息的数据消息行和用于存储数据消息的数据存储器。 节点中的处理器使得数据消息行从数据存储器和控制消息行排队和调度数据消息，以从控制存储器排队和调度控制消息。 每个节点包括N个双向通信链路，使得该节点具有至少两倍于控制消息行和数据消息行的输入/输出带宽。 输入/输出开关包括路由处理器，并且耦合在N个双向通信链路，数据消息线路和控制消息线路之间。 输入/输出交换机根据来自路由控制处理器的输出，通过至少一个双向通信链路分派控制消息或数据消息，从而使得每个通信链路能够携带数据或控制消息。 如果通信链路忙于控制或数据消息，则路由控制处理器递增到另一个通信链路以启用排队消息的分派。

公开(公告)号：US5857213A

公开(公告)日：1999-01-05

申请号：US761639

申请日：1996-12-06

申请人： Michael T. Benhase ,  James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Donald J. Lang ,  Jaishankar Moothedath Menon

发明人： Michael T. Benhase ,  James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Donald J. Lang ,  Jaishankar Moothedath Menon

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

CPC分类号： G06F3/0608 ,  G06F3/064 ,  G06F3/0689

摘要： A method enables a host processor, which employs variable length (VL) records, to communicate with disk storage which employs fixed length (FL) sectors for storage of the VL records. The method comprises the steps of: a) deriving a first control data structure for an update VL record, the first control data structure including information describing segments of the update VL record; b) determining a disk track that includes a FL sector wherein am old VL record commences that corresponds to the update VL record; c) reading each FL sector in the disk track and creating a control data structure which includes information describing each VL record stored in the disk track; d) substituting in a control data structure for the old VL record that corresponds to the update VL record, information regarding update data from the first control data structure; e) recording in the disk track, data indicated by each control data structure determined in steps c) and d); and f) if the old VL record ends at other than a sector break of a FL sector, reblocking VL records into FL sectors which are recorded thereafter on the disk track. The invention also enables a read action to be accomplished in one rotation of a disk even though it commences at a FL sector that is not at the beginning of a VL record to be accessed.

摘要翻译： 一种方法使得采用可变长度（VL）记录的主机处理器与采用固定长度（FL）扇区的磁盘存储器通信以存储VL记录。 该方法包括以下步骤：a）导出更新VL记录的第一控制数据结构，所述第一控制数据结构包括描述更新VL记录段的信息; b）确定包括FL扇区的磁盘轨道，其中旧的VL记录开始对应于更新VL记录; c）读取磁盘轨道中的每个FL扇区并创建包括描述存储在磁盘轨道中的每个VL记录的信息的控制数据结构; d）用对应于更新VL记录的旧VL记录的控制数据结构替换关于来自第一控制数据结构的更新数据的信息; e）在盘轨道中记录由步骤c）和d）中确定的每个控制数据结构指示的数据; 以及f）如果旧的VL记录在FL扇区的扇区断点之外结束，则将VL记录重新锁定到其后记录在磁盘轨道上的FL扇区中。 本发明还使得能够在盘的一次旋转中实现读取动作，即使其在不在要访问的VL记录的开始处的FL扇区处开始。

公开(公告)号：US5860088A

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

申请号：US761719

申请日：1996-12-06

申请人： Michael T. Benhase ,  James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Donald J. Lang ,  Jaishankar Moothedath Menon

发明人： Michael T. Benhase ,  James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Donald J. Lang ,  Jaishankar Moothedath Menon

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

CPC分类号： G06F3/0608 ,  G06F3/064 ,  G06F3/0661 ,  G06F3/0689

摘要： A method enables a host processor, which employs variable length (VL) records, to transparently communicate with disk storage which employs fixed length (FL) sectors for storage of the VL records. The method comprises the steps of: a) deriving a first control data structure for an update VL record, the first control data structure including information describing segments of the update VL record; b) determining an FL sector wherein an old VL record commences that corresponds to the update VL record; c) if the old VL record commences at other than a sector break of the FL sector, deriving a second control data structure for a portion of a prior VL record that immediately precedes the old VL record and a third control data structure for the old VL record; d) substituting in the third control data structure, information regarding update segments of the update VL record from the first control data structure; and recording in the FL sector determined in c), data indicated by the second control data structure and at least a portion of the update VL record, through use of the third control structure as altered in d).

摘要翻译： 一种方法使得采用可变长度（VL）记录的主机处理器与采用固定长度（FL）扇区的磁盘存储器透明地通信以存储VL记录。 该方法包括以下步骤：a）导出更新VL记录的第一控制数据结构，所述第一控制数据结构包括描述更新VL记录段的信息; b）确定FL扇区，其中旧VL记录开始对应于更新VL记录; c）如果旧的VL记录在FL扇区的扇区之外开始，则导出紧邻旧VL记录之前的先前VL记录的一部分的第二控制数据结构，以及旧VL的第三控制数据结构 记录; d）在第三控制数据结构中替换关于来自第一控制数据结构的更新VL记录的更新段的信息; 并且通过使用在d）中改变的第三控制结构，在c）确定的FL扇区中记录由第二控制数据结构指示的数据和更新VL记录的至少一部分。

公开(公告)号：US6101194A

公开(公告)日：2000-08-08

申请号：US871165

申请日：1997-06-09

申请人： Narasimha Lakshmi Annapareddy ,  James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Jai M. Menon ,  David Ronald Nowlen

发明人： Narasimha Lakshmi Annapareddy ,  James Thomas Brady ,  Damon W. Finney ,  Michael Howard Hartung ,  Michael Anthony Ko ,  Jai M. Menon ,  David Ronald Nowlen

IPC分类号： H04J3/02 ,  H04L29/06 ,  H04L29/08

CPC分类号： H04L29/06 ,  H04L29/08

摘要： Conflicts are resolved between competing nodes in a multi-node communications network. After a first node in the network requests an initiation of communications with a target node, the requesting node may simply initiate the requested communications with the target node if the target node is not busy. If the first node determines that the target node is busy, it proceeds to resolve the conflict. Namely, the first node repeats the process of waiting for a first delay then requesting initiation of communications with the target node. After each unsuccessful attempt, the first delay is successively increased. As an example, the delay may be increased exponentially, with a controlled randomness added. After a or more queued messages to other nodes. Following this, the first node performs another sequence to initiate communications with the target node, successively increasing the delay between unsuccessful attempts, as before. After a predetermined number of unsuccessful passes through the foregoing routine, the first node proceeds to take appropriate action, such as initiating an error recovery routine, sending the message via different hardware components, or issuing an error message.

摘要翻译： 冲突在多节点通信网络中的竞争节点之间解决。 在网络中的第一节点请求启动与目标节点的通信之后，如果目标节点不忙，请求节点可以简单地发起与目标节点的所请求的通信。 如果第一个节点确定目标节点正在忙，则会继续解决冲突。 也就是说，第一节点重复等待第一延迟的处理，然后请求发起与目标节点的通信。 在每次不成功的尝试后，第一个延迟连续增加。 作为示例，延迟可以以指数方式增加，并且增加受控的随机性。 将一个或多个排队的消息发送到其他节点。 此后，第一个节点执行另一个序列以启动与目标节点的通信，如以前一样，连续增加不成功尝试之间的延迟。 在通过上述例程的预定数量的不成功通过之后，第一节点继续采取适当的动作，例如启动错误恢复例程，经由不同硬件组件发送消息或发出错误消息。

公开(公告)号：US10394672B2

公开(公告)日：2019-08-27

申请号：US13072307

申请日：2011-03-25

申请人： William Joseph Armstrong ,  Michael Howard Hartung ,  Yu-Cheng Hsu ,  Glenn Rowan Wightwick

发明人： William Joseph Armstrong ,  Michael Howard Hartung ,  Yu-Cheng Hsu ,  Glenn Rowan Wightwick

IPC分类号： G06F11/00 ,  G06F11/20

摘要： A first logical partition in a first processing complex of a server cluster is operated in an active mode and a second logical partition in the processing complex is operated in a standby mode. Upon detection of a failure in a second processing complex of the server cluster. the standby mode logical partition in the first processing complex is activated to an active mode. In one embodiment, partition resources are transferred from an active mode logical partition to the logical partition activated from standby mode. Other embodiments are described and claimed.

公开(公告)号：US07937616B2

公开(公告)日：2011-05-03

申请号：US11168973

申请日：2005-06-28

申请人： William Joseph Armstrong ,  Michael Howard Hartung ,  Yu-Cheng Hsu ,  Glenn Rowan Wightwick

发明人： William Joseph Armstrong ,  Michael Howard Hartung ,  Yu-Cheng Hsu ,  Glenn Rowan Wightwick

IPC分类号： G06F11/00

CPC分类号： G06F11/2046 ,  G06F11/2028 ,  G06F11/2033

摘要： A first logical partition in a first processing complex of a server cluster is operated in an active mode and a second logical partition in the processing complex is operated in a standby mode. Upon detection of a failure in a second processing complex of the server cluster. the standby mode logical partition in the first processing complex is activated to an active mode. In one embodiment, partition resources are transferred from an active mode logical partition to the logical partition activated from standby mode. Other embodiments are described and claimed.

摘要翻译： 服务器集群的第一处理复合体中的第一逻辑分区以活动模式操作，处理复合体中的第二逻辑分区在待机模式下操作。 当检测到服务器集群的第二处理复合体中的故障时。 第一处理复合体中的待机模式逻辑分区被激活到活动模式。 在一个实施例中，分区资源从活动模式逻辑分区传送到从待机模式激活的逻辑分区。 描述和要求保护其他实施例。

公开(公告)号：US07421535B2

公开(公告)日：2008-09-02

申请号：US10843150

申请日：2004-05-10

申请人： Thomas Charles Jarvis ,  Michael Howard Hartung ,  Karl Allen Nielsen ,  Jeremy Michael Pinson ,  Steven Robert Lowe

发明人： Thomas Charles Jarvis ,  Michael Howard Hartung ,  Karl Allen Nielsen ,  Jeremy Michael Pinson ,  Steven Robert Lowe

IPC分类号： G06F12/00 ,  G06F12/16

CPC分类号： G06F12/0804 ,  G06F12/0866

摘要： Provided are a method, system, and program for destaging a track from cache to a storage device. The destaged track is retained in the cache. Verification is made of whether the storage device successfully completed writing data. Indication is made of destaged tracks eligible for removal from the cache that were destaged before the storage device is verified in response to verifying that the storage device is successfully completing the writing of data.

摘要翻译： 提供了一种用于将轨道从缓存降级到存储设备的方法，系统和程序。 缓存中保留了已删除的轨道。 验证存储设备是否成功完成写入数据。 在存储设备被验证以响应于验证存储设备是否成功完成数据写入之前，指示有资格从高速缓存中移除的已迁移轨迹。

公开(公告)号：US5991775A

公开(公告)日：1999-11-23

申请号：US949669

申请日：1992-09-23

申请人： Brent Cameron Beardsley ,  Lawrence Carter Blount ,  Joel Harvey Cord ,  Michael Howard Hartung ,  Vernon John Legvold

发明人： Brent Cameron Beardsley ,  Lawrence Carter Blount ,  Joel Harvey Cord ,  Michael Howard Hartung ,  Vernon John Legvold

IPC分类号： G06F12/08 ,  G06F12/12 ,  G06F12/02

CPC分类号： G06F12/0866 ,  G06F12/123 ,  G06F12/084 ,  G06F2212/312 ,  Y10S707/99956

摘要： A data storage system provides generalized record caching through a control unit adapted to support track caching in the upper level store of a two level memory. Dynamic reallocation of space between each type of caching in the upper store follows operating patterns of host computer systems using the data storage system. A storage controller cache has a plurality of segments. A directory data entry data structure is allocated each segment. Such allocated directory entries are used to identify tracks as cached. A plurality of unallocated directory entries are also provided. As a record is cached in a segment outside of a track slot, an unallocated directory entry is used to identify a virtual track in cache corresponding to the track of the record in the lower level store. Records from one track can thus appear in several segments outside track slots. Tracking of records to locate records least recently used is done globally over all track slots and record caching segments and locally within individual record caching segments. A mechanism is provided for identifying record slots, as they become least recently used, and dropping them from the upper level store in the face of competing demands for the space. A second mechanism identifies least recently used segments for dropping from the upper level store.

摘要翻译： 数据存储系统通过适于支持两级存储器的上层存储器中的轨道缓存的控制单元提供广义记录高速缓存。 在上层商店中的每种类型的缓存之间的动态重新分配空间遵循使用数据存储系统的主机系统的操作模式。 存储控制器高速缓存具有多个段。 每个段分配目录数据条目数据结构。 这样分配的目录条目用于将轨道标识为缓存。 还提供了多个未分配的目录条目。 由于记录被缓存在轨道槽外的段中，所以使用未分配的目录条目来标识与低级存储中的记录的轨道相对应的高速缓存中的虚拟轨道。 因此，来自一个轨道的记录可以出现在轨道槽外部的若干段中。 跟踪记录以定位最近最少使用的记录是在所有轨道插槽上全局完成的，并记录缓存段，并在本地记录缓存段。 提供了一种用于识别记录槽的机制，因为它们最近被使用，并且在面对空间的竞争性需求的情况下将其从高级存储中删除。 第二种机制识别最近最少使用的段从高级存储中删除。