公开(公告)号：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个双向通信链路，数据消息线路和控制消息线路之间。 输入/输出交换机根据来自路由控制处理器的输出，通过至少一个双向通信链路分派控制消息或数据消息，从而使得每个通信链路能够携带数据或控制消息。 如果通信链路忙于控制或数据消息，则路由控制处理器递增到另一个通信链路以启用排队消息的分派。

公开(公告)号：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，直到存储器分配过程确定没有未实现的所请求的缓冲空间量。 该装置还包括在不使用控制块数据结构的情况下分配的“快速小区”存储器。

公开(公告)号：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.

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

公开(公告)号：US5717862A

公开(公告)日：1998-02-10

申请号：US429702

申请日：1995-04-27

申请人： Narasimhareddy L. Annapareddy ,  James Thomas Brady ,  Damon W. Finney ,  Richard F. Freitas ,  Michael Anthony Ko ,  Michael James Rayfield

发明人： Narasimhareddy L. Annapareddy ,  James Thomas Brady ,  Damon W. Finney ,  Richard F. Freitas ,  Michael Anthony Ko ,  Michael James Rayfield

IPC分类号： H04L12/56 ,  G06F13/00

CPC分类号： H04L47/10

摘要： A multi-nodal data processing system includes a plurality of processing nodes, each node connected to plural other nodes by bidirectional data links. Each node comprises receivers for receiving messages on bidirectional data links and transmitters for transmitting messages on bidirectional data links. Each node records child nodes to which a message was transmitted and is further adapted to transmit a lock-up message received from a child node to a parent node, the lock-up message indicating a successful establishment of a message signal path to a destination node. Each node further is adapted to transmit a link cancel signal to another node to close the link in the event of an unsuccessful message transfer attempt over the link. Each node inhibits transmission of a lock-up signal to a parent node until link cancel signals have been received from all child nodes (other than a node from which a lock-up signal was received). A source node (where a message originates) continues transmission of its message, even before a lock-up signal has been received. The destination node which originates the lock-up message terminates a bidirectional data link by an end-of-session signal when it has received an entire message.

摘要翻译： 多节点数据处理系统包括多个处理节点，每个节点通过双向数据链路连接到多个其他节点。 每个节点包括用于在双向数据链路上接收消息的接收机和用于在双向数据链路上发送消息的发射机。 每个节点记录发送消息的子节点，并且进一步适于将从子节点接收的锁定消息发送到父节点，锁定消息指示成功建立到目的地节点的消息信号路径 。 每个节点进一步适于在另一节点上发送链路取消信号以在通过链路的不成功的消息传送尝试的情况下关闭链路。 每个节点禁止向父节点发送锁定信号，直到从所有子节点（除了接收到锁定信号的节点）接收到链路消除信号为止。 即使在接收到锁定信号之前，源节点（消息始发地）也继续发送其消息。 当接收到整个消息时，发起锁定消息的目的地节点通过会话结束信号终止双向数据链路。

公开(公告)号：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数据结构，该数据结构定义包括要发送的消息或消息的一部分的数据。 从输出消息控制数据结构链接的控制数据结构表现出序列依赖性。 处理器由就绪队列控制，并且使得能够分派由输出消息控制数据结构和相关联的进一步控制结构指定的消息的部分。 即使消息传输被中断，处理器在发送消息的另一部分之前防止了第一部分依赖于消息的一部分的分派。

公开(公告)号：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.

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

公开(公告)号：US5613067A

公开(公告)日：1997-03-18

申请号：US176042

申请日：1993-12-30

申请人： James T. Brady ,  Damon W. Finney ,  Donald J. Lang ,  George B. Marenin ,  David Nowlen

发明人： James T. Brady ,  Damon W. Finney ,  Donald J. Lang ,  George B. Marenin ,  David Nowlen

IPC分类号： G06F15/173 ,  H04L29/06 ,  G06F13/20 ,  G06F13/28

CPC分类号： G06F15/17375 ,  H04L29/06

摘要： A multi-node data processing system implements a method that assures that plural messages are enabled "fair" access to a data stream. Each node includes apparatus for controlling message transmissions and/or receptions from another node over a communication network. The method comprises the steps of: transmitting a routing message from a first destination node to a source node, the routing message signalling a readiness of the destination node to receive a data message; transmitting a first data message to the first destination node from the source node in response to the ready message; transmitting a conditional disconnect message from the first destination node to the source node upon receipt of a predetermined amount (i.e. a "slice") of the first data message. The source node responds to the conditional disconnect message by either (1) disconnecting from the first destination node, and commencing transmission of a slice of a second data message to a second destination node if during transmission of the slice of the first data message, the source node has received a ready message from the second destination node; or (2) continuing transmission of the data message to the first destination node until message end or, following the procedure in (1) if a new ready message is received by the source node from a further destination node, whichever occurs first.

摘要翻译： 多节点数据处理系统实现了一种确保多个消息能够“公平地”访问数据流的方法。 每个节点包括用于通过通信网络控制来自另一个节点的消息传输和/或接收的装置。 该方法包括以下步骤：从第一目的地节点向源节点发送路由消息，所述路由消息发信号通知目的节点接收数据消息的准备状态; 响应于所述就绪消息，从所述源节点向所述第一目的地节点发送第一数据消息; 在接收到所述第一数据消息的预定量（即，“切片”）时，将条件断开消息从所述第一目的地节点发送到所述源节点。 源节点通过（1）从第一目的地节点断开并且如果在第一数据消息的片的传输期间开始将第二数据消息的片段传输到第二目的地节点来响应条件断开消息，则 源节点已经从第二目的地节点接收到就绪消息; 或者（2）数据消息继续传送到第一目的地节点，直到消息结束，或者按照（1）中的源节点从另一个目的地节点接收到新的就绪消息的过程（以先发生者为准）。