Patents by Inventor David Charles Reed
David Charles Reed 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).
-
Publication number: 20100180156Abstract: Various embodiments for intelligent dump suppression in a computing environment following an error are provided. A plurality of historical information is considered in view of a current alert level to generate an output decision. The current alert level is one of an available plurality of alert levels configurable by a user. The current alert level is selectable by the user for a predetermined data collection restrictiveness. Data capture is performed according to the output decision.Type: ApplicationFiled: January 15, 2009Publication date: July 15, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Herman Aranguren, David Bruce LeGendre, David Charles Reed, Max Douglas Smith
-
Patent number: 7716429Abstract: An apparatus, system, and method are disclosed for dynamic address tracking. A token module creates a token for a job that accesses data in a storage system comprising a plurality of storage devices. The token comprises a job name. The job is a batch job. A storage module stores location information for the data accessed by the job in a token table. The location information is indexed by the token. In addition, the location information includes an input/output device name, an address space, a data set name, and a storage device name. A communication module receives a diagnostic command comprising the job name. The token module reconstructs the token using the job name. The storage module retrieves the location information indexed by the token in response to the diagnostic command.Type: GrantFiled: September 14, 2007Date of Patent: May 11, 2010Assignee: International Business Machines CorporationInventors: David Charles Reed, Jeffrey Thomas Sheridan, Max Douglas Smith
-
Publication number: 20100094811Abstract: An apparatus, system, and method are disclosed for Virtual Storage Access (VSAM) Volume Data Set (VVDS) recovery. A store module stores a data set name and data set characteristics for a data set in a recovery table when the data set is defined under a Z/OS® operating system. The recovery table indexed by the data set name. A retrieve module retrieves a Z/OS® Volume Table of Contents (VTOC) entry indexed by the data set name. In addition, the retrieve module retrieves the data set characteristics from the recovery table using the data set name. A recover module combines the data set characteristics and the VTOC entry to recover a Z/OS® VVDS entry.Type: ApplicationFiled: September 30, 2008Publication date: April 15, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
-
Publication number: 20100083052Abstract: An apparatus, system, and method are disclosed for multi-address space tracing. A trigger module establishes a trigger event with a trace level. The trigger event occurs in at least a first address space of a plurality of address spaces. The trace level defines trace data to be stored from the plurality of address spaces. A monitor monitors messages communicated within and between the plurality of address spaces. A detection module detects the trigger event. A log module logs the trace data from the plurality of address spaces defined by the trace level in response to detecting the trigger event.Type: ApplicationFiled: September 30, 2008Publication date: April 1, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Harold Steven Huber, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
-
Publication number: 20100077255Abstract: A method for forward recovery of a catalog of a data storage system, comprising providing a recovery catalog and SMF records. In reverse chronological order, the (i)th entry of the record is checked for a data set change command. If none, the next entry is examined. Otherwise, the (j)th data set is identified and checked for inclusion in the recovery catalog. If it already is, the next entry is selected. If not, a data set location record is added. This process is repeated for each entry in the SMF record. Next, a (h)th data set on the (k)th volume is selected and checked for inclusion in the recovery catalog. If that (h)th data set has been added to the recovery catalog, a next data set is selected. Otherwise, a data set location record for the (h)th data set is added. The process is repeated for each data set on each volume.Type: ApplicationFiled: September 22, 2008Publication date: March 25, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
-
Publication number: 20100042663Abstract: A method to optimize use of available storage capacity of a plurality of sequential data storage media, wherein the method provides (M) sequential data storage media each comprising a plurality of blockids, where the (i)th sequential data storage medium comprises an (i)th available storage capacity, and where (M) is greater than or equal to 2, and where (i) is greater than or equal to 1 and less than or equal to (M). The method then receives source data comprising a plurality of segments, determines a quantum of data to store, determines if the quantum of data to store is substantially equal to an (i)th available storage capacity. If the quantum of data to store is substantially equal an (i)th available storage capacity, then the method writes the source data to an (i)th sequential data storage medium.Type: ApplicationFiled: August 15, 2008Publication date: February 18, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kyle Barret Dudgeon, Harold Steven Huber, David Charles Reed, Max Douglas Smith
-
Publication number: 20100030828Abstract: A plurality of data sets is maintained, wherein each data set comprises an index block and a plurality of data blocks. An index block size is determined for redefining the plurality of data sets, based on an amount of space left unused in index blocks of the plurality of data sets, wherein for determining the index block size greater weight is provided to those index blocks with lesser unused space in comparison to those index blocks with greater unused space. A data block size is determined based on whether the plurality of data blocks is used more frequently for direct processing or used more frequently for sequential processing.Type: ApplicationFiled: August 1, 2008Publication date: February 4, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Publication number: 20100023803Abstract: A central hub is coupled to a plurality of computational devices. The central hub stores a data structure that grants locks for accessing common data stored at the central hub, wherein the common data is shared by the plurality of computational devices. Each computational device maintains locally those locks that are held by the computational device in the data structure stored at the central hub. In response to a failure of the data structure stored at the central hub, a selected computational device of the plurality of computational devices is determined to be a manager system. Other computational devices besides the manager system communicate to the manager system all locks held by the other computational devices in the data structure stored at the central hub. The data structure and the common data are generated and stored at the manager system. Transactions are performed with respect to the data structure stored at the manager system, until the data structure stored at the central hub is operational.Type: ApplicationFiled: July 25, 2008Publication date: January 28, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
-
Publication number: 20100023725Abstract: A plurality of storage subsystems and a plurality of storage devices are maintained, and wherein each storage subsystem includes at least one storage device of the plurality of storage devices. A plurality of storage groups is generated, wherein each storage group includes one or more storage devices selected from the plurality of storage devices, and wherein the one or more storage devices selected in each storage group are included in at least two different storage subsystems. The plurality of storage groups is adjusted based on: (a) usage statistics of the data, wherein the usage statistics are stored in a log file; and (b) properties and organization of the data stored in a plurality of data structures.Type: ApplicationFiled: July 23, 2008Publication date: January 28, 2010Applicant: International Business Machines CorporationInventors: Harold Steven Huber, David Charles Reed, Max Douglas Smith
-
Publication number: 20100005316Abstract: Method, system, and computer program product embodiments for performing a branch trace operation on a computer system of an end user are provided. An encrypted mapping macro is provided to the end user to be made operational on the computer system. A trace program is provided to the end user. The end user executes the trace program on the computer system as a diagnostic tool. The trace program is adapted for decrypting the encrypted mapping macro, determining a storage offset location of a branch instruction; checking the storage offset location for an identifying constant, cross referencing the identifying constant with an entry in the decrypted mapping macro to identify a branch triggering bit and diagnostic information associated with the branch instruction, and returning the branch triggering bit and diagnostic information, the branch triggering bit and diagnostic information provided to a coder.Type: ApplicationFiled: July 7, 2008Publication date: January 7, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David Bruce LeGENDRE, David Charles REED, Max Douglas SMITH
-
Publication number: 20100005126Abstract: A method, system, and computer program product for performing a backup operation in a computing environment is provided. A list of keys identifying a plurality of locked records is created at a start of the backup operation. If a first locked record of the plurality of locked records is obtained during the backup operation, a first key identifying the first locked record is added to the list of keys. At a completion of the backup operation, if a second locked record of the plurality of locked records was not moved during the backup operation, a second key identifying the second locked record from the list of keys is dropped. The list of keys is written to a log file as in-flight updates. The in-flight updates are reprocessed through the backup operation using the log file.Type: ApplicationFiled: July 7, 2008Publication date: January 7, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Douglas Lee LEHR, Franklin Emmert McCUNE, David Charles REED, Max Douglas SMITH
-
Publication number: 20090276592Abstract: A method, system, and computer program product for performing a backup operation in a computing environment is provided. A dataset corresponding to a backup copy is examined to determine if the dataset has changed from a previous backup operation. If the dataset has not changed, a backup inventory registry is consulted to determine a current version of a backup copy. The current version is one of a plurality of available versions. The backup operation is performed using the current version of the backup copy.Type: ApplicationFiled: May 2, 2008Publication date: November 5, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David Charles REED, Max Douglas SMITH, Thaiese Nicole TRADER, Robin Lea URSERY
-
Publication number: 20090259794Abstract: A method, system, and computer program product for implementing Serviceability Level Indicator Processing (SLIPs) for storage alterations in a computer system is provided. A plurality of storage release requests is analyzed to identify an address monitored by a storage alteration slip. Upon identification of the address, the storage alteration slip is disabled and an initialization slip is re-enabled.Type: ApplicationFiled: April 10, 2008Publication date: October 15, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Harold Steven HUBER, Miguel Angel PEREZ, David Charles REED, Max Douglas SMITH
-
Publication number: 20090222599Abstract: An apparatus, system, and method are disclosed for enqueue prioritization. The apparatus for enqueue prioritization is provided with a plurality of modules configured to functionally execute the necessary steps of anticipating a need to access a computing resource, generating a dummy request, the dummy request configured to hold a place for an actual request in a queue of requests to access the computing resource, and generating an actual request to access the computing resource, wherein the actual request is configured to replace the dummy request in the queue. These modules in the described embodiments include a forecast module, a dummy generator, and a request generator.Type: ApplicationFiled: February 29, 2008Publication date: September 3, 2009Inventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
-
Publication number: 20090222600Abstract: An apparatus, system, and method are disclosed for enqueue prioritization. The apparatus for enqueue prioritization is provided with a plurality of modules configured to functionally execute the steps of holding one or more queued requests in a queue, sorting the queued requests according to a first priority identifier associated with each of the queued requests, and assigning a second priority identifier to a delayed request in response to a determination that the delayed request has resided in the queue for a predetermined length of time, wherein the second priority identifier indicates a higher priority than the first priority identifier indicates. These modules in the described embodiments include a queue module, a sorting module, and a reassignment module.Type: ApplicationFiled: February 29, 2008Publication date: September 3, 2009Inventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
-
Publication number: 20090077554Abstract: An apparatus, system, and method are disclosed for dynamic address tracking. A token module creates a token for a job that accesses data in a storage system comprising a plurality of storage devices. The token comprises a job name. The job is a batch job. A storage module stores location information for the data accessed by the job in a token table. The location information is indexed by the token. In addition, the location information includes an input/output device name, an address space, a data set name, and a storage device name. A communication module receives a diagnostic command comprising the job name. The token module reconstructs the token using the job name. The storage module retrieves the location information indexed by the token in response to the diagnostic command.Type: ApplicationFiled: September 14, 2007Publication date: March 19, 2009Inventors: David Charles Reed, Jeffrey Thomas Sheridan, Max Douglas Smith
-
Publication number: 20080256312Abstract: A method is disclosed to detect and repair a broken dataset. The method creates and maintains a backup log and an update log for a dataset. If the method finds a dataset structural error, then the method deletes the corrupted dataset, obtains the most current backup copy of the dataset, obtains all dataset updates made after the most current backup copy of the dataset was saved, and generates a recovered dataset using the most current backup and the dataset updates.Type: ApplicationFiled: April 12, 2007Publication date: October 16, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
-
Patent number: 6910214Abstract: Disclosed is a method, system, and program for building a list of parameters to include with a command, such as a copy command. A plurality of input parameters is received and a determination is made as to whether a number of the input parameters exceeds a threshold number of parameters that are capable of being included in the command. The content of multiple input parameters is merged into at least one output parameter if the number of input parameters exceeds the threshold number, such that the content of the input parameters is included in a number of output parameters that does not exceed the threshold. The output parameters are then included with the command.Type: GrantFiled: August 25, 1999Date of Patent: June 21, 2005Assignee: International Business Machines CorporationInventors: David Charles Reed, John Glenn Thompson
-
Patent number: 6557089Abstract: A backup copy of a source data volume is created by first performing an instant virtual copy with source volume identifier (ID) suspended, then creating a physical tape backup copy from the instant virtual copy with the source volume ID being reintroduced. This creates an exact duplicate of the source volume with minimal impact on access to the source volume. Moreover, the resultant backup copy is less costly and error prone because it is created by a machine-automated process rather than various commands issued by a system administrator. In addition, by differentiating the volume IDs during intermediate copy steps, the invention is more fault tolerant since failure of the storage subsystem will not result in source and a temporary copy having confusingly indistinguishable volume IDs.Type: GrantFiled: November 28, 2000Date of Patent: April 29, 2003Assignee: International Business Machines CorporationInventors: David Charles Reed, John Glenn Thompson
-
Patent number: 6209070Abstract: Disclosed is a system for transferring data involving a data movement, such as the duplication of address information, that includes two data movement components. A first data transfer from at least one source storage location to at least one target storage location is processed. A data structure indicates the source storage locations from which data was transferred during processing of the first data transfer. A second data transfer from a plurality of source storage locations to a plurality of target storage locations is processed. The data structure is then processed to determine the source storage locations included in the second data transfer that were not involved in the first data transfer. Data is then transferred from the source storage locations that were not involved in the first data transfer to the target storage locations that did not receive data during the processing of the first data transfer.Type: GrantFiled: March 20, 1998Date of Patent: March 27, 2001Assignee: International Business Machines CorporationInventors: David Charles Reed, John Glenn Thompson