专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5577211A System and method using chained structure queues for ordering of message delivery between connected nodes wherein unsuccessful message portion is skipped and retried 失效
标题翻译：使用链接结构队列的系统和方法，用于排序连接节点之间的消息传递，其中不成功的消息部分被跳过并重试
公开(公告)号：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数据结构，该数据结构定义包括要发送的消息或消息的一部分的数据。从输出消息控制数据结构链接的控制数据结构表现出序列依赖性。处理器由就绪队列控制，并且使得能够分派由输出消息控制数据结构和相关联的进一步控制结构指定的消息的部分。即使消息传输被中断，处理器在发送消息的另一部分之前防止了第一部分依赖于消息的一部分的分派。

2. 发明授权

US5940612A System and method for queuing of tasks in a multiprocessing system 失效
标题翻译：在多处理系统中排队任务的系统和方法
公开(公告)号：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.
摘要翻译：程序控制多节点数据处理系统中优先级排序任务的执行。数据处理系统包括具有软件控制处理器和硬件配置的队列控制器的节点。队列控制器包括多个优先级排序队列，每个队列列出具有分配给队列的优先顺序的分配优先级的任务。队列控制器响应于处理器生成的顺序来排队第一任务以执行，方法是执行一种方法，该方法包括以下步骤：在具有等于所述第一任务的优先级的分配优先级的第一队列上列出所述第一任务 ; 如果在具有较高分配优先级的队列中列出第二任务，则在执行第一任务之前尝试执行第二任务; 如果在具有比所述第一队列更高的分配优先级的队列上列出任务，则尝试执行第一队列中的第一列出的任务; 并且在完成执行任务或停止执行任务时，只有当尚未发出另一个订单以将任务放置在具有较高分配优先级的队列上时，才尝试在第一队列上执行另外的任务。该方法通过响应于处理器生成的顺序尝试执行任务的每个子任务来进一步处理链接子任务; 并且如果任何子任务的执行未完成，则尝试执行另一任务代替链接到未完成的子任务的子任务。

3. 发明授权

US5784698A Dynamic memory allocation that enalbes efficient use of buffer pool memory segments 失效
标题翻译：动态内存分配，有效利用缓冲池内存段
公开(公告)号：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，直到存储器分配过程确定没有未实现的所请求的缓冲空间量。该装置还包括在不使用控制块数据结构的情况下分配的“快速小区”存储器。

4. 发明授权

US5675736A Multi-node network with internode switching performed within processor nodes, each node separately processing data and control messages 失效
标题翻译：在节点间进行节点间切换的多节点网络，每个节点分别处理数据和控制消息
公开(公告)号：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个双向通信链路，数据消息线路和控制消息线路之间。输入/输出交换机根据来自路由控制处理器的输出，通过至少一个双向通信链路分派控制消息或数据消息，从而使得每个通信链路能够携带数据或控制消息。如果通信链路忙于控制或数据消息，则路由控制处理器递增到另一个通信链路以启用排队消息的分派。

5. 发明授权

US5313628A Component replacement control for fault-tolerant data processing system 失效
标题翻译：容错数据处理系统的组件更换控制
公开(公告)号：US5313628A
公开(公告)日：1994-05-17
申请号：US816350
申请日：1991-12-30
申请人： Noah R. Mendelsohn , James Perchik , Thomas R. Hancock
发明人： Noah R. Mendelsohn , James Perchik , Thomas R. Hancock
IPC分类号： G06F11/20 , G06F11/00
CPC分类号： G06F11/2025 , G06F11/2041
摘要： Apparatus is described for component replacement control in a data processing system, with each component being assigned a label that includes a component identifier and a replacement generation value. The apparatus includes a plurality of tables for redundantly storing replacement generation values for each component. The tables that store the replacement generation values are then updated to indicate the incremented replacement generation value for the new component. Circuitry then increments the replacement generation value assigned to a component identity that is replaced by a new component. The circuitry modifies the new component's label to indicate the incremented replacement generation value. When the system is subsequently started, the replacement generation values in each component's label are compared with the replacement generation values in the tables and wherever a match is not found, the component is rejected.
摘要翻译：描述了用于数据处理系统中的组件更换控制的装置，其中每个组件被分配有包括组件标识符和替换生成值的标签。该装置包括用于冗余地存储每个组件的替换生成值的多个表。然后更新存储替换生成值的表，以指示新组件的递增替换生成值。电路然后增加分配给由新组件替换的组件标识的替换生成值。电路修改新组件的标签以指示增加的替换生成值。当系统随后启动时，将每个组件标签中的替换生成值与表中的替换生成值进行比较，并且在没有找到匹配的地方，组件被拒绝。

6. 发明授权

US5201044A Data processing method for file status recovery includes providing a log file of atomic transactions that may span both volatile and non volatile memory 失效
标题翻译：文件状态恢复的数据处理方法包括提供可跨越两个挥发性和非挥发性记忆的原始交易记录文件
公开(公告)号：US5201044A
公开(公告)日：1993-04-06
申请号：US509853
申请日：1990-04-16
申请人： Alexander H. Frey, Jr. , Richard C. Mosteller , Joel M. Gould , Noah R. Mendelsohn , James Perchik
发明人： Alexander H. Frey, Jr. , Richard C. Mosteller , Joel M. Gould , Noah R. Mendelsohn , James Perchik
IPC分类号： G06F12/00 , G06F11/14
CPC分类号： G06F11/1471
摘要： A data processing system includes both volatile and nonvolatile memories, user-inaccessible file control software and performs a method for recovering from a malfunction occurring during a file transaction that prevents accomplished microscopic transactions from being lost. The method comprises the steps of: providing a log file to maintain a record of file transactions which may span both the volatile and nonvolatile memories; recording in the portion of the log file in volatile memory, old and new data images which result during a file transaction; writing the old and new data images to a portion of the log file which is contained in nonvolatile memory, with the new data image being written after it is certain that the old data image is present in the nonvolatile memory; and in the event of a malfunction, employing the log file in nonvolatile memory to determine the status of a file transaction and rolling back the transaction in the event the malfunction occurred prior to its completion, and further assuring that all file system actions have actually occurred for transactions marked as completed.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式