Patents by Inventor James McCarty

James McCarty 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: 7137032
    Abstract: Methods and systems for managing disk capacity allocated to a data log in a source data storage system during a merge process are disclosed. Data in the data log may be merged into corresponding data on a destination storage system connected to the source data storage system by at least one communication link. In one embodiment a method comprises maintaining a ratio of merge writes out of the data log to writes from a host computer into the data log within a desired range until the write process reaches a predetermined distance from the end of the data log, and quiescing writes from a host computer into the data log until the data log is fully written to the destination storage system.
    Type: Grant
    Filed: June 27, 2005
    Date of Patent: November 14, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Patent number: 7130391
    Abstract: An automated method, system and computer instructions for users to visually navigate telephone call trees are disclosed. A caller can connect to an automated telephone answering service, and download the service's call tree. The caller can view a display with the call tree, and modify or rearrange the order in which the menu options of the call tree are displayed. The user can then store the modified call tree for use in the future. Responsive to the selection of a specified node in the displayed call tree, an automated process can create a macro or similar set of software instructions, which can be invoked by the calling device during a subsequent connection to the automated telephone answering system associated with the subject call tree, in order to enter a queue associated with the selected node that enables the user to interact with the selected node.
    Type: Grant
    Filed: January 7, 2004
    Date of Patent: October 31, 2006
    Assignee: International Business Machines Corporation
    Inventors: Janani Janakiraman, David Bruce Kumhyr, Richard James McCarty
  • Publication number: 20060085539
    Abstract: A format is provided for a command signal from a target device comprising a bit field adapted for communicating a unit attention signal from the target device following a status changing event. A method is provided for managing a unit attention signal from a target device in a distributed network, comprising: setting an indicator bit in a bit field of a command signal from the target device to a signaling value when a predetermined condition warrants an associated unit attention signal; detecting the indicator bit; and indexing a table in relation to the indicator bit to send the unit attention signal.
    Type: Application
    Filed: October 18, 2004
    Publication date: April 20, 2006
    Inventors: James McCarty, Michael Walker
  • Patent number: 7032131
    Abstract: Methods and systems for managing disk capacity allocated to a data log in a source data storage system during a merge process are disclosed. Data in the data log may be merged into corresponding data on a destination storage system connected to the source data storage system by at least one communication link. In one embodiment a method comprises maintaining a ratio of merge writes out of the data log to writes from a host computer into the data log within a desired range until the write process reaches a predetermined distance from the end of the data log, and quiescing writes from a host computer into the data log until the data log is fully written to the destination storage system.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: April 18, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Patent number: 7007042
    Abstract: A data storage system adapted to maintain redundant data storage sets at a destination location(s) is disclosed. The data storage system establishes a copy set comprising a source volume and a destination volume. Data written to a source volume is automatically copied to the destination volume. The data storage system maintains a data log that may be activated when the destination volume is inaccessible due to, for example, a malfunction in the destination storage system or in the communication link between the source system and the destination system. I/O commands and the data associated with those commands are written to the data log, and after a destination system becomes available the information in the data log is merged into the destination volume to conform the data in the destination volume to the data in the source volume. The data log competes for disk capacity with other volumes on the system, and log memory is allocated as needed.
    Type: Grant
    Filed: March 28, 2002
    Date of Patent: February 28, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar
  • Patent number: 6996672
    Abstract: A system and method for replicating data between a plurality of storage locations. Each storage location has a controller with a port to a data communication network and a pool of storage. A logical unit (LUN) of storage is implemented at each storage location such that each implemented LUN comprises a substantially complete replica of the data stored in each other LUN. At least two of the controllers at the plurality of storage locations present their implemented LUN as an active device to the one or more host systems for receiving operational data access requests. Preferably, there are three or more storage locations in the system. Preferably, there are three or more storage locations in the system and each storage location can behave as a source location or a destination location for a particular operational data transaction.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: February 7, 2006
    Assignee: Hewlett-Packard Development, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20050262298
    Abstract: A data storage system adapted to maintain redundant data storage sets at a destination location(s) is disclosed. The data storage system establishes a copy set comprising a source volume and a destination volume. Data written to a source volume is automatically copied to the destination volume. The data storage system maintains a data log that may be activated when the destination volume is inaccessible due to, for example, a malfunction in the destination storage system or in the communication link between the source system and the destination system. I/O commands and the data associated with those commands are written to the data log, and after a destination system becomes available the information in the data log is merged into the destination volume to conform the data in the destination volume to the data in the source volume. The data log competes for disk capacity with other volumes on the system, and log memory is allocated as needed.
    Type: Application
    Filed: June 27, 2005
    Publication date: November 24, 2005
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20050243611
    Abstract: A data replication management (DRM) architecture comprising a plurality of storage cells interconnected by a fabric. Flexibility in connectivity is provided by configuring each storage cell port to the fabric to handle both host data access requests and DRM traffic. Each storage cell comprises one or more storage controllers that can be connected to the fabric in any combination. Processes executing in the storage controller find a path to a desired destination storage cell. The discovery algorithm implements a link service that exchanges information related to DRM between the storage controllers. The DRM architecture is symmetric and peer cooperative such that each controller and storage cell can function as a source and a destination of replicated data. The DRM architecture supports parallel and serial “fan-out” to multiple destinations, whereby the multiple storage cells may implement data replicas.
    Type: Application
    Filed: June 13, 2005
    Publication date: November 3, 2005
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20050229021
    Abstract: A data storage system adapted to maintain redundant data storage sets at a destination location(s) is disclosed. The data storage system establishes a copy set comprising a source volume and a destination volume. Data written to a source volume is automatically copied to the destination volume. The data storage system maintains a data log that may be activated when the destination volume is inaccessible due to, for example, a malfunction in the destination storage system or in the communication link between the source system and the destination system. I/O commands and the data associated with those commands are written to the data log, and after a destination system becomes available the information in the data log is merged into the destination volume to conform the data in the destination volume to the data in the source volume. The data log competes for disk capacity with other volumes on the system, and log memory is allocated as needed.
    Type: Application
    Filed: April 21, 2005
    Publication date: October 13, 2005
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen Sicols, James McCarty, Anuja Korguonkar, Jason Leveille
  • Patent number: 6947981
    Abstract: A data replication management (DRM) architecture comprising a plurality of storage cells interconnected by a fabric. Flexibility in connectivity is provided by configuring each storage cell port to the fabric to handle both host data access requests and DRM traffic. Each storage cell comprises one or more storage controllers that can be connected to the fabric in any combination. Processes executing in the storage controller find a path to a desired destination storage cell. The discovery algorithm implements a link service that exchanges information related to DRM between the storage controllers. The DRM architecture is symmetric and peer cooperative such that each controller and storage cell can function as a source and a destination of replicated data. The DRM architecture supports parallel and serial “fan-out” to multiple destinations, whereby the multiple storage cells may implement data replicas.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: September 20, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Patent number: 6934826
    Abstract: Methods for allocating memory for logging data written by a host computer to a source virtual disk and for managing memory allocated to a data log, in a data storage system adapted to maintain redundant data storage sets at a destination location(s) are disclosed. The data storage system maintains a data log that may be activated when a destination volume is inaccessible. During the logging process the system implements an adaptive memory allocation algorithm that adjusts the log memory allocation increment as a function of the velocity of logging data written by the host computer(s). Similarly, during a merge process the system implements an adaptive memory deallocation algorithm that deallocates log memory in response to the velocity of logging data written by the host computer(s) and the velocity of merge data transmitted to the remote system. An amount of memory allocated to logging data may be compared with an amount of memory allocated to corresponding user data and, if greater, the data log terminated.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: August 23, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Patent number: 6928513
    Abstract: A data storage system adapted to maintain redundant data storage sets at a destination location(s) is disclosed. The data storage system establishes a copy set comprising a source volume and a destination volume. Data written to a source volume is automatically copied to the destination volume. The data storage system maintains a data log that may be activated when the destination volume is inaccessible due to, for example, a malfunction in the destination storage system or in the communication link between the source system and the destination system. I/O commands and the data associated with those commands are written to the data log, and after a destination system becomes available the information in the data log is merged into the destination volume to conform the data in the destination volume to the data in the source volume. The data log competes for disk capacity with other volumes on the system, and log memory is allocated as needed.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: August 9, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Patent number: 6880052
    Abstract: A storage area network (SAN) controller and method for storing and replicating data between sites in a storage area network in which storage controllers at each site implement storage virtualization. A storage cell is implemented at each site comprising at least one storage controller and a pool of physical storage coupled to the controller. A copy set comprising a logical unit (LUN) of storage, referred to as a member, in each of the storage cells is defined. As operational data transactions are performed against one of the members of a copy set, they are replicated, immediately or after a delay, in each other member of the copy set. As changes are made to dependent attributes such as size of one member of the copy set, the change is replicated in each other member of the copy set automatically. Changes can be made in the independent attributes such as size of each member of the copy set independently of other members of the copy set.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: April 12, 2005
    Assignee: Hewlett-Packard Development Company, LP
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20040230792
    Abstract: A method and system for transparently encrypting (and decrypting) sensitive data stored in a directory (or other database) is provided. Sensitive data, a password for example, may be required by a client in a distributed data processing environment. When the database entry is created, the sensitive data received from a user, or more generally, a client, may be encrypted, and saved in the directory entry in encrypted form. Encryption of sensitive data may be performed in accordance with a predetermined set of policies. When the sensitive information is needed, it may be selectively delivered in encrypted or unencrypted form based on a policy in the set. Policies may include criteria external to the database, and interfaced to the database via a policy engine.
    Type: Application
    Filed: April 24, 2003
    Publication date: November 18, 2004
    Applicant: International Business Machines Corporation
    Inventor: Richard James McCarty
  • Publication number: 20040143633
    Abstract: Instant messages are processed in accordance with restrictions associated with privacy codes. A privacy code is obtained from a sender system prior to acceptance or delivery of any instant messages from the sender system. If a privacy code is received from the sender system, then a recipient system accepts or delivers instant messages from the sender system.
    Type: Application
    Filed: January 18, 2003
    Publication date: July 22, 2004
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Richard James McCarty
  • Publication number: 20040143632
    Abstract: A process is presented for publishing privacy codes for an instant messaging system that processes instant messages in accordance with restrictions associated with the privacy codes. An electronic distribution method is associated with a privacy code, which is required by a recipient system from a sender system before delivering an instant message that has been received at the recipient system from the sender system. Possibly based on a triggered condition, the privacy code is published in accordance with its associated electronic distribution method. The electronic distribution method may comprise Web-based distribution, email distribution, or instant message distribution; the distribution may involve pushing the privacy code from a first system to a second system or may involve pulling the privacy code from the first system by the second system. The privacy code and its associated electronic distribution method may be managed in accordance with a privacy policy.
    Type: Application
    Filed: January 18, 2003
    Publication date: July 22, 2004
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Richard James McCarty
  • Publication number: 20030188229
    Abstract: A data storage system adapted to maintain redundant data storage sets at a destination location(s) is disclosed. The data storage system establishes a copy set comprising a source volume and a destination volume. Data written to a source volume is automatically copied to the destination volume. The data storage system maintains a data log that may be activated when the destination volume is inaccessible due to, for example, a malfunction in the destination storage system or in the communication link between the source system and the destination system. I/O commands and the data associated with those commands are written to the data log, and after a destination system becomes available the information in the data log is merged into the destination volume to conform the data in the destination volume to the data in the source volume. The data log competes for disk capacity with other volumes on the system, and log memory is allocated as needed.
    Type: Application
    Filed: March 26, 2002
    Publication date: October 2, 2003
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20030187947
    Abstract: A data storage system adapted to maintain redundant data storage sets at a destination location(s) is disclosed. The data storage system establishes a copy set comprising a source volume and a destination volume. Data written to a source volume is automatically copied to the destination volume. The data storage system maintains a data log that may be activated when the destination volume is inaccessible due to, for example, a malfunction in the destination storage system or in the communication link between the source system and the destination system. I/O commands and the data associated with those commands are written to the data log, and after a destination system becomes available the information in the data log is merged into the destination volume to conform the data in the destination volume to the data in the source volume. The data log competes for disk capacity with other volumes on the system, and log memory is allocated as needed.
    Type: Application
    Filed: March 26, 2002
    Publication date: October 2, 2003
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20030188035
    Abstract: A system for communicating between two devices in a network in which a semi-persistent tunnel is established between the two devices in advance of data communication. The semi-persistent tunnel includes resources that are pre-allocated in a first device at a first end of the communication link by a second device at the second end of the communication link. The first and second devices implement a plurality of processes for handling data transfer operations. Preferably, the semi-persistent tunnel also includes resources that are pre-allocated in a device at the second end of the communication link by the device at the first end of the communication link to allow bi-directional communication. Data transfer operations transmitted through the tunnel include an identification of specific resources of the pre-allocated resources that are to handle the data transfer operation.
    Type: Application
    Filed: March 26, 2002
    Publication date: October 2, 2003
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille
  • Publication number: 20030187861
    Abstract: A system in which data operations for a data replication group are received in-order, and buffered. When the operations are complete, they are stored in a non-volatile memory atomically with a group sequence number. The cache is preferably mirrored. This creates a persistent association between the data operation and the sequence number. After the atomic store is performed in at least one non-volatile cache, the data operation is propagated to another member of the data replication group along with the group sequence number. In the other member, the data operation is cached at least once in a non-volatile cache atomically with the group sequence number. In this manner, the set of group sequence numbers for a plurality of operations forms a continuous ordering of the data operations.
    Type: Application
    Filed: March 26, 2002
    Publication date: October 2, 2003
    Inventors: Clark Lubbers, Susan Elkington, Randy Hess, Stephen J. Sicola, James McCarty, Anuja Korgaonkar, Jason Leveille