Patents by Inventor Charles A. Reed

Charles A. 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).

  • Patent number: 7996686
    Abstract: 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: Grant
    Filed: July 7, 2008
    Date of Patent: August 9, 2011
    Assignee: International Business Machines Corporation
    Inventors: David Bruce LeGendre, David Charles Reed, Max Douglas Smith
  • Patent number: 7996365
    Abstract: 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: Grant
    Filed: July 7, 2008
    Date of Patent: August 9, 2011
    Assignee: International Business Machines Corporation
    Inventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
  • Patent number: 7962803
    Abstract: 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: Grant
    Filed: September 30, 2008
    Date of Patent: June 14, 2011
    Assignee: International Business Machines Corporation
    Inventors: Harold Steven Huber, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
  • Publication number: 20110132406
    Abstract: An extractor has a plurality of fluid delivery needles mounted to a housing in fluid communication with a fluid distribution system and positioned to penetrate a carpet surface to deliver a cleaning solution below the surface of the carpet and into the carpet nap. Soiled cleaning fluid is removed from the surface with suction. A method of cleaning a carpet or a pet coat having a nap comprises injecting cleaning fluid, such as a foam detergent, directly into the nap and removing soiled cleaning fluid from the carpet.
    Type: Application
    Filed: December 2, 2010
    Publication date: June 9, 2011
    Applicant: BISSELL HOMECARE, INC.
    Inventors: Eric C. Huffman, Joseph P. Perry, Charles A. Reed, JR.
  • Publication number: 20110079248
    Abstract: An extractor has a duct door moveably mounted to a working air conduit for movement between a first position at which normal suction at a suction nozzle is reduced and a second position at which normal suction at the suction nozzle is unreduced. An actuator is connected to the duct door for selectively moving the duct door between the first position and second position. In one embodiment, a suction leak hole is formed within the working air conduit and the duct door is moveable with respect to the leek hole to selectively fluidly open and close the leak hole. In another embodiment, the duct door is moveable within the working air conduit to selectively fluidly restrict the working air flow in the working air conduit and the actuator selectively moves the duct door between the first and second positions. The suction reduction selectively increases the cleaning solution dwell time.
    Type: Application
    Filed: October 6, 2009
    Publication date: April 7, 2011
    Applicant: BISSELL HOMECARE, INC.
    Inventors: Eric C. Huffman, Charles A. Reed, JR.
  • Publication number: 20110056044
    Abstract: An extraction cleaner comprises a fluid delivery system and a fluid recovery system. The fluid recovery system includes a centrifugal separator for separating a liquid and debris-entrained working air flow with a tangential air/water inlet, water outlet and air outlet at a lower portion of the separator. The air outlet has a vertical stand pipe that extends upwardly above the tangential air/water inlet and water outlet. The centrifugal separator can be mounted in a plurality of locations on the extraction cleaner thereby offering greater architectural flexibility.
    Type: Application
    Filed: September 7, 2010
    Publication date: March 10, 2011
    Applicant: BISSELL HOMECARE, INC.
    Inventor: Charles A. Reed, JR.
  • Patent number: 7890675
    Abstract: An apparatus, system, and method are disclosed for dynamically allocating buffers during the execution of a job. A plan module sets a buffer allocation plan for the job using data access history that contains information about the number and nature of data access events in past executions of the same job. A buffer module allocates buffers during the execution of the job, and alters the buffer allocation to improve performance for direct access events for those portions of the job that the buffer allocation plan indicates have historically included predominantly direct access events. The buffer module alters the buffer allocation to improve performance for sequential access events for those portions of the job that the buffer allocation plan indicates have historically included predominantly sequential access events. A history module then collects data access information about the current execution and adds that information to the data access history.
    Type: Grant
    Filed: March 5, 2009
    Date of Patent: February 15, 2011
    Assignee: International Business Machines Corporation
    Inventors: Herman Aranguren, David Bruce LeGendre, David Charles Reed, Max Douglas Smith
  • Publication number: 20100293354
    Abstract: A method of minimizing data storage medium fragmentation, wherein the method provides a data storage library comprising (N) data storage media, wherein (N) is greater than or equal to 1. The method establishes a threshold fragmentation index, and determines, for each value of (i), an actual fragmentation index for an (i)th data storage medium, wherein (i) is greater than or equal to 1 and less than or equal to (N). The method receives a data set from a host computer in communication with the data storage library, and writes the data set to an (i)th data storage medium based upon an (i)th actual fragmentation index.
    Type: Application
    Filed: May 12, 2009
    Publication date: November 18, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: MIGUEL ANGEL PEREZ, DAVID CHARLES REED, MAX DOUGLAS SMITH
  • Publication number: 20100281000
    Abstract: A method for data recovery of a data set migrated from a first storage media to a second storage media, where the data set includes a header record and multiple control records interleaved with corresponding data blocks. The header record is examined to identify a number of control records and data blocks comprising the data set. Next, the control records and data blocks are examined in order, starting with an initial data block, until a first data block is identified due to its failure to match the attribute included in the associated control record. Then the control records and data blocks are examined in reverse order, starting with a last data block, until a second data block is identified due to its failure to match an attribute included in the associated control record. Lastly, each data block from the first data block to the second data block are set to a lost data value.
    Type: Application
    Filed: April 30, 2009
    Publication date: November 4, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: DOUGLAS LEE LEHR, FRANKLIN EMMERT MCCUNE, DAVID CHARLES REED, MAX DOUGLAS SMITH
  • Publication number: 20100251214
    Abstract: An apparatus, system, and method are disclosed for analyzing code paths. In one embodiment, a starting point for one or more code paths within a listing of code is specified. The starting point may include code from which one or more code paths flow. An ending point is also specified for one or more code paths within the code, wherein the ending point includes code that is reachable via one or more of the code paths flowing from the starting point. Each code path flowing from the starting point to the ending point is determined by analyzing the listing of code without execution of the code. Information about the determined code paths is provided to a user.
    Type: Application
    Filed: March 31, 2009
    Publication date: September 30, 2010
    Applicant: International Business Machines Corporation
    Inventors: Neal Everett Bohling, Douglas Lee Lehr, David Charles Reed, Max Douglas Smith
  • Publication number: 20100228898
    Abstract: An apparatus, system, and method are disclosed for dynamically allocating buffers during the execution of a job. A plan module sets a buffer allocation plan for the job using data access history that contains information about the number and nature of data access events in past executions of the same job. A buffer module allocates buffers during the execution of the job, and alters the buffer allocation to improve performance for direct access events for those portions of the job that the buffer allocation plan indicates have historically included predominantly direct access events. The buffer module alters the buffer allocation to improve performance for sequential access events for those portions of the job that the buffer allocation plan indicates have historically included predominantly sequential access events. A history module then collects data access information about the current execution and adds that information to the data access history.
    Type: Application
    Filed: March 5, 2009
    Publication date: September 9, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Herman Aranguren, David Bruce LeGendre, David Charles Reed, Max Douglas Smith
  • Publication number: 20100228708
    Abstract: Provided are a method, system, and program for allocating data sets to a container data set. A container data set is allocated in a storage system. An entry is included in a file allocation catalog for the allocated container data set indicating an address range of data allocated to the container data set, wherein the file allocation catalog maps data sets to address ranges in the storage system. A virtual file allocation catalog for the container data set is generated. A request is received to allocate a data set. A determination is made as to whether the data set to allocate has a size less than a threshold size. An entry is included in the virtual file allocation catalog to allocate the data set in the address range of the container data set in response to determining that the data set to allocate size is less than the threshold size.
    Type: Application
    Filed: February 24, 2009
    Publication date: September 9, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
  • Publication number: 20100217930
    Abstract: Provided are a method, system, and article of manufacture to manage storage resources in a storage system. Requests by processing systems are received for access to a control block providing information on an address assigned to one of the storage resources to access. A token is generated for each processing system requesting the control block uniquely identifying the processing system and the control block. The processing systems are provided copies of the requested control blocks to use to access the storage resource. A request is received to modify one of the control blocks for one of the storage resources. A determination is made as to whether at least one of the tokens was generated for the control block to modify. At least one processing system associated with the determined at least one token is provided a copy of the modified control block to use to access the storage resource associated with the control block.
    Type: Application
    Filed: February 24, 2009
    Publication date: August 26, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregg Leonard Liguori, David Charles Reed, Michael Robert Scott, Max Douglas Smith
  • Publication number: 20100191738
    Abstract: An apparatus, system, and method are disclosed for modifying data set names. A communication module receives a data set name as an index of a catalog entry for a catalog. The data set name comprises at least two qualifiers. A modification module modifies at least one data set name qualifier using a naming algorithm, wherein an alias qualifier is not modified. A store module stores the catalog entry indexed with the modified data set name in order to optimize the location of that entry within the catalog.
    Type: Application
    Filed: January 28, 2009
    Publication date: July 29, 2010
    Applicant: International Business Machines Corporation
    Inventors: Douglas Lee Lehr, Franklin Emmert McCune, David Charles Reed, Max Douglas Smith
  • Publication number: 20100185829
    Abstract: Data is added to a data set to cause a growth in size of the data set, wherein the data set belongs to a storage group, and wherein the data set is comprised of extents. The data set is included into a new storage group, in response to determining that the growth in the size of the data set has caused a predetermined threshold for a size limit of the storage group to be exceeded. The extents of the data set are restructured to satisfy a predetermined condition on the extents of the data set, in response to determining that the growth in the size of the data set has caused the predetermined condition on the extents included in the data set to be not satisfied.
    Type: Application
    Filed: January 22, 2009
    Publication date: July 22, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kyle Barret Dudgeon, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
  • Publication number: 20100185589
    Abstract: Various embodiments for failure recovery in a computing environment following a data restoration are provided. A catalog locate is performed for each of a plurality of data sets on a base catalog structure (BCS), identifying a plurality of BCS entries. If a first BCS entry is cataloged incorrectly, the first BCS entry is designated to be re-cataloged. The plurality of BCS entries is compared with a plurality of volume table of contents and a plurality of VSAM volume data set (VTOC/VVDS) entries. If a second BCS entry found in the plurality of BCS entries is not found in the plurality of VTOC/VVDS entries, and the second BCS entry indicates that a data set associated with the second BCS entry is located on a volume, an attempt is made to vary on the volume. If the volume cannot be varied on, a request is created to restore the volume.
    Type: Application
    Filed: January 15, 2009
    Publication date: July 22, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Darrell Christopher Clarke, Kyle Barret Dudgeon, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
  • Publication number: 20100185697
    Abstract: A plurality of catalogs are maintained, and wherein each catalog of the plurality of catalogs includes data sets and attributes of the data sets. An indication that a new data set is to be defined is received. A selected catalog is determined from the plurality of catalogs, wherein the selected catalog is suitable for including the new data set and attributes of the new data set. An entry that indicates a data set name corresponding to the new data set and an index to the selected catalog is inserted in a group table.
    Type: Application
    Filed: January 22, 2009
    Publication date: July 22, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Douglas Lee Lehr, Franklin Emmert Mccune, David Charles Reed, Max Douglas Smith
  • Publication number: 20100179928
    Abstract: A system and method that provide for decision support and/or training support in crisis decision-making situations are provided. In one implementation, for example, a method identifies patterns from known cases based on information from a crisis event. Each of the known cases includes attributes and at least one outcome. The method also identifies a first subset of the known cases that relate to the identified patterns from the known cases. The method also analyzes the identified patterns to determine a cue that, if answered, will provide a second subset of the known cases including a more converged range of decision outcomes than the first subset.
    Type: Application
    Filed: January 12, 2010
    Publication date: July 15, 2010
    Applicant: AlphaTRAC. Inc.
    Inventor: Charles Reed Hodgin
  • Publication number: 20100180262
    Abstract: A method, system, and computer program product for identifying an overlay of a data processing target structure in a computing environment is provided. At least one of examining a mapping macro for the target structure with a set of valid ranges, comparing the set of valid ranges with the target structure to identify a string of at least one first invalid value and a last invalid value and locate invalid regions of the target structure, and examining executable code associated with the target structure, comparing at least one unchanged module against at least one additional module exhibiting an overlay characteristic to identify the string of the at least one first invalid value and the last invalid value and locate invalid regions of the target structure, is performed.
    Type: Application
    Filed: January 15, 2009
    Publication date: July 15, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Herman ARANGUREN, David Bruce LeGENDRE, David Charles REED, Max Douglas SMITH
  • Patent number: RE41691
    Abstract: Method and apparatus for performing joint timing recovery in a digital receiver using multiple input signals. The apparatus comprises a plurality of phase detectors, a summer, a level shifter, a loop filter and a numerically controlled oscillator NCO. The phase detectors produce a phase signal by comparing a timing signal produced by the NCO with the input signals. The phase signals are then summed and the level shifter adjusts the summed value to compensate for the number of signals used to form the sum, i.e., the summed value is adjusted to be within the input range of the NCO.
    Type: Grant
    Filed: May 23, 2007
    Date of Patent: September 14, 2010
    Inventor: Charles Reed, Jr.