Patents by Inventor Todd Alan Inglett
Todd Alan Inglett 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: 8738676Abstract: A parallel computer system adds entropy to improve the quality of random number generation by using parity errors as a source of entropy because parity errors are influenced by external forces such as cosmic ray bombardment, alpha particle emission, and other random or near-random events. By using parity errors and associated information to generate entropy, the quality of random number generation in a parallel computer system is increased.Type: GrantFiled: May 29, 2009Date of Patent: May 27, 2014Assignee: International Business Machines CorporationInventors: Todd Alan Inglett, Andrew Thomas Tauferner
-
Publication number: 20110191633Abstract: A method and apparatus is described for parallel debugging on the data nodes of a parallel computer system. A data template associated with the debugger can be used as a reference to the common data on the nodes. The application or data contained on the compute nodes diverges from the data template at the service node during the course of program execution, so that pieces of the data are different at each of the nodes at some time of interest. For debugging, the compute nodes search their own memory image for checksum matches with the template and produces new data blocks with checksums that didn't exist in the data template, and a template of references to the original data blocks in the template. Examples herein include an application of the rsync protocol, compression and network broadcast to improve debugging in a massively parallel computer environment.Type: ApplicationFiled: February 1, 2010Publication date: August 4, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles Jens Archer, Todd Alan Inglett
-
Patent number: 7627783Abstract: A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.Type: GrantFiled: April 16, 2008Date of Patent: December 1, 2009Assignee: International Business Machines CorporationInventors: Charles Jens Archer, Todd Alan Inglett
-
Patent number: 7487393Abstract: A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.Type: GrantFiled: April 16, 2008Date of Patent: February 3, 2009Assignee: International Business Machines CorporationInventors: Charles Jens Archer, Todd Alan Inglett
-
Patent number: 7478278Abstract: A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.Type: GrantFiled: April 14, 2005Date of Patent: January 13, 2009Assignee: International Business Machines CorporationInventors: Charles Jens Archer, Todd Alan Inglett
-
Publication number: 20080215916Abstract: A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.Type: ApplicationFiled: April 16, 2008Publication date: September 4, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles Jens Archer, Todd Alan Inglett
-
Publication number: 20080195892Abstract: A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.Type: ApplicationFiled: April 16, 2008Publication date: August 14, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles Jens Archer, Todd Alan Inglett
-
Publication number: 20080115139Abstract: An apparatus, program product and method utilize a barrier-based mechanism for arbitrating access to a shared resource in a massively parallel computer system. In a first processor among a plurality of processors in a massively parallel computer system, the number of times a barrier has been entered by processors in the massively parallel computer system in association with attempting to access the shared resource may be monitored, and the shared resource may be accessed by the first processor once the number of times the barrier has been entered matches a priority value associated with the first processor. As such, on massively parallel computer systems where potentially thousands of processors may attempt to concurrently access the same shared resource, the access by such processors may be coordinated in a logical fashion to reduce the risk of overwhelming the shared resource due to an excessive number of concurrent access attempts to the shared resource.Type: ApplicationFiled: October 27, 2006Publication date: May 15, 2008Inventors: Todd Alan Inglett, Andrew Thomas Tauferner
-
Publication number: 20080059676Abstract: Embodiments of the present invention provide techniques for protecting critical sections of code being executed in a lightweight kernel environment suited for use on a compute node of a parallel computing system. These techniques avoid the overhead associated with a full kernel mode implementation of a network layer, while also allowing network interrupts to be processed without corrupting shared memory state. In one embodiment, a fast user-space function sets a flag in memory indicating that interrupts should not progress and also provides a mechanism to defer processing of the interrupt.Type: ApplicationFiled: August 31, 2006Publication date: March 6, 2008Inventors: Charles Jens Archer, Michael Alan Blocksome, Todd Alan Inglett, Derek Lieber, Patrick Joseph McCarthy, Michael Basil Mundy, Jeffrey John Parker, Joseph D. Ratterman, Brian Edward Smith
-
Publication number: 20080059677Abstract: Embodiments of the present invention provide techniques for protecting critical sections of code being executed in a lightweight kernel environment suited for use on a compute node of a parallel computing system. These techniques avoid the overhead associated with a full kernel mode implementation of a network layer, while also allowing network interrupts to be processed without corrupting shared memory state. In one embodiment, a system call may be used to disable interrupts upon entry to a routine configured to process an event associated with the interrupt.Type: ApplicationFiled: August 31, 2006Publication date: March 6, 2008Inventors: Charles Jens Archer, Michael Alan Blocksome, Todd Alan Inglett, Derek Lieber, Patrick Joseph McCarthy, Michael Basil Mundy, Jeffrey John Parker, Joseph D. Ratterman, Brian Edward Smith