Patents by Inventor Ronald Chapman

Ronald Chapman 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: 20060117213
    Abstract: Data management systems, such as used in disk control units, employ memory entry lists to help keep track of user data. Improved performance of entry list maintenance is provided by the present invention. Much of the protocol employed to conduct such maintenance is preferably performed by hardware-based logic, thereby freeing other system resources to execute other processes. New entries to the memory list are only allowed at predetermined addresses and entries are updated by writing a predetermined data pattern to a previously allocated address. Optionally, improved error detection, such as a longitudinal redundancy check, may also be performed in an efficient manner during entry list maintenance to assure the integrity of the list.
    Type: Application
    Filed: November 17, 2004
    Publication date: June 1, 2006
    Applicant: International Business Machines (IBM) Corporation
    Inventors: Ronald Chapman, Gary Batchelor, Michael Benhase, Kenneth Todd
  • Publication number: 20060106957
    Abstract: A method of verifying the passage of a data write across a bus is provided including sending the data write from an originator across the bus to a target, counting the number of data entries received at the target with a counter, and transmitting a return echo write from the target across the bus to a return address. The method further includes attaching the counter value to other data associated with the return echo write and polling the return address. The method allows determination of the completion of a data write by comparing the number of data entries included in the data write with the counter value polled from the return address. Alternatively, in a data streaming environment the progress of a data write may be determined by comparing the number of data entries included in the data write at a select point in time with the counter value polled from the return address. Typical data entries which are counted may include, but are not limited to, bytes, words, double words, or similar data quantities.
    Type: Application
    Filed: November 17, 2004
    Publication date: May 18, 2006
    Applicant: International Business Machines (IBM) Corporation
    Inventors: Ronald Chapman, Michael Benhase, Gary Batchelor, Cheng-Chung Song
  • Publication number: 20050281201
    Abstract: A trace information queueing system receives a plurality of trace information signals and transmits them through a common connector. The multiple trace information signals may be multiplexed. Each edge of a clock signal may be used to enable transmission of different trace information signals. Alternatively, separate clocks signals may be provided for each trace information signal. A programmable logic device may be used to both multiplex the trace information signals and produce the clock signals necessary to enable their transmission.
    Type: Application
    Filed: June 17, 2004
    Publication date: December 22, 2005
    Inventors: Gary Batchelor, Ronald Chapman