Patents by Inventor Robert L. Jardine

Robert L. Jardine has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7308605
    Abstract: In an implementation of latent error detection, memory regions that each correspond to a different processor element of a redundant processor system are scanned for latent processing errors maintained as erroneous data. The data maintained in the memory regions is compared to detect a latent processing error in a first memory region. The latent processing error is resolved by copying data from a second memory region into the first memory region where the data maintained in the second memory region is determined to be identical to data maintained in at least a third memory region.
    Type: Grant
    Filed: July 20, 2004
    Date of Patent: December 11, 2007
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Robert L. Jardine, David L. Bernick, Thomas A. Heynemann, James R. Smullen
  • Patent number: 6948092
    Abstract: A computer system includes a primary processor and a secondary processor running in lockstep. The lockstep may or may not be synchronous. Errors occurring in the primary processor or the secondary processor are reported to an error-handling module. If the error is a recoverable error, the state of one of the processors is saved and the processors are restarted using the saved state. In addition to the reporting of errors from the processors, cross checking of the operation of the processors is performed to detect a divergence in the operation of the processors. If the divergence is reported to be due to a recoverable error, the state of the one of the processors is saved and the processors are restarted using the saved state. Procedures are also disclosed to ensure that data corruption does not propagate onto an associated network, and to ensure that the system is not lost as a network resource during processor restart.
    Type: Grant
    Filed: January 31, 2002
    Date of Patent: September 20, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Thomas J. Kondo, James S. Klecka, Robert L. Jardine, William P. Bunton, Graham B. Stott
  • Patent number: 6665811
    Abstract: An apparatus and protocol to determine the group of processors that will survive communications faults and/or timed-event failures in a distributed multiprocessor or clustered system. The processors are coupled to one another by an inter-processor communication network that is used, inter alia, by each processor to send path probe messages to each of the other processor units on all available network paths. A processor is suspected of being communicatively isolated, or having ceased operations, when one or more of the other processors detects the absence of an acknowledgment response from the processor. When this happens, all of the processors are subjected to a series of stages in which they repeatedly broadcast their status and connectivity to each other.
    Type: Grant
    Filed: August 24, 2000
    Date of Patent: December 16, 2003
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Marcelo Moraes de Azevedo, Robert L. Jardine
  • Publication number: 20030208750
    Abstract: A redundant system includes a primary process and a backup process. The system is configured to conduct online software replacement by sending an instruction to the backup process to terminate, and then starting a replacement backup process using an updated code version. Tokenized checkpoints are provided to the replacement backup process from the primary process, the tokenized checkpoints including a basic data structure and a token data structure. The token data structure includes one or more tokens that may be considered or may be ignored by the replacement backup process. After the state of the replacement backup process has been established, the replacement backup process is designated to be the new primary process. At that time, a new backup process is started using the updated code.
    Type: Application
    Filed: March 29, 2002
    Publication date: November 6, 2003
    Inventors: Gunnar D. Tapper, Robert L. Jardine, Gary S. Smith
  • Publication number: 20020144177
    Abstract: A computer system includes a primary processor and a secondary processor running in lockstep. The lockstep may or may not be synchronous. Errors occurring in the primary processor or the secondary processor are reported to an error-handling module. If the error is a recoverable error, the state of one of the processors is saved and the processors are restarted using the saved state. In addition to the reporting of errors from the processors, cross checking of the operation of the processors is performed to detect a divergence in the operation of the processors. If the divergence is reported to be due to a recoverable error, the state of the one of the processors is saved and the processors are restarted using the saved state. Procedures are also disclosed to ensure that data corruption does not propagate onto an associated network, and to ensure that the system is not lost as a network resource during processor restart.
    Type: Application
    Filed: January 31, 2002
    Publication date: October 3, 2002
    Inventors: Thomas J. Kondo, James S. Klecka, Robert L. Jardine, William P. Bunton, Graham B. Stott
  • Patent number: 6393582
    Abstract: A logical processor is formed from a pair of processor units operating in close synchrony to perform self-check operations. Outputs of one of the processor units are compared to that of the other processor unit. When one of the processor units experiences an error, creating a divergence, that error and/or divergence will be made known to the Master processor which will then determine if recovery from the error can be made and, if so, save its processing state to memory, cause a reset of both processor units to an initial state to begin executing reinitialization code using the prior saved state for both processor units.
    Type: Grant
    Filed: December 10, 1998
    Date of Patent: May 21, 2002
    Assignee: Compaq Computer Corporation
    Inventors: James Stevens Klecka, William F. Bruckert, Robert L. Jardine
  • Publication number: 20020049859
    Abstract: A scalable clustered system includes a global fabric, and two or more cluster nodes interconnected via the global fabric. Each cluster node includes a node naming agent (NNA), a local fabric and one or more end nodes interconnected via the local fabric. The NNA is configured as a fully symmetrical translation device interposed between the local fabric and the global fabric. The NNA provides support for scaled clustering by transforming a local/global cluster address into a corresponding global/local cluster address for each packet in an outbound/inbound path. As embodied and broadly described herein, the invention relates also to a method including steps for scaling the clustered system. Additionally, the invention relates to a computer readable medium in a scalable clustered system that embodies computer program code configured to cause that system to perform steps for configuring and scaling that system.
    Type: Application
    Filed: August 22, 2001
    Publication date: April 25, 2002
    Inventors: William Bruckert, Marcelo M. de Azevedo, Robert L. Jardine, Mark H. Johnson, Thomas G. Magorka, Jonathan R. Marcus, William Bunton, Jeffrey A. Boyd, Jim Klecka, Carlo Michael Christensen
  • Publication number: 20020024938
    Abstract: A system and method for controlling network traffic flow in a multi-processor network is disclosed. The method employs a two-part algorithm to determine when it is appropriate for a client node to transmit data over a network to one or more server nodes. The first part of the algorithm calls for the client node to transmit data over the network after receiving an acknowledgement from one or more of the server nodes to which data transfer is outstanding. The second part of the algorithm provides for the client node transmitting data over the network after a predetermined time interval has elapsed since a data transmission. The time interval is based, in part, on the length of outstanding data packets and a statistical analysis of the number of nodes transmitting or receiving data packets. The transmission of data over the network is accomplished by a hybrid scheme, comprising a combination of PUSH and PULL transmission protocols.
    Type: Application
    Filed: June 28, 2001
    Publication date: February 28, 2002
    Inventors: Sachin U. Naik, Robert L. Jardine, Tatsuhiro Torii
  • Patent number: 6195754
    Abstract: An apparatus and method for tolerating failure of the AC power source in a power supply switchable between the AC power source and a battery, in a processor system having a set of one or more components subject to being powered down. When the failure of the AC power source is recognized, the power supply is switched from the AC power source to the battery. For a first period of time, the battery powers the processor system with all components powered on. The battery then powers the processor system with the specific set of components powered off for a second period of time. In one embodiment, a determination is made that the battery can power the processor system with the set of components powered down for a predetermined period of time. A determination of the first period of time is then made as the capacity of the battery exceeding the predetermined period of time, if the excess capacity is used to power the processor system with the set of components powered on.
    Type: Grant
    Filed: January 28, 1997
    Date of Patent: February 27, 2001
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Larry D. Reeves, Murali Basavaiah, Garry Easop
  • Patent number: 6009506
    Abstract: A system for issuing a family of instructions during a single clock includes a decoder for decoding the family of instructions and logic, responsive to the decode result, for determining whether resource conflicts would occur if the family were issued during one clock. If no resource conflicts occur, an execution unit executes the family regardless of whether dependencies among the instructions in the family exist.
    Type: Grant
    Filed: April 10, 1998
    Date of Patent: December 28, 1999
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Shannon J. Lynch, Philip R. Manela, Robert W. Horst
  • Patent number: 5991518
    Abstract: A split brain avoidance protocol to determine the group of processors that will survive a complete partitioning (disconnection) in the inter-processor communications paths connecting processors in a multi-processor system. Processors embodying the invention detect that the set of processors with which they can communicate has changed. They then choose either to halt or to continue operations, guided by the goal of minimizing the possibility that multiple disconnected groups of processors continue to operate as independent systems, each group having determined (incorrectly) that the processors of the other groups have failed.
    Type: Grant
    Filed: January 28, 1997
    Date of Patent: November 23, 1999
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L Jardine, Murali Basavaiah, Karoor S Krishnakumar
  • Patent number: 5928368
    Abstract: Multiple processors are connected to form a multiprocessor system having interprocessor communicating capability. In the face of a power-fail signal, indicating that possible power loss is imminent, a processor will proceed through a shut-down procedure to save the present operating state so that when power is re-applied the processor can continue from the operating state it left when power was lost. The shut-down procedure concludes with the processor broadcasting messages to all other processors that it is undergoing a power-fail shut-down which is noted by the other processors to later cause them to enter a cautious mode of operation so as to not exclude the processor in any system configuration involving agreement of all processors by reason of the processor's loss of power.
    Type: Grant
    Filed: June 23, 1994
    Date of Patent: July 27, 1999
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L Jardine, Richard M. Collins, Larry D. Reeves
  • Patent number: 5884018
    Abstract: An apparatus and protocol to determine the group of processors that will survive communications faults and/or timed-event failures in a multiprocessor system. The processors each have a respective memory, and the processors are coupled by means of an inter-processor communication network. The processors detect that the set of processors with which they can communicate has changed. They can choose to either halt or continue operations based on minimizing the likelihood that disconnected groups of processors will continue to operate as independent systems. The processors construct a connectivity matrix on the initiation of a regroup operation. The connectivity information is used to ensure that all the processors in the final group that survives can communicate with all other processors in the group. One or more processors may halt to achieve this characteristic.
    Type: Grant
    Filed: January 28, 1997
    Date of Patent: March 16, 1999
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Murali Basavaiah, Karoor S. Krishnakumar, Srinivasa D. Murthy
  • Patent number: 5826066
    Abstract: A computing system develops time/date values by using a free-running counter to measure and accumulate increments of time. The increments of time are converted from the resolution of the free-running counter to that used for the time and date values by dividing by a conversion variable and then used to update the time/date value. The accuracy of the time/date value is monitored by periodically comparing the rate of the free-running counter to the rate of a more accurate, external clock. The ratio of these two rates is used to adjust the conversion variable. The conversion variable reflects any differences between (1) the rate of change of the increments of time used for developing the time/data value and (2) the external clock. Its use here, therefore, will operate to either slow down or speed up the rate of change of the time/date value so that it more closely tracks the external clock.
    Type: Grant
    Filed: August 8, 1996
    Date of Patent: October 20, 1998
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Hossein Moiin
  • Patent number: 5687308
    Abstract: Multiple processors are connected to form a multiprocessor system having inter-processor communicating capability. Each processor maintains a configuration option register indicating the resources necessary to operate the multiprocessor system. In the event of a power-fail signal, indicating that possible power loss is imminent, a processor will proceed through a shut-down procedure to save the present operating state so that when power is re-applied the processor can continue from the operating state it left when power was lost. Those processors not receiving a power-fail signal will attempt to reconfigure the multiprocessor system, waiting a reasonable amount of time for the processor receiving the power-fail signal to continue operations. If the processor has not recovered from the power-fail signal after a reasonable amount of time, the other processors check the configuration option register to determine whether that processor is necessary for operation of the multiprocessor system.
    Type: Grant
    Filed: June 7, 1995
    Date of Patent: November 11, 1997
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Richard M. Collins, A. Richard Zacher
  • Patent number: 5619647
    Abstract: A system providing a multiple number of virtual channels in a computer system having a smaller number of physical channels. Multiple queues are provided that are mapped to channels. The mapping of the queues to the channels changes depending on the message traffic and priority of the queues. Queues of lower priority are preempted if a higher priority queue needs a channel.
    Type: Grant
    Filed: September 30, 1994
    Date of Patent: April 8, 1997
    Assignee: Tandem Computers, Incorporated
    Inventor: Robert L. Jardine
  • Patent number: 5075844
    Abstract: A mechanism for handling exceptions in a processor system that issues a family of more than one instruction during a single clock that utilizes the exception handling procedures developed for single instructions. The mechanism detects an exception associated with one of the instructions in the family, inhibits the data writes for the instructions in the family, flushes the pipeline, and reissues the instruction singly. The exception handling procedure for the single instruction may then be utilized.
    Type: Grant
    Filed: May 24, 1989
    Date of Patent: December 24, 1991
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Shannon J. Lynch, Philip R. Manela, Robert W. Horst
  • Patent number: 5072364
    Abstract: A branch recovery mechanism completes the processing of a concurrently issued family of instructions depending on the location of the branch instruction in the family and on whether the branch was correctly predicted. If the branch was not correctly predicted, the writes and stores of instructions in the family the precede the branch instruction are completed and those instructions are retired. However, the writes and stores of the instructions in the family following the branch instruction are inhibited.
    Type: Grant
    Filed: May 24, 1989
    Date of Patent: December 10, 1991
    Assignee: Tandem Computers Incorporated
    Inventors: Robert L. Jardine, Shannon J. Lynch, Philip R. Manela, Robert W. Horst
  • Patent number: 5016208
    Abstract: In a data processing system, a multiplication operation is immediately followed by a redundant multiplication operation, using the same, albeit altered, operands, to check the initial result. The initial result is immediately available for use, but the check is not performed until some time later. The original operands are altered for the redundant multiplication operation by shifting one operand 1 bit, and swapping them before multiplication.
    Type: Grant
    Filed: July 11, 1989
    Date of Patent: May 14, 1991
    Assignee: Tandem Computers Incorporated
    Inventors: Robert W. Horst, Robert L. Jardine