Patents by Inventor Brent Cameron Beardsley

Brent Cameron Beardsley 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: 6535937
    Abstract: A method and system to verify the passage of one or more write commands sent from an originating location through a PCI bus system. An addressable data storage is located substantially at the end of the PCI bus system with respect to the originating location. A write command is sent by the originator subsequent to the one or more write commands, to a predetermined special end location address identifying the addressable storage. The command is accompanied by data comprising a predetermined special return address at the originating location. The PCI bus system transmits the write commands on a FIFO basis, so the one or more write commands precede the subsequently sent write command. Logic senses the subsequently sent write command, and responds to the command, sending a return echo write command to the predetermined special return address. The returning echo write command verifies the passage of the write commands and data through the PCI bus system.
    Type: Grant
    Filed: February 15, 2000
    Date of Patent: March 18, 2003
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Russell Lee Ellison, Gregg Steven Lucas, Juan Antonio Yanes
  • Publication number: 20030051113
    Abstract: Disclosed is a method, system, and article of manufacture for managing meta data. The meta data provides information on data maintained in a storage device. The system receives a request for meta data from a process and determines whether the requested meta data is in cache. After determining that the requested meta data is not in cache, the system determines whether there are a sufficient number of allocatable segments in cache to stage in the meta data and allocates segments in cache to store the meta data after determining that there are enough allocatable segments in cache. The system stages the requested meta data into the allocated segments. Alternatively, after determining that the requested meta data is in cache, the system determines whether a second process has exclusive access to the meta data in cache. After determining that the second process does not have exclusive access, the system indicates to the first process that access to the meta data is permitted.
    Type: Application
    Filed: October 11, 2002
    Publication date: March 13, 2003
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Douglas A. Martin, Robert Louis Morton, Kenneth Wayne Todd
  • Patent number: 6530043
    Abstract: In a PCI bus system, a method and system check for errors in rite data transferred from a PCI data source across a PCI bus to the PCI bus system, the data comprising a plurality of blocks. Redundancy calculation logic receives the write data across the PCI bus, calculates a check value for each block of the data transferred across the PCI bus, and updating any previously calculated check value with the calculated check value at a storage location of a storage memory. Data path logic is coupled to the PCI bus and to the storage memory, and responds to a unique identifier of a redundancy write command sent subsequent to completion of the transfer of the write data across the PCI interface. The data path logic responds to the write command unique identifier, detecting the updated calculated check value at the storage location of the storage memory.
    Type: Grant
    Filed: March 9, 2000
    Date of Patent: March 4, 2003
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Gregg Steven Lucas, Juan Antonio Yanes
  • Publication number: 20030037204
    Abstract: Provided is a method, system, and program for caching updates to one target storage device in a first and second memories, wherein the target storage device is one of a plurality of storage devices. A determination is made of an allocation of available space in the second memory to the storage devices, wherein a total of the allocation of the available space to all the storage devices exceeds one hundred percent of the available space in the second memory. An update to one target storage device is received and then a determination is made as to whether adding the update to the second memory will exceed the allocation of available space for the target storage device in the second memory. One copy of the update is written to the second memory if adding the update to the second memory will not exceed the allocation of available space for the target storage device.
    Type: Application
    Filed: August 17, 2001
    Publication date: February 20, 2003
    Applicant: International Business Machines Corporation
    Inventors: Kevin John Ash, Brent Cameron Beardsley, Michael Thomas Benhase
  • Patent number: 6513097
    Abstract: Disclosed is a system and method for caching data. A processor receives data from a host to modify a track in a first storage device. The processor stores a copy of the modified data in a cache and indicates in a second storage device the tracks for which there is modified data in cache. During data recovery operations, the processor processes the second storage device and data therein to determine the tracks for which there was modified data in cache. The processor then marks the determined tracks as failed to prevent data at the determined tracks in the first storage device from being returned in response to a read request until the failure is resolved. In further embodiments, in response to detecting a partial failure within the storage system, the processor would scan the cache to determine tracks for which there is modified data stored in the cache.
    Type: Grant
    Filed: March 3, 1999
    Date of Patent: January 28, 2003
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Robert Louis Morton, Kenneth Wayne Todd
  • Patent number: 6502174
    Abstract: Disclosed is a method, system, and article of manufacture for managing meta data. The meta data provides information on data maintained in a storage device. The system receives a request for meta data from a process and determines whether the requested meta data is in cache. After determining that the requested meta data is not in cache, the system determines whether there are a sufficient number of allocatable segments in cache to stage in the meta data and allocates segments in cache to store the meta data after determining that there are enough allocatable segments in cache. The system stages the requested meta data into the allocated segments. Alternatively, after determining that the requested meta data is in cache, the system determines whether a second process has exclusive access to the meta data in cache. After determining that the second process does not have exclusive access, the system indicates to the first process that access to the meta data is permitted.
    Type: Grant
    Filed: March 3, 1999
    Date of Patent: December 31, 2002
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Douglas A. Martin, Robert Louis Morton, Kenneth Wayne Todd
  • Patent number: 6496890
    Abstract: A shared bus hang prevention and recovery scheme for a data communication system is provided, where a shared bus is connected to a plurality of bus masters and corresponding slaves and located between an external bus connected to a system processor, and an internal bus connected to an internal processor. Some of the masters are associated with the external bus and others are associated with the internal bus, and one of the bus masters is a control master associated with the internal processor. The scheme utilizes a shared bus hang prevention and recovery device having a circuitry and a control code. The circuitry is timing each pending request of the control master for the shared bus and initiating bus recovery if the shared bus is hung up, when the control master exceeded a pre-determined time period allowed for waiting to acquire the shared bus control and complete the transfer on the shared bus.
    Type: Grant
    Filed: December 3, 1999
    Date of Patent: December 17, 2002
    Inventors: Michael Joseph Azevedo, Brent Cameron Beardsley, Bitwoded Okbay, Carol Spanel, Andrew Dale Walls
  • Publication number: 20020178331
    Abstract: Disclosed is a method, system, and program for prestaging data into cache from a storage system in preparation for data transfer operations. A first processing unit communicates data transfer operations to a second processing unit that controls access to the storage system. The first processing unit determines addressable locations in the storage system of data to prestage into cache and generates a data structure capable of indicating contiguous and non-contiguous addressable locations addressable locations in the storage system including the data to prestage into the cache. The first processing unit transmits a prestage command to the second processing unit. The prestage command causes the second processing unit to prestage into cache the data at the addressable locations indicated in the data structure. The first processing unit then requests data at the addressable locations indicated in the data structure. In response, the second processing unit returns the requested data from the cache.
    Type: Application
    Filed: July 12, 2002
    Publication date: November 28, 2002
    Inventors: Brent Cameron Beardsley, Jeffrey Allen Berger
  • Publication number: 20020138695
    Abstract: Disclosed is a method, system, and article of manufacture for processing modified meta data for data recovery operations. The meta data provides information on user data maintained in a storage device. The system determines whether meta data tracks maintained in a cache were modified and indicates in a non-volatile memory that the determined meta data tracks were modified. Data recovery operations may be initiated as a result of a system failure, such as a warmstart or coldstart recovery. During such data recovery operations, the system processes the non-volatile memory and the indications of modified meta data tracks therein to rebuild lost meta data tracks in the cache.
    Type: Application
    Filed: May 9, 2002
    Publication date: September 26, 2002
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Douglas A. Martin, Robert Louis Morton, Kenneth Wayne Todd
  • Patent number: 6449697
    Abstract: Disclosed is a method, system, and program for prestaging data into cache from a storage system in preparation for data transfer operations. A first processing unit communicates data transfer operations to a second processing unit that controls access to the storage system. The first processing unit determines addressable locations in the storage system of data to prestage into cache and generates a data structure capable of indicating contiguous and non-contiguous addressable locations addressable locations in the storage system including the data to prestage into the cache. The first processing unit transmits a prestage command to the second processing unit. The prestage command causes the second processing unit to prestage into cache the data at the addressable locations indicated in the data structure. The first processing unit then requests data at the addressable locations indicated in the data structure. In response, the second processing unit returns the requested data from the cache.
    Type: Grant
    Filed: April 23, 1999
    Date of Patent: September 10, 2002
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Jeffrey Allen Berger
  • Patent number: 6438661
    Abstract: Disclosed is a method, system, and article of manufacture for processing modified meta data for data recovery operations. The meta data provides information on user data maintained in a storage device. The system determines whether meta data tracks maintained in a cache were modified and indicates in a non-volatile memory that the determined meta data tracks were modified. Data recovery operations may be initiated as a result of a system failure, such as a warmstart or coldstart recovery. During such data recovery operations, the system processes the non-volatile memory and the indications of modified meta data tracks therein to rebuild lost meta data tracks in the cache.
    Type: Grant
    Filed: March 3, 1999
    Date of Patent: August 20, 2002
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Douglas A. Martin, Robert Louis Morton, Kenneth Wayne Todd
  • Patent number: 6425050
    Abstract: Disclosed is a method, system, and program for processing data access requests, such as read requests, to a storage location maintained in both a first storage, such as a cache, area and second storage area, such as a disk drive, during a destage operation. A destage operation is granted access to the storage location to destage data from the storage location in the first storage area to the second storage area. During the destage operation, a data access request is granted access to the storage location.
    Type: Grant
    Filed: September 17, 1999
    Date of Patent: July 23, 2002
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Thomas Charles Jarvis, Robert Louis Morton, Kenneth Wayne Todd
  • Patent number: 6381677
    Abstract: Disclosed is a system for caching data. After determining a sequential access of a first memory area, such as a direct access storage device (DASD), a processing unit stages a group of data sets from the first memory area to a second memory, such as cache. The processing unit processes a data access request (DAR) for data sets in the first memory area that are included in the sequential access and reads the requested data sets from the second memory area. The processing unit determines trigger data set from a plurality of trigger data sets based on a trigger data set criteria. The processing unit then stages a next group of data sets from the first memory area to the second memory area in response to reading the determined trigger data set.
    Type: Grant
    Filed: August 19, 1998
    Date of Patent: April 30, 2002
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Joseph Smith Hyde, Thomas Charles Jarvis, Douglas A. Martin, Robert Louis Morton
  • Publication number: 20020035666
    Abstract: A method and apparatus for improving write performance in a disk array is disclosed. The invention avoids unnecessary track grouping during writes by using a full track write counter. When a write request is received, the full track write counter for tracks in a stripe of tracks associated with the write request is analyzed, a determination of whether the write request involves a full track write is made and a cache destage is subsequently executed based on the analysis of the full track write counter for tracks in a stripe of tracks associated with the write request. The full track write counter is not incremented when the write to cache is not a full track write. When the write to cache is a full track write, a previous track full track count is fetched, a full track count of the tracks associated with the write request are set to be equal to the minimum of either the stripe width or the previous track's full track count plus 1.
    Type: Application
    Filed: June 29, 1998
    Publication date: March 21, 2002
    Inventors: BRENT CAMERON BEARDSLEY, THOMAS CHARLES JARVIS, DAVID FRANK MANNENBACH, ROBERT LOUIS MORTON
  • Patent number: 6345295
    Abstract: A trace facility for a computer system attachment network, a method for operating that network, and trace tools in the network. The network has a plurality of the trace tools, each connected to a communication path, the trace facility providing a system wide trace. The trace facility comprises at least one trace buffer at each trace tool. Each trace tool has an address filter selecting an address range of information on the bus, the information being communicated on the bus as events, and storing the selected event information in the trace buffers, thereby conducting a trace. A breakpoint connection is provided interconnecting each of the trace tools. A trace tool control at each trace tool responds to a trace stop command addressed to the trace tool, to stop the trace at its address filter and trace buffer, and to issue a breakpoint signal on the breakpoint connection to all the interconnected trace tools.
    Type: Grant
    Filed: January 22, 1999
    Date of Patent: February 5, 2002
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Carl Evan Jones, William Griswold Sherman, Joe Edward Smothers
  • Patent number: 6327644
    Abstract: Disclosed is a system for managing data in cache. A list of data entries in a first memory area has a first end and a second end, such as a most recently used (MRU) end and least recently used (LRU) end. A first pointer addresses a data entry in the list and a second pointer addresses another data entry in the list that is not at the first and second ends. Data from a second memory area is provided to add to the list. A determination is made as to whether the provided data to add to the list is one of a first type and second type of data, such as sequentially accessed data or non-sequentially accessed data. The provided data is stored in the first memory area as a new data entry in the list. The first pointer is modified to address the new data entry after determining that the provided data is of the first type. After determining that the provided data is of the second type, the second pointer is processed to determine where to add the new data entry to the list between the first and second ends.
    Type: Grant
    Filed: August 18, 1998
    Date of Patent: December 4, 2001
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, Michael Thomas Benhase, Douglas A. Martin, Robert Louis Morton, Mark A. Reid
  • Patent number: 6324621
    Abstract: Aspects for caching storage data include partitioning a storage cache to include a compressed data partition and an uncompressed data partition, and adjusting a size of the compressed data partition and the uncompressed data partition for chosen performance characteristics. A data caching system aspect in a data processing system having a host system in communication with a storage system includes at least one storage device and at least one partially compressed cache. The at least one partially compressed cache further includes an uncompressed partition and a compressed partition, where the compressed partition stores at least a victim data unit from the uncompressed partition.
    Type: Grant
    Filed: June 10, 1998
    Date of Patent: November 27, 2001
    Assignee: International Business Machines Corporation
    Inventors: Shanker Singh, Joe-Ming Cheng, Brent Cameron Beardsley, Dell Patrick Leabo, Forrest Lee Wade, Michael Thomas Benhase, Marc Ethan Goldfeder
  • Patent number: 6304980
    Abstract: A peer-to-peer backup storage system automatically switches from a primary storage site to a mirrored backup site in response to a primary site failure, where the secondary site then honors any existing host initiated reservation of primary storage. Each site includes a storage controller and storage, where the primary site receives and stores data and forwards the received data to the secondary site for storage to mirror contents of primary storage. The primary and secondary sites are coupled to one or more hosts. Whenever the primary controller receives a reserve request from a host, it reserves the primary storage (or a subpart thereof) for the exclusive use of the reserve-initiating host. This may involve, for example, the primary controller storing a path group ID that identifies the reserving host. The primary controller also notifies the secondary controller of the reservation, e.g., sending the path group ID involved in the reservation operation to the secondary site.
    Type: Grant
    Filed: January 19, 1999
    Date of Patent: October 16, 2001
    Assignee: International Business Machines Corporation
    Inventors: Brent Cameron Beardsley, James Lincoln Iskiyan, William Frank Micka, Harry Morris Yudenfriend
  • Patent number: 6304940
    Abstract: Disclosed are a shared direct access data storage system and sharing method for use with both an MVS data processing system and a data processing system employing FBA data, for storing data set records received from the MVS data processing system. A CKD controller receives the data set from the MVS data processing system. An FBA controller and disk data storage provides direct access to FBA records by the FBA data processing system. A mapping element maps the data set records from the MVS data processing system into FBA data records with fixed blocks. The received data set records are uniformly sized, and the mapping element converts the uniformly sized records into smaller sized fixed blocks, with the size of the uniformly sized records being an even multiple of the smaller sized fixed blocks. A map translates the data of the first record of the data set into the block id of the first block and continues to map the data set into a continuing sequence of fixed blocks.
    Type: Grant
    Filed: May 18, 1999
    Date of Patent: October 16, 2001
    Assignee: International Business Machines Corporation
    Inventor: Brent Cameron Beardsley
  • Patent number: 6286074
    Abstract: Disclosed is a bridge system for processing read transactions over a bus in which in a preferred embodiment prefetched data stored in a buffer is not discarded if the address of the requested read does not match the beginning address of the prefetched data. Instead, the bridge system skips to the next address of the prefetched data stored in the buffer and compares that address to the address of the read request to determine if a match exists. If the requested read address does match the next prefetched data address, the prefetched data starting at that next address is read out and forwarded to the requesting agent. Alternatively, if there is not a match, the bridge skips again to the next address and continues checking for a match until either the prefetched data is exhausted or another predetermined limit has been reached. In this manner, many unnecessary data reads of data already prefetched in the buffer may be avoided.
    Type: Grant
    Filed: March 24, 1999
    Date of Patent: September 4, 2001
    Assignee: International Business Machines Corporation
    Inventors: Gary William Batchelor, Brent Cameron Beardsley, Matthew Joseph Kalos, Forrest Lee Wade